./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba --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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- 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-b5237d8 [2022-11-22 01:53:15,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:53:15,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:53:16,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:53:16,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:53:16,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:53:16,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:53:16,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:53:16,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:53:16,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:53:16,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:53:16,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:53:16,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:53:16,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:53:16,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:53:16,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:53:16,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:53:16,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:53:16,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:53:16,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:53:16,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:53:16,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:53:16,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:53:16,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:53:16,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:53:16,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:53:16,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:53:16,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:53:16,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:53:16,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:53:16,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:53:16,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:53:16,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:53:16,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:53:16,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:53:16,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:53:16,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:53:16,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:53:16,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:53:16,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:53:16,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:53:16,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 01:53:16,174 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:53:16,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:53:16,175 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:53:16,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:53:16,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:53:16,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:53:16,177 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:53:16,177 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:53:16,178 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:53:16,178 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:53:16,179 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:53:16,180 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:53:16,180 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:53:16,180 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:53:16,181 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:53:16,181 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:53:16,181 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:53:16,182 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:53:16,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:53:16,183 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:53:16,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 01:53:16,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:53:16,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:53:16,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:53:16,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:53:16,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:53:16,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:53:16,186 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 01:53:16,186 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:53:16,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:53:16,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:53:16,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:53:16,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:53:16,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:53:16,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:53:16,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:53:16,190 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:53:16,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:53:16,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:53:16,191 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:53:16,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:53:16,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:53:16,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:53:16,192 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_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/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_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba 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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2022-11-22 01:53:16,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:53:16,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:53:16,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:53:16,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:53:16,572 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:53:16,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-11-22 01:53:20,419 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:53:20,765 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:53:20,766 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-11-22 01:53:20,789 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/data/1d7f20391/dd23e192c4034eb0a50db3be02cdeb3e/FLAG049a1dfcc [2022-11-22 01:53:20,817 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/data/1d7f20391/dd23e192c4034eb0a50db3be02cdeb3e [2022-11-22 01:53:20,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:53:20,826 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:53:20,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:53:20,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:53:20,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:53:20,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:20" (1/1) ... [2022-11-22 01:53:20,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bad3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:20, skipping insertion in model container [2022-11-22 01:53:20,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:20" (1/1) ... [2022-11-22 01:53:20,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:53:20,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:53:21,093 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_578b7aeb-1af3-4984-ace2-6116f926dce4/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-11-22 01:53:21,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:53:21,182 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:53:21,197 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_578b7aeb-1af3-4984-ace2-6116f926dce4/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-11-22 01:53:21,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:53:21,254 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:53:21,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21 WrapperNode [2022-11-22 01:53:21,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:53:21,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:53:21,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:53:21,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:53:21,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,307 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 279 [2022-11-22 01:53:21,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:53:21,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:53:21,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:53:21,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:53:21,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:53:21,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:53:21,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:53:21,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:53:21,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (1/1) ... [2022-11-22 01:53:21,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:53:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:53:21,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:53:21,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:53:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:53:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-22 01:53:21,482 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-22 01:53:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-22 01:53:21,483 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-22 01:53:21,483 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-22 01:53:21,483 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-22 01:53:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-22 01:53:21,484 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-22 01:53:21,484 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-22 01:53:21,484 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-22 01:53:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:53:21,485 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-22 01:53:21,485 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-22 01:53:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:53:21,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:53:21,682 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:53:21,693 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:53:22,404 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:53:22,578 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:53:22,578 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-22 01:53:22,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:22 BoogieIcfgContainer [2022-11-22 01:53:22,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:53:22,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:53:22,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:53:22,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:53:22,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:53:20" (1/3) ... [2022-11-22 01:53:22,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:22, skipping insertion in model container [2022-11-22 01:53:22,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:21" (2/3) ... [2022-11-22 01:53:22,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d729c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:22, skipping insertion in model container [2022-11-22 01:53:22,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:22" (3/3) ... [2022-11-22 01:53:22,594 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2022-11-22 01:53:22,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:53:22,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-22 01:53:22,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:53:22,700 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;@3b62e761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:53:22,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-22 01:53:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 65 states have internal predecessors, (88), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-22 01:53:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 01:53:22,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:22,719 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-11-22 01:53:22,720 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-11-22 01:53:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1766725069, now seen corresponding path program 1 times [2022-11-22 01:53:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:22,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630579809] [2022-11-22 01:53:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:23,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:23,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630579809] [2022-11-22 01:53:23,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630579809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:23,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:23,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 01:53:23,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991189526] [2022-11-22 01:53:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 01:53:23,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:23,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 01:53:23,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 01:53:23,350 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 65 states have internal predecessors, (88), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-11-22 01:53:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:23,811 INFO L93 Difference]: Finished difference Result 244 states and 342 transitions. [2022-11-22 01:53:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 01:53:23,814 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-11-22 01:53:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:23,835 INFO L225 Difference]: With dead ends: 244 [2022-11-22 01:53:23,835 INFO L226 Difference]: Without dead ends: 158 [2022-11-22 01:53:23,841 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-11-22 01:53:23,852 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 199 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:23,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 290 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-22 01:53:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2022-11-22 01:53:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 114 states have internal predecessors, (153), 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-11-22 01:53:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2022-11-22 01:53:23,986 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 35 [2022-11-22 01:53:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:23,990 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2022-11-22 01:53:23,990 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-11-22 01:53:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2022-11-22 01:53:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-22 01:53:23,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:24,000 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-11-22 01:53:24,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:53:24,000 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-11-22 01:53:24,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1082337571, now seen corresponding path program 1 times [2022-11-22 01:53:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:24,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333307233] [2022-11-22 01:53:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:24,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:24,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:24,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333307233] [2022-11-22 01:53:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333307233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 01:53:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448762093] [2022-11-22 01:53:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:24,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 01:53:24,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 01:53:24,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 01:53:24,232 INFO L87 Difference]: Start difference. First operand 153 states and 209 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-11-22 01:53:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:24,948 INFO L93 Difference]: Finished difference Result 823 states and 1173 transitions. [2022-11-22 01:53:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:53:24,949 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-11-22 01:53:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:24,959 INFO L225 Difference]: With dead ends: 823 [2022-11-22 01:53:24,960 INFO L226 Difference]: Without dead ends: 675 [2022-11-22 01:53:24,963 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-11-22 01:53:24,964 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 401 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:24,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 435 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 01:53:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-11-22 01:53:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 635. [2022-11-22 01:53:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 457 states have (on average 1.37636761487965) internal successors, (629), 470 states have internal predecessors, (629), 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-11-22 01:53:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 895 transitions. [2022-11-22 01:53:25,159 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 895 transitions. Word has length 36 [2022-11-22 01:53:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:25,160 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 895 transitions. [2022-11-22 01:53:25,161 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-11-22 01:53:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 895 transitions. [2022-11-22 01:53:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-22 01:53:25,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:25,166 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-11-22 01:53:25,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 01:53:25,166 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-11-22 01:53:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1956598916, now seen corresponding path program 1 times [2022-11-22 01:53:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:25,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163985021] [2022-11-22 01:53:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:25,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:25,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:25,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163985021] [2022-11-22 01:53:25,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163985021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:25,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:25,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:53:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212259167] [2022-11-22 01:53:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:25,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:25,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:25,647 INFO L87 Difference]: Start difference. First operand 635 states and 895 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-11-22 01:53:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:26,204 INFO L93 Difference]: Finished difference Result 1711 states and 2414 transitions. [2022-11-22 01:53:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:53:26,205 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-11-22 01:53:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:26,221 INFO L225 Difference]: With dead ends: 1711 [2022-11-22 01:53:26,222 INFO L226 Difference]: Without dead ends: 1082 [2022-11-22 01:53:26,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:26,226 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 298 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:26,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 257 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-11-22 01:53:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 980. [2022-11-22 01:53:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 714 states have (on average 1.3473389355742298) internal successors, (962), 728 states have internal predecessors, (962), 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-11-22 01:53:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1347 transitions. [2022-11-22 01:53:26,386 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1347 transitions. Word has length 40 [2022-11-22 01:53:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:26,387 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1347 transitions. [2022-11-22 01:53:26,387 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-11-22 01:53:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1347 transitions. [2022-11-22 01:53:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-22 01:53:26,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:26,389 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-11-22 01:53:26,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 01:53:26,390 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-11-22 01:53:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -310388818, now seen corresponding path program 1 times [2022-11-22 01:53:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208347558] [2022-11-22 01:53:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:53:26,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:26,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208347558] [2022-11-22 01:53:26,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208347558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:26,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:26,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293593200] [2022-11-22 01:53:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:26,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:26,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:26,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:26,457 INFO L87 Difference]: Start difference. First operand 980 states and 1347 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-11-22 01:53:26,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:26,703 INFO L93 Difference]: Finished difference Result 2134 states and 2965 transitions. [2022-11-22 01:53:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:26,704 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-11-22 01:53:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:26,714 INFO L225 Difference]: With dead ends: 2134 [2022-11-22 01:53:26,715 INFO L226 Difference]: Without dead ends: 1530 [2022-11-22 01:53:26,718 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-11-22 01:53:26,719 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 198 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:26,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 198 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2022-11-22 01:53:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1142. [2022-11-22 01:53:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 830 states have (on average 1.3180722891566266) internal successors, (1094), 842 states have internal predecessors, (1094), 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-11-22 01:53:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1533 transitions. [2022-11-22 01:53:26,896 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1533 transitions. Word has length 41 [2022-11-22 01:53:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:26,896 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1533 transitions. [2022-11-22 01:53:26,897 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-11-22 01:53:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1533 transitions. [2022-11-22 01:53:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-22 01:53:26,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:26,899 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-11-22 01:53:26,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:53:26,900 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-11-22 01:53:26,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1083445527, now seen corresponding path program 1 times [2022-11-22 01:53:26,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:26,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264054126] [2022-11-22 01:53:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:27,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:27,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264054126] [2022-11-22 01:53:27,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264054126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:27,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:27,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:53:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149794604] [2022-11-22 01:53:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:27,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:27,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:27,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:27,184 INFO L87 Difference]: Start difference. First operand 1142 states and 1533 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-11-22 01:53:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:27,715 INFO L93 Difference]: Finished difference Result 2869 states and 3906 transitions. [2022-11-22 01:53:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:53:27,717 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-11-22 01:53:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:27,737 INFO L225 Difference]: With dead ends: 2869 [2022-11-22 01:53:27,737 INFO L226 Difference]: Without dead ends: 1733 [2022-11-22 01:53:27,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:27,742 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 248 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:27,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 248 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 01:53:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-11-22 01:53:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1508. [2022-11-22 01:53:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1097 states have (on average 1.3072014585232452) internal successors, (1434), 1111 states have internal predecessors, (1434), 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-11-22 01:53:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2008 transitions. [2022-11-22 01:53:27,971 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2008 transitions. Word has length 50 [2022-11-22 01:53:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:27,972 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2008 transitions. [2022-11-22 01:53:27,972 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-11-22 01:53:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2008 transitions. [2022-11-22 01:53:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 01:53:27,979 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:27,980 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-11-22 01:53:27,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 01:53:27,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:53:27,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1364057786, now seen corresponding path program 1 times [2022-11-22 01:53:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:27,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897885168] [2022-11-22 01:53:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:27,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-22 01:53:28,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897885168] [2022-11-22 01:53:28,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897885168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:28,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:28,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 01:53:28,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110913069] [2022-11-22 01:53:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:28,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:53:28,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:53:28,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:53:28,251 INFO L87 Difference]: Start difference. First operand 1508 states and 2008 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-11-22 01:53:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:28,887 INFO L93 Difference]: Finished difference Result 4391 states and 5832 transitions. [2022-11-22 01:53:28,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 01:53:28,888 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-11-22 01:53:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:28,905 INFO L225 Difference]: With dead ends: 4391 [2022-11-22 01:53:28,906 INFO L226 Difference]: Without dead ends: 2889 [2022-11-22 01:53:28,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-22 01:53:28,912 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 268 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:28,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 305 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:53:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-11-22 01:53:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2725. [2022-11-22 01:53:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 1976 states have (on average 1.2823886639676114) internal successors, (2534), 1997 states have internal predecessors, (2534), 457 states have call successors, (457), 282 states have call predecessors, (457), 286 states have return successors, (589), 446 states have call predecessors, (589), 457 states have call successors, (589) [2022-11-22 01:53:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 3580 transitions. [2022-11-22 01:53:29,253 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 3580 transitions. Word has length 51 [2022-11-22 01:53:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:29,253 INFO L495 AbstractCegarLoop]: Abstraction has 2725 states and 3580 transitions. [2022-11-22 01:53:29,253 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-11-22 01:53:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3580 transitions. [2022-11-22 01:53:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-22 01:53:29,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:29,255 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-11-22 01:53:29,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 01:53:29,255 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-22 01:53:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1822389063, now seen corresponding path program 1 times [2022-11-22 01:53:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:29,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539447048] [2022-11-22 01:53:29,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:29,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:29,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:29,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539447048] [2022-11-22 01:53:29,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539447048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:29,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:29,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243133749] [2022-11-22 01:53:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:29,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:29,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:29,314 INFO L87 Difference]: Start difference. First operand 2725 states and 3580 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-11-22 01:53:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:29,721 INFO L93 Difference]: Finished difference Result 5642 states and 7471 transitions. [2022-11-22 01:53:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:29,722 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-11-22 01:53:29,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:29,744 INFO L225 Difference]: With dead ends: 5642 [2022-11-22 01:53:29,744 INFO L226 Difference]: Without dead ends: 3088 [2022-11-22 01:53:29,752 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-11-22 01:53:29,756 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 50 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 250 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-11-22 01:53:29,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 250 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:53:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-11-22 01:53:30,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2830. [2022-11-22 01:53:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2063 states have (on average 1.2864760058167717) internal successors, (2654), 2084 states have internal predecessors, (2654), 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-11-22 01:53:30,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3718 transitions. [2022-11-22 01:53:30,200 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3718 transitions. Word has length 51 [2022-11-22 01:53:30,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:30,202 INFO L495 AbstractCegarLoop]: Abstraction has 2830 states and 3718 transitions. [2022-11-22 01:53:30,203 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-11-22 01:53:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3718 transitions. [2022-11-22 01:53:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-22 01:53:30,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:30,206 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-11-22 01:53:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 01:53:30,206 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-11-22 01:53:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash 129091836, now seen corresponding path program 1 times [2022-11-22 01:53:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:30,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088578077] [2022-11-22 01:53:30,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 01:53:30,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:30,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088578077] [2022-11-22 01:53:30,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088578077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:30,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:30,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620379818] [2022-11-22 01:53:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:30,320 INFO L87 Difference]: Start difference. First operand 2830 states and 3718 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-11-22 01:53:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:30,797 INFO L93 Difference]: Finished difference Result 5316 states and 7084 transitions. [2022-11-22 01:53:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:30,798 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-11-22 01:53:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:30,828 INFO L225 Difference]: With dead ends: 5316 [2022-11-22 01:53:30,829 INFO L226 Difference]: Without dead ends: 3399 [2022-11-22 01:53:30,836 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-11-22 01:53:30,838 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 56 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 252 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.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:53:30,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 252 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:53:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-11-22 01:53:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 2996. [2022-11-22 01:53:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2199 states have (on average 1.2919508867667122) internal successors, (2841), 2220 states have internal predecessors, (2841), 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-11-22 01:53:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 3935 transitions. [2022-11-22 01:53:31,273 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 3935 transitions. Word has length 53 [2022-11-22 01:53:31,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:31,273 INFO L495 AbstractCegarLoop]: Abstraction has 2996 states and 3935 transitions. [2022-11-22 01:53:31,274 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-11-22 01:53:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3935 transitions. [2022-11-22 01:53:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-22 01:53:31,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:31,277 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-11-22 01:53:31,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 01:53:31,278 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-11-22 01:53:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -65024313, now seen corresponding path program 1 times [2022-11-22 01:53:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155420924] [2022-11-22 01:53:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:53:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-22 01:53:31,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:53:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155420924] [2022-11-22 01:53:31,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155420924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:53:31,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:53:31,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:53:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636987563] [2022-11-22 01:53:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:53:31,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:53:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:53:31,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:53:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:53:31,368 INFO L87 Difference]: Start difference. First operand 2996 states and 3935 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-11-22 01:53:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:53:31,798 INFO L93 Difference]: Finished difference Result 5361 states and 7121 transitions. [2022-11-22 01:53:31,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:53:31,799 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-11-22 01:53:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:53:31,821 INFO L225 Difference]: With dead ends: 5361 [2022-11-22 01:53:31,821 INFO L226 Difference]: Without dead ends: 3505 [2022-11-22 01:53:31,828 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-11-22 01:53:31,829 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 44 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 230 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-11-22 01:53:31,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 230 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:53:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2022-11-22 01:53:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3264. [2022-11-22 01:53:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3264 states, 2421 states have (on average 1.299049979347377) internal successors, (3145), 2442 states have internal predecessors, (3145), 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-11-22 01:53:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4285 transitions. [2022-11-22 01:53:32,356 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4285 transitions. Word has length 66 [2022-11-22 01:53:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:53:32,356 INFO L495 AbstractCegarLoop]: Abstraction has 3264 states and 4285 transitions. [2022-11-22 01:53:32,357 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-11-22 01:53:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4285 transitions. [2022-11-22 01:53:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-22 01:53:32,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:53:32,360 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-11-22 01:53:32,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 01:53:32,361 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-11-22 01:53:32,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:53:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1754338490, now seen corresponding path program 1 times [2022-11-22 01:53:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:53:32,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730640507] [2022-11-22 01:53:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:53:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:53:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:53:32,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:53:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:53:32,519 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:53:32,520 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:53:32,521 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-22 01:53:32,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-22 01:53:32,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-22 01:53:32,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-22 01:53:32,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-22 01:53:32,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-22 01:53:32,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 01:53:32,531 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:53:32,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:53:32,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:53:32 BoogieIcfgContainer [2022-11-22 01:53:32,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:53:32,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:53:32,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:53:32,677 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:53:32,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:22" (3/4) ... [2022-11-22 01:53:32,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 01:53:32,836 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 01:53:32,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:53:32,837 INFO L158 Benchmark]: Toolchain (without parser) took 12011.37ms. Allocated memory was 167.8MB in the beginning and 522.2MB in the end (delta: 354.4MB). Free memory was 136.5MB in the beginning and 359.9MB in the end (delta: -223.4MB). Peak memory consumption was 133.7MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,837 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 111.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:53:32,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.97ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 122.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.30ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,839 INFO L158 Benchmark]: Boogie Preprocessor took 43.16ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,839 INFO L158 Benchmark]: RCFGBuilder took 1229.24ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 79.5MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,840 INFO L158 Benchmark]: TraceAbstraction took 10091.05ms. Allocated memory was 167.8MB in the beginning and 522.2MB in the end (delta: 354.4MB). Free memory was 78.7MB in the beginning and 368.3MB in the end (delta: -289.6MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,841 INFO L158 Benchmark]: Witness Printer took 159.18ms. Allocated memory is still 522.2MB. Free memory was 368.3MB in the beginning and 359.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-22 01:53:32,845 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.40ms. Allocated memory is still 111.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.97ms. Allocated memory is still 167.8MB. Free memory was 136.5MB in the beginning and 122.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.30ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 120.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.16ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 118.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1229.24ms. Allocated memory is still 167.8MB. Free memory was 118.6MB in the beginning and 79.5MB in the end (delta: 39.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10091.05ms. Allocated memory was 167.8MB in the beginning and 522.2MB in the end (delta: 354.4MB). Free memory was 78.7MB in the beginning and 368.3MB in the end (delta: -289.6MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * Witness Printer took 159.18ms. Allocated memory is still 522.2MB. Free memory was 368.3MB in the beginning and 359.9MB in the end (delta: 8.4MB). 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: 113]: 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 ; [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] 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] [L546] 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] [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 [L547] RET init_threads() [L548] 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] [L344] COND FALSE !(M_E == 0) [L349] COND FALSE !(T1_E == 0) [L354] COND FALSE !(T2_E == 0) [L359] COND FALSE !(E_M == 0) [L364] COND FALSE !(E_1 == 0) [L369] COND FALSE !(E_2 == 0) [L548] 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] [L549] 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] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] 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] [L166] 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] [L176] __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] [L178] return (__retres1); [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) [L431] CALL, EXPR is_transmit1_triggered() [L182] 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] [L185] 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] [L195] __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] [L197] return (__retres1); [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) [L439] CALL, EXPR is_transmit2_triggered() [L201] 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] [L204] 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] [L214] __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] [L216] return (__retres1); [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) [L549] 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] [L550] 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] [L382] COND FALSE !(M_E == 1) [L387] COND FALSE !(T1_E == 1) [L392] COND FALSE !(T2_E == 1) [L397] COND FALSE !(E_M == 1) [L402] COND FALSE !(E_1 == 1) [L407] COND FALSE !(E_2 == 1) [L550] 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] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L277] 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] [L281] 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] [L284] 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] [L251] int __retres1 ; [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 [L272] return (__retres1); [L284] 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] [L284] tmp = exists_runnable_thread() [L286] 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] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] 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] [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] 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] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L311] RET transmit1() [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] 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] [L281] 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] [L284] 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] [L251] int __retres1 ; [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 [L272] return (__retres1); [L284] 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] [L284] tmp = exists_runnable_thread() [L286] 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] [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND TRUE \read(tmp_ndt_1) [L296] m_st = 1 [L297] CALL master() [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, 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, 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] [L455] 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] [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] 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] [L166] 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] [L176] __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] [L178] return (__retres1); [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) [L431] CALL, EXPR is_transmit1_triggered() [L182] 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] [L185] 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] [L186] COND TRUE E_1 == 1 [L187] __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] [L197] return (__retres1); [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND TRUE \read(tmp___0) [L434] t1_st = 0 [L439] CALL, EXPR is_transmit2_triggered() [L201] 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] [L204] 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] [L214] __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] [L216] return (__retres1); [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) [L455] 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, 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, token=2147483647] [L297] RET master() [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp_ndt_2) [L310] t1_st = 1 [L311] CALL transmit1() [L94] 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] [L97] 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] [L113] 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: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 149]: 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 7 procedures, 87 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1678 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1646 mSDsluCounter, 2465 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1236 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1042 IncrementalHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 1229 mSDtfsCounter, 1042 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3264occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1826 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 67/67 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-11-22 01:53:32,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_578b7aeb-1af3-4984-ace2-6116f926dce4/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)