./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 08:59:24,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 08:59:24,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 08:59:24,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 08:59:24,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 08:59:24,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 08:59:24,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 08:59:24,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 08:59:24,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 08:59:24,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 08:59:24,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 08:59:24,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 08:59:24,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 08:59:24,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 08:59:24,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 08:59:24,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 08:59:24,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 08:59:24,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 08:59:24,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 08:59:24,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 08:59:24,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 08:59:24,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 08:59:24,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 08:59:24,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 08:59:24,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 08:59:24,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 08:59:24,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 08:59:24,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 08:59:24,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 08:59:24,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 08:59:24,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 08:59:24,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 08:59:24,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 08:59:24,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 08:59:24,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 08:59:24,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 08:59:24,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 08:59:24,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 08:59:24,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 08:59:24,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 08:59:24,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 08:59:24,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 08:59:24,922 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 08:59:24,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 08:59:24,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 08:59:24,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 08:59:24,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 08:59:24,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 08:59:24,927 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 08:59:24,927 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 08:59:24,927 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 08:59:24,927 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 08:59:24,928 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 08:59:24,928 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 08:59:24,928 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 08:59:24,928 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 08:59:24,928 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 08:59:24,928 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 08:59:24,929 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 08:59:24,929 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 08:59:24,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 08:59:24,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 08:59:24,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 08:59:24,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 08:59:24,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 08:59:24,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:59:24,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 08:59:24,932 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 08:59:24,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 08:59:24,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/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_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh 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 ! overflow) ) 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 -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2022-12-14 08:59:25,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 08:59:25,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 08:59:25,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 08:59:25,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 08:59:25,115 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 08:59:25,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-14 08:59:27,671 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 08:59:27,854 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 08:59:27,855 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-12-14 08:59:27,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/data/ba58b5901/5c2112a1792b47c6ab9cd0afe12b87ae/FLAG00829e046 [2022-12-14 08:59:27,877 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/data/ba58b5901/5c2112a1792b47c6ab9cd0afe12b87ae [2022-12-14 08:59:27,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 08:59:27,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 08:59:27,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 08:59:27,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 08:59:27,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 08:59:27,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:59:27" (1/1) ... [2022-12-14 08:59:27,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ea643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:27, skipping insertion in model container [2022-12-14 08:59:27,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:59:27" (1/1) ... [2022-12-14 08:59:27,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 08:59:27,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 08:59:28,056 WARN L237 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_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-14 08:59:28,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:59:28,121 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 08:59:28,133 WARN L237 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_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-12-14 08:59:28,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 08:59:28,172 INFO L208 MainTranslator]: Completed translation [2022-12-14 08:59:28,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28 WrapperNode [2022-12-14 08:59:28,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 08:59:28,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 08:59:28,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 08:59:28,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 08:59:28,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,213 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 284 [2022-12-14 08:59:28,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 08:59:28,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 08:59:28,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 08:59:28,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 08:59:28,223 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,237 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 08:59:28,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 08:59:28,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 08:59:28,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 08:59:28,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (1/1) ... [2022-12-14 08:59:28,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 08:59:28,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 08:59:28,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 08:59:28,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 08:59:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 08:59:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 08:59:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 08:59:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 08:59:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 08:59:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 08:59:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 08:59:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 08:59:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 08:59:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 08:59:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 08:59:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 08:59:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 08:59:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 08:59:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 08:59:28,307 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 08:59:28,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 08:59:28,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 08:59:28,373 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 08:59:28,375 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 08:59:28,683 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 08:59:28,817 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 08:59:28,818 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 08:59:28,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:59:28 BoogieIcfgContainer [2022-12-14 08:59:28,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 08:59:28,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 08:59:28,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 08:59:28,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 08:59:28,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 08:59:27" (1/3) ... [2022-12-14 08:59:28,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60571018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:59:28, skipping insertion in model container [2022-12-14 08:59:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:59:28" (2/3) ... [2022-12-14 08:59:28,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60571018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 08:59:28, skipping insertion in model container [2022-12-14 08:59:28,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:59:28" (3/3) ... [2022-12-14 08:59:28,828 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2022-12-14 08:59:28,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 08:59:28,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-14 08:59:28,888 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 08:59:28,894 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@c4c091c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 08:59:28,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-14 08:59:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 72 states have internal predecessors, (97), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 08:59:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 08:59:28,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:28,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:28,906 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:28,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1566583066, now seen corresponding path program 1 times [2022-12-14 08:59:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:28,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129161508] [2022-12-14 08:59:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:59:29,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:29,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129161508] [2022-12-14 08:59:29,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129161508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:29,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:29,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 08:59:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172565165] [2022-12-14 08:59:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:29,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 08:59:29,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 08:59:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 08:59:29,199 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 72 states have internal predecessors, (97), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:29,409 INFO L93 Difference]: Finished difference Result 259 states and 368 transitions. [2022-12-14 08:59:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 08:59:29,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-12-14 08:59:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:29,419 INFO L225 Difference]: With dead ends: 259 [2022-12-14 08:59:29,419 INFO L226 Difference]: Without dead ends: 162 [2022-12-14 08:59:29,422 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:29,424 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 209 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:29,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 308 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:59:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-14 08:59:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2022-12-14 08:59:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.4324324324324325) internal successors, (159), 118 states have internal predecessors, (159), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-14 08:59:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2022-12-14 08:59:29,474 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 35 [2022-12-14 08:59:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:29,474 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2022-12-14 08:59:29,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2022-12-14 08:59:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 08:59:29,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:29,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:29,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 08:59:29,477 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1627753802, now seen corresponding path program 1 times [2022-12-14 08:59:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606028633] [2022-12-14 08:59:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:29,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:59:29,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:29,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606028633] [2022-12-14 08:59:29,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606028633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:29,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:29,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 08:59:29,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534792403] [2022-12-14 08:59:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:29,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 08:59:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 08:59:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 08:59:29,591 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:29,916 INFO L93 Difference]: Finished difference Result 847 states and 1209 transitions. [2022-12-14 08:59:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 08:59:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-12-14 08:59:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:29,921 INFO L225 Difference]: With dead ends: 847 [2022-12-14 08:59:29,921 INFO L226 Difference]: Without dead ends: 695 [2022-12-14 08:59:29,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 08:59:29,923 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 405 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:29,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:59:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-12-14 08:59:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 655. [2022-12-14 08:59:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 477 states have (on average 1.3815513626834381) internal successors, (659), 490 states have internal predecessors, (659), 112 states have call successors, (112), 60 states have call predecessors, (112), 60 states have return successors, (154), 105 states have call predecessors, (154), 112 states have call successors, (154) [2022-12-14 08:59:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 925 transitions. [2022-12-14 08:59:29,988 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 925 transitions. Word has length 36 [2022-12-14 08:59:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:29,988 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 925 transitions. [2022-12-14 08:59:29,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 925 transitions. [2022-12-14 08:59:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 08:59:29,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:29,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 08:59:29,989 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:29,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 765390970, now seen corresponding path program 1 times [2022-12-14 08:59:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14191078] [2022-12-14 08:59:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:59:30,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:30,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14191078] [2022-12-14 08:59:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14191078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:30,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:30,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:59:30,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41778372] [2022-12-14 08:59:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:30,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:59:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:30,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:59:30,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:59:30,116 INFO L87 Difference]: Start difference. First operand 655 states and 925 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:30,410 INFO L93 Difference]: Finished difference Result 1751 states and 2474 transitions. [2022-12-14 08:59:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:59:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-12-14 08:59:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:30,418 INFO L225 Difference]: With dead ends: 1751 [2022-12-14 08:59:30,418 INFO L226 Difference]: Without dead ends: 1102 [2022-12-14 08:59:30,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:59:30,422 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 293 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:30,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 340 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:59:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-12-14 08:59:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1000. [2022-12-14 08:59:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 734 states have (on average 1.3514986376021798) internal successors, (992), 748 states have internal predecessors, (992), 162 states have call successors, (162), 96 states have call predecessors, (162), 98 states have return successors, (223), 156 states have call predecessors, (223), 162 states have call successors, (223) [2022-12-14 08:59:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1377 transitions. [2022-12-14 08:59:30,530 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1377 transitions. Word has length 40 [2022-12-14 08:59:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:30,530 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1377 transitions. [2022-12-14 08:59:30,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 08:59:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1377 transitions. [2022-12-14 08:59:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 08:59:30,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:30,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:30,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 08:59:30,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 305062014, now seen corresponding path program 1 times [2022-12-14 08:59:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408970304] [2022-12-14 08:59:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:30,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 08:59:30,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408970304] [2022-12-14 08:59:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408970304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:30,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:30,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376676331] [2022-12-14 08:59:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:30,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:30,582 INFO L87 Difference]: Start difference. First operand 1000 states and 1377 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 08:59:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:30,682 INFO L93 Difference]: Finished difference Result 2178 states and 3031 transitions. [2022-12-14 08:59:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:30,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-12-14 08:59:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:30,687 INFO L225 Difference]: With dead ends: 2178 [2022-12-14 08:59:30,687 INFO L226 Difference]: Without dead ends: 1562 [2022-12-14 08:59:30,689 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:30,690 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 88 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:30,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 205 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:59:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-12-14 08:59:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1166. [2022-12-14 08:59:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 854 states have (on average 1.3231850117096018) internal successors, (1130), 866 states have internal predecessors, (1130), 190 states have call successors, (190), 114 states have call predecessors, (190), 116 states have return successors, (249), 186 states have call predecessors, (249), 190 states have call successors, (249) [2022-12-14 08:59:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1569 transitions. [2022-12-14 08:59:30,753 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1569 transitions. Word has length 41 [2022-12-14 08:59:30,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:30,754 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1569 transitions. [2022-12-14 08:59:30,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 08:59:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1569 transitions. [2022-12-14 08:59:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 08:59:30,755 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:30,755 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 08:59:30,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 08:59:30,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 278191040, now seen corresponding path program 1 times [2022-12-14 08:59:30,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939558243] [2022-12-14 08:59:30,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:30,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:59:30,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939558243] [2022-12-14 08:59:30,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939558243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:30,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:30,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:59:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785951662] [2022-12-14 08:59:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:30,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:59:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:30,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:59:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:59:30,861 INFO L87 Difference]: Start difference. First operand 1166 states and 1569 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:59:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:31,167 INFO L93 Difference]: Finished difference Result 2929 states and 3996 transitions. [2022-12-14 08:59:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:59:31,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-12-14 08:59:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:31,173 INFO L225 Difference]: With dead ends: 2929 [2022-12-14 08:59:31,173 INFO L226 Difference]: Without dead ends: 1769 [2022-12-14 08:59:31,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:59:31,176 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 264 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:31,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 322 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 08:59:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-12-14 08:59:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1540. [2022-12-14 08:59:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1129 states have (on average 1.3126660761736049) internal successors, (1482), 1143 states have internal predecessors, (1482), 251 states have call successors, (251), 152 states have call predecessors, (251), 154 states have return successors, (323), 245 states have call predecessors, (323), 251 states have call successors, (323) [2022-12-14 08:59:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2056 transitions. [2022-12-14 08:59:31,262 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2056 transitions. Word has length 50 [2022-12-14 08:59:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:31,262 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 2056 transitions. [2022-12-14 08:59:31,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:59:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2056 transitions. [2022-12-14 08:59:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 08:59:31,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:31,263 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 08:59:31,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 08:59:31,264 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash -28340267, now seen corresponding path program 1 times [2022-12-14 08:59:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:31,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940741669] [2022-12-14 08:59:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:59:31,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940741669] [2022-12-14 08:59:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940741669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:31,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:31,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199831459] [2022-12-14 08:59:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:31,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:31,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:31,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:31,303 INFO L87 Difference]: Start difference. First operand 1540 states and 2056 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 08:59:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:31,453 INFO L93 Difference]: Finished difference Result 3280 states and 4432 transitions. [2022-12-14 08:59:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-12-14 08:59:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:31,460 INFO L225 Difference]: With dead ends: 3280 [2022-12-14 08:59:31,460 INFO L226 Difference]: Without dead ends: 1915 [2022-12-14 08:59:31,462 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:31,463 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:31,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 269 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:59:31,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-12-14 08:59:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1645. [2022-12-14 08:59:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1216 states have (on average 1.3174342105263157) internal successors, (1602), 1230 states have internal predecessors, (1602), 260 states have call successors, (260), 161 states have call predecessors, (260), 163 states have return successors, (332), 254 states have call predecessors, (332), 260 states have call successors, (332) [2022-12-14 08:59:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2194 transitions. [2022-12-14 08:59:31,592 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2194 transitions. Word has length 51 [2022-12-14 08:59:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:31,592 INFO L495 AbstractCegarLoop]: Abstraction has 1645 states and 2194 transitions. [2022-12-14 08:59:31,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 08:59:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2194 transitions. [2022-12-14 08:59:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 08:59:31,594 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:31,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:31,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 08:59:31,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1646325373, now seen corresponding path program 1 times [2022-12-14 08:59:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:31,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541790183] [2022-12-14 08:59:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 08:59:31,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:31,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541790183] [2022-12-14 08:59:31,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541790183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:31,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:31,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 08:59:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353205224] [2022-12-14 08:59:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 08:59:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 08:59:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 08:59:31,692 INFO L87 Difference]: Start difference. First operand 1645 states and 2194 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:59:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:32,076 INFO L93 Difference]: Finished difference Result 4693 states and 6246 transitions. [2022-12-14 08:59:32,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 08:59:32,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2022-12-14 08:59:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:32,088 INFO L225 Difference]: With dead ends: 4693 [2022-12-14 08:59:32,088 INFO L226 Difference]: Without dead ends: 3054 [2022-12-14 08:59:32,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 08:59:32,091 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 284 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:32,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 333 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 08:59:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-12-14 08:59:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2890. [2022-12-14 08:59:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2123 states have (on average 1.2925105982100802) internal successors, (2744), 2144 states have internal predecessors, (2744), 466 states have call successors, (466), 291 states have call predecessors, (466), 295 states have return successors, (598), 455 states have call predecessors, (598), 466 states have call successors, (598) [2022-12-14 08:59:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3808 transitions. [2022-12-14 08:59:32,287 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3808 transitions. Word has length 51 [2022-12-14 08:59:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:32,287 INFO L495 AbstractCegarLoop]: Abstraction has 2890 states and 3808 transitions. [2022-12-14 08:59:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 08:59:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3808 transitions. [2022-12-14 08:59:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 08:59:32,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:32,288 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:32,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 08:59:32,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 289077579, now seen corresponding path program 1 times [2022-12-14 08:59:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:32,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315373230] [2022-12-14 08:59:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 08:59:32,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:32,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315373230] [2022-12-14 08:59:32,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315373230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:32,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:32,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706495275] [2022-12-14 08:59:32,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:32,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:32,333 INFO L87 Difference]: Start difference. First operand 2890 states and 3808 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 08:59:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:32,564 INFO L93 Difference]: Finished difference Result 5432 states and 7258 transitions. [2022-12-14 08:59:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:32,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-12-14 08:59:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:32,575 INFO L225 Difference]: With dead ends: 5432 [2022-12-14 08:59:32,575 INFO L226 Difference]: Without dead ends: 3475 [2022-12-14 08:59:32,579 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:32,580 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:32,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 273 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:59:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2022-12-14 08:59:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3056. [2022-12-14 08:59:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2259 states have (on average 1.297476759628154) internal successors, (2931), 2280 states have internal predecessors, (2931), 481 states have call successors, (481), 306 states have call predecessors, (481), 310 states have return successors, (613), 470 states have call predecessors, (613), 481 states have call successors, (613) [2022-12-14 08:59:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4025 transitions. [2022-12-14 08:59:32,776 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 4025 transitions. Word has length 53 [2022-12-14 08:59:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:32,776 INFO L495 AbstractCegarLoop]: Abstraction has 3056 states and 4025 transitions. [2022-12-14 08:59:32,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 08:59:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 4025 transitions. [2022-12-14 08:59:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 08:59:32,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:32,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:32,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 08:59:32,777 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:32,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash -339337227, now seen corresponding path program 1 times [2022-12-14 08:59:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:32,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020794146] [2022-12-14 08:59:32,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:32,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 08:59:32,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:32,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020794146] [2022-12-14 08:59:32,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020794146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:32,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:32,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 08:59:32,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641238223] [2022-12-14 08:59:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:32,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:32,816 INFO L87 Difference]: Start difference. First operand 3056 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 08:59:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:33,128 INFO L93 Difference]: Finished difference Result 5481 states and 7301 transitions. [2022-12-14 08:59:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2022-12-14 08:59:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:33,145 INFO L225 Difference]: With dead ends: 5481 [2022-12-14 08:59:33,145 INFO L226 Difference]: Without dead ends: 3565 [2022-12-14 08:59:33,150 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:33,151 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:33,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:59:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2022-12-14 08:59:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3324. [2022-12-14 08:59:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3324 states, 2481 states have (on average 1.3039097138250706) internal successors, (3235), 2502 states have internal predecessors, (3235), 504 states have call successors, (504), 329 states have call predecessors, (504), 333 states have return successors, (636), 493 states have call predecessors, (636), 504 states have call successors, (636) [2022-12-14 08:59:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4375 transitions. [2022-12-14 08:59:33,361 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4375 transitions. Word has length 66 [2022-12-14 08:59:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:33,362 INFO L495 AbstractCegarLoop]: Abstraction has 3324 states and 4375 transitions. [2022-12-14 08:59:33,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 08:59:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4375 transitions. [2022-12-14 08:59:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 08:59:33,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:33,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:33,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 08:59:33,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1132192693, now seen corresponding path program 1 times [2022-12-14 08:59:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:33,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124968295] [2022-12-14 08:59:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 08:59:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-14 08:59:33,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 08:59:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124968295] [2022-12-14 08:59:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124968295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 08:59:33,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 08:59:33,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 08:59:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95977050] [2022-12-14 08:59:33,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 08:59:33,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 08:59:33,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 08:59:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 08:59:33,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 08:59:33,415 INFO L87 Difference]: Start difference. First operand 3324 states and 4375 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 08:59:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 08:59:33,638 INFO L93 Difference]: Finished difference Result 3324 states and 4375 transitions. [2022-12-14 08:59:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 08:59:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-12-14 08:59:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 08:59:33,651 INFO L225 Difference]: With dead ends: 3324 [2022-12-14 08:59:33,651 INFO L226 Difference]: Without dead ends: 3322 [2022-12-14 08:59:33,652 INFO L412 NwaCegarLoop]: 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 [2022-12-14 08:59:33,653 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 08:59:33,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 97 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 08:59:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-12-14 08:59:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3322. [2022-12-14 08:59:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3322 states, 2481 states have (on average 1.2954453849254333) internal successors, (3214), 2500 states have internal predecessors, (3214), 504 states have call successors, (504), 329 states have call predecessors, (504), 333 states have return successors, (636), 493 states have call predecessors, (636), 504 states have call successors, (636) [2022-12-14 08:59:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3322 states to 3322 states and 4354 transitions. [2022-12-14 08:59:33,860 INFO L78 Accepts]: Start accepts. Automaton has 3322 states and 4354 transitions. Word has length 70 [2022-12-14 08:59:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 08:59:33,860 INFO L495 AbstractCegarLoop]: Abstraction has 3322 states and 4354 transitions. [2022-12-14 08:59:33,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 08:59:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3322 states and 4354 transitions. [2022-12-14 08:59:33,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 08:59:33,861 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 08:59:33,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 08:59:33,862 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-14 08:59:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 08:59:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 738235483, now seen corresponding path program 1 times [2022-12-14 08:59:33,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 08:59:33,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54118621] [2022-12-14 08:59:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 08:59:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 08:59:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:59:33,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 08:59:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 08:59:33,909 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 08:59:33,910 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 08:59:33,910 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-12-14 08:59:33,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-12-14 08:59:33,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-12-14 08:59:33,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-12-14 08:59:33,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-12-14 08:59:33,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-12-14 08:59:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 08:59:33,915 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 08:59:33,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 08:59:33,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 08:59:33 BoogieIcfgContainer [2022-12-14 08:59:33,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 08:59:33,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 08:59:33,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 08:59:33,960 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 08:59:33,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:59:28" (3/4) ... [2022-12-14 08:59:33,962 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 08:59:34,009 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 08:59:34,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 08:59:34,010 INFO L158 Benchmark]: Toolchain (without parser) took 6129.05ms. Allocated memory was 115.3MB in the beginning and 406.8MB in the end (delta: 291.5MB). Free memory was 82.1MB in the beginning and 214.3MB in the end (delta: -132.2MB). Peak memory consumption was 161.5MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,010 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 08:59:34,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.04ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 68.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.40ms. Allocated memory is still 115.3MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,010 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 115.3MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,010 INFO L158 Benchmark]: RCFGBuilder took 577.67ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 64.0MB in the beginning and 97.5MB in the end (delta: -33.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,011 INFO L158 Benchmark]: TraceAbstraction took 5137.31ms. Allocated memory was 138.4MB in the beginning and 406.8MB in the end (delta: 268.4MB). Free memory was 97.0MB in the beginning and 221.7MB in the end (delta: -124.7MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,011 INFO L158 Benchmark]: Witness Printer took 49.31ms. Allocated memory is still 406.8MB. Free memory was 221.7MB in the beginning and 214.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-14 08:59:34,012 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.13ms. Allocated memory is still 115.3MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.04ms. Allocated memory is still 115.3MB. Free memory was 81.8MB in the beginning and 68.1MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.40ms. Allocated memory is still 115.3MB. Free memory was 68.1MB in the beginning and 65.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 115.3MB. Free memory was 65.8MB in the beginning and 64.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.67ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 64.0MB in the beginning and 97.5MB in the end (delta: -33.5MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5137.31ms. Allocated memory was 138.4MB in the beginning and 406.8MB in the end (delta: 268.4MB). Free memory was 97.0MB in the beginning and 221.7MB in the end (delta: -124.7MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. * Witness Printer took 49.31ms. Allocated memory is still 406.8MB. Free memory was 221.7MB in the beginning and 214.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 95 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1845 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1813 mSDsluCounter, 2913 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1485 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1169 IncrementalHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 1428 mSDtfsCounter, 1169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3324occurred in iteration=9, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 88/88 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 incorrect! [2022-12-14 08:59:34,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10a7d335-4162-4b0f-8b2e-2d19c9d0c241/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)