./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:41:06,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:41:06,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:41:06,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:41:06,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:41:06,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:41:06,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:41:06,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:41:06,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:41:06,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:41:06,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:41:06,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:41:06,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:41:06,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:41:06,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:41:06,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:41:06,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:41:06,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:41:06,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:41:06,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:41:06,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:41:06,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:41:06,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:41:06,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:41:06,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:41:06,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:41:06,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:41:06,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:41:06,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:41:06,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:41:06,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:41:06,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:41:06,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:41:06,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:41:06,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:41:06,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:41:06,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:41:06,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:41:06,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:41:06,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:41:06,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:41:06,337 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-20 20:41:06,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:41:06,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:41:06,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:41:06,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:41:06,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:41:06,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:41:06,387 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:41:06,387 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:41:06,387 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:41:06,388 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:41:06,389 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:41:06,408 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:41:06,408 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:41:06,409 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:41:06,409 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:41:06,409 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:41:06,410 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:41:06,410 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:41:06,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:41:06,412 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:41:06,412 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:41:06,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:41:06,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:41:06,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:41:06,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:41:06,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:41:06,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:41:06,415 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 20:41:06,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:41:06,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:41:06,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:41:06,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:41:06,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:41:06,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:41:06,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:41:06,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:41:06,420 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:41:06,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:41:06,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:41:06,422 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:41:06,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:41:06,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:41:06,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:41:06,423 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_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/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_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bc8487f898950b83c481f83a71342af68752fb6e7598d76df123761c32c89f72 [2022-11-20 20:41:06,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:41:06,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:41:06,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:41:06,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:41:06,737 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:41:06,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-11-20 20:41:09,985 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:41:10,260 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:41:10,260 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2022-11-20 20:41:10,270 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/data/28aed4553/9b832130801a4b5b842b7b3c7a4449ed/FLAG0a5ed4076 [2022-11-20 20:41:10,292 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/data/28aed4553/9b832130801a4b5b842b7b3c7a4449ed [2022-11-20 20:41:10,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:41:10,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:41:10,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:41:10,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:41:10,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:41:10,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39658ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10, skipping insertion in model container [2022-11-20 20:41:10,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:41:10,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:41:10,486 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_894f0ae4-a480-41a2-a723-572ffa0ef8bc/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-11-20 20:41:10,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:41:10,565 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:41:10,579 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_894f0ae4-a480-41a2-a723-572ffa0ef8bc/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[671,684] [2022-11-20 20:41:10,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:41:10,628 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:41:10,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10 WrapperNode [2022-11-20 20:41:10,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:41:10,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:41:10,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:41:10,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:41:10,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,679 INFO L138 Inliner]: procedures = 32, calls = 38, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 284 [2022-11-20 20:41:10,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:41:10,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:41:10,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:41:10,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:41:10,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,712 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:41:10,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:41:10,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:41:10,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:41:10,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (1/1) ... [2022-11-20 20:41:10,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:41:10,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:41:10,753 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:41:10,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:41:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:41:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 20:41:10,817 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 20:41:10,817 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 20:41:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 20:41:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 20:41:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 20:41:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 20:41:10,818 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 20:41:10,818 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 20:41:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 20:41:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 20:41:10,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 20:41:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:41:10,819 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 20:41:10,820 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 20:41:10,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:41:10,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:41:10,907 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:41:10,910 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:41:11,488 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:41:11,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:41:11,682 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 20:41:11,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:11 BoogieIcfgContainer [2022-11-20 20:41:11,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:41:11,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:41:11,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:41:11,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:41:11,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:41:10" (1/3) ... [2022-11-20 20:41:11,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a20e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:11, skipping insertion in model container [2022-11-20 20:41:11,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:41:10" (2/3) ... [2022-11-20 20:41:11,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a20e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:41:11, skipping insertion in model container [2022-11-20 20:41:11,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:11" (3/3) ... [2022-11-20 20:41:11,707 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2022-11-20 20:41:11,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:41:11,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-20 20:41:11,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:41:11,821 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;@570a64b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:41:11,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-20 20:41:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 72 states have internal predecessors, (97), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-20 20:41:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 20:41:11,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:11,838 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-20 20:41:11,839 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-20 20:41:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1566583066, now seen corresponding path program 1 times [2022-11-20 20:41:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:11,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763533620] [2022-11-20 20:41:11,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:12,350 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-20 20:41:12,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:12,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763533620] [2022-11-20 20:41:12,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763533620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:12,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:12,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:41:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988587603] [2022-11-20 20:41:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:12,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:41:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:41:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:41:12,392 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 72 states have internal predecessors, (97), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 20:41:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:12,678 INFO L93 Difference]: Finished difference Result 259 states and 368 transitions. [2022-11-20 20:41:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:41:12,681 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-20 20:41:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:12,691 INFO L225 Difference]: With dead ends: 259 [2022-11-20 20:41:12,691 INFO L226 Difference]: Without dead ends: 162 [2022-11-20 20:41:12,695 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-20 20:41:12,699 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 209 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:12,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 308 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:41:12,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-20 20:41:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 157. [2022-11-20 20:41:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.4324324324324325) internal successors, (159), 118 states have internal predecessors, (159), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-20 20:41:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2022-11-20 20:41:12,758 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 35 [2022-11-20 20:41:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:12,759 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2022-11-20 20:41:12,759 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-20 20:41:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2022-11-20 20:41:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 20:41:12,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:12,762 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-20 20:41:12,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:41:12,763 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-20 20:41:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:12,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1627753802, now seen corresponding path program 1 times [2022-11-20 20:41:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:12,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747335975] [2022-11-20 20:41:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:12,953 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-20 20:41:12,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:12,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747335975] [2022-11-20 20:41:12,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747335975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:12,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:12,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:41:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496447083] [2022-11-20 20:41:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:41:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:12,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:41:12,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:41:12,963 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 20:41:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:13,587 INFO L93 Difference]: Finished difference Result 847 states and 1209 transitions. [2022-11-20 20:41:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:41:13,588 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-20 20:41:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:13,608 INFO L225 Difference]: With dead ends: 847 [2022-11-20 20:41:13,609 INFO L226 Difference]: Without dead ends: 695 [2022-11-20 20:41:13,611 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-20 20:41:13,613 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 405 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:13,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:41:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-11-20 20:41:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 655. [2022-11-20 20:41:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 477 states have (on average 1.3815513626834381) internal successors, (659), 490 states have internal predecessors, (659), 112 states have call successors, (112), 60 states have call predecessors, (112), 60 states have return successors, (154), 105 states have call predecessors, (154), 112 states have call successors, (154) [2022-11-20 20:41:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 925 transitions. [2022-11-20 20:41:13,730 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 925 transitions. Word has length 36 [2022-11-20 20:41:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:13,730 INFO L495 AbstractCegarLoop]: Abstraction has 655 states and 925 transitions. [2022-11-20 20:41:13,730 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-20 20:41:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 925 transitions. [2022-11-20 20:41:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 20:41:13,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:13,732 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-20 20:41:13,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:41:13,733 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-20 20:41:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 765390970, now seen corresponding path program 1 times [2022-11-20 20:41:13,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:13,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733552826] [2022-11-20 20:41:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:13,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:13,969 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-20 20:41:13,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:13,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733552826] [2022-11-20 20:41:13,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733552826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:13,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:13,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:41:13,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327550486] [2022-11-20 20:41:13,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:13,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:41:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:13,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:41:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:41:13,973 INFO L87 Difference]: Start difference. First operand 655 states and 925 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 20:41:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:14,413 INFO L93 Difference]: Finished difference Result 1751 states and 2474 transitions. [2022-11-20 20:41:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:41:14,414 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-20 20:41:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:14,431 INFO L225 Difference]: With dead ends: 1751 [2022-11-20 20:41:14,431 INFO L226 Difference]: Without dead ends: 1102 [2022-11-20 20:41:14,439 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-20 20:41:14,442 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 295 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:14,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 340 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:41:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-11-20 20:41:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1000. [2022-11-20 20:41:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 734 states have (on average 1.3514986376021798) internal successors, (992), 748 states have internal predecessors, (992), 162 states have call successors, (162), 96 states have call predecessors, (162), 98 states have return successors, (223), 156 states have call predecessors, (223), 162 states have call successors, (223) [2022-11-20 20:41:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1377 transitions. [2022-11-20 20:41:14,579 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1377 transitions. Word has length 40 [2022-11-20 20:41:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:14,580 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1377 transitions. [2022-11-20 20:41:14,580 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-20 20:41:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1377 transitions. [2022-11-20 20:41:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 20:41:14,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:14,589 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-20 20:41:14,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:41:14,590 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-20 20:41:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 305062014, now seen corresponding path program 1 times [2022-11-20 20:41:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401995199] [2022-11-20 20:41:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:14,679 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-20 20:41:14,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:14,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401995199] [2022-11-20 20:41:14,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401995199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:14,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:14,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:41:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823948597] [2022-11-20 20:41:14,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:41:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:41:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:41:14,684 INFO L87 Difference]: Start difference. First operand 1000 states and 1377 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 20:41:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:14,922 INFO L93 Difference]: Finished difference Result 2178 states and 3031 transitions. [2022-11-20 20:41:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:41:14,923 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-20 20:41:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:14,934 INFO L225 Difference]: With dead ends: 2178 [2022-11-20 20:41:14,934 INFO L226 Difference]: Without dead ends: 1562 [2022-11-20 20:41:14,938 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-20 20:41:14,941 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 88 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:14,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 205 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:41:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-11-20 20:41:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1166. [2022-11-20 20:41:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 854 states have (on average 1.3231850117096018) internal successors, (1130), 866 states have internal predecessors, (1130), 190 states have call successors, (190), 114 states have call predecessors, (190), 116 states have return successors, (249), 186 states have call predecessors, (249), 190 states have call successors, (249) [2022-11-20 20:41:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1569 transitions. [2022-11-20 20:41:15,105 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1569 transitions. Word has length 41 [2022-11-20 20:41:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:15,107 INFO L495 AbstractCegarLoop]: Abstraction has 1166 states and 1569 transitions. [2022-11-20 20:41:15,107 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-20 20:41:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1569 transitions. [2022-11-20 20:41:15,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 20:41:15,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:15,111 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-20 20:41:15,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:41:15,111 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-20 20:41:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 278191040, now seen corresponding path program 1 times [2022-11-20 20:41:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024953176] [2022-11-20 20:41:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:15,341 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-20 20:41:15,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:15,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024953176] [2022-11-20 20:41:15,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024953176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:15,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:15,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:41:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653677336] [2022-11-20 20:41:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:15,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:41:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:41:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:41:15,345 INFO L87 Difference]: Start difference. First operand 1166 states and 1569 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:41:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:15,871 INFO L93 Difference]: Finished difference Result 2929 states and 3996 transitions. [2022-11-20 20:41:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:41:15,872 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-20 20:41:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:15,884 INFO L225 Difference]: With dead ends: 2929 [2022-11-20 20:41:15,884 INFO L226 Difference]: Without dead ends: 1769 [2022-11-20 20:41:15,889 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-20 20:41:15,890 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 266 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:15,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 322 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:41:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-11-20 20:41:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1540. [2022-11-20 20:41:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1129 states have (on average 1.3126660761736049) internal successors, (1482), 1143 states have internal predecessors, (1482), 251 states have call successors, (251), 152 states have call predecessors, (251), 154 states have return successors, (323), 245 states have call predecessors, (323), 251 states have call successors, (323) [2022-11-20 20:41:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2056 transitions. [2022-11-20 20:41:16,123 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2056 transitions. Word has length 50 [2022-11-20 20:41:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:16,124 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 2056 transitions. [2022-11-20 20:41:16,124 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-20 20:41:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2056 transitions. [2022-11-20 20:41:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 20:41:16,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:16,128 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-20 20:41:16,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 20:41:16,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 20:41:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash -28340267, now seen corresponding path program 1 times [2022-11-20 20:41:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:16,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097926639] [2022-11-20 20:41:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:16,216 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-20 20:41:16,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:16,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097926639] [2022-11-20 20:41:16,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097926639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:16,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:16,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:41:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968476509] [2022-11-20 20:41:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:16,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:41:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:41:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:41:16,221 INFO L87 Difference]: Start difference. First operand 1540 states and 2056 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 20:41:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:16,507 INFO L93 Difference]: Finished difference Result 3280 states and 4432 transitions. [2022-11-20 20:41:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:41:16,508 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-20 20:41:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:16,522 INFO L225 Difference]: With dead ends: 3280 [2022-11-20 20:41:16,522 INFO L226 Difference]: Without dead ends: 1915 [2022-11-20 20:41:16,527 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-20 20:41:16,532 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 56 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:16,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 269 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:41:16,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-11-20 20:41:16,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1645. [2022-11-20 20:41:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1216 states have (on average 1.3174342105263157) internal successors, (1602), 1230 states have internal predecessors, (1602), 260 states have call successors, (260), 161 states have call predecessors, (260), 163 states have return successors, (332), 254 states have call predecessors, (332), 260 states have call successors, (332) [2022-11-20 20:41:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2194 transitions. [2022-11-20 20:41:16,726 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2194 transitions. Word has length 51 [2022-11-20 20:41:16,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:16,727 INFO L495 AbstractCegarLoop]: Abstraction has 1645 states and 2194 transitions. [2022-11-20 20:41:16,727 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-20 20:41:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2194 transitions. [2022-11-20 20:41:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 20:41:16,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:16,729 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-20 20:41:16,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 20:41:16,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-20 20:41:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1646325373, now seen corresponding path program 1 times [2022-11-20 20:41:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:16,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789756801] [2022-11-20 20:41:16,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:16,874 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-20 20:41:16,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:16,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789756801] [2022-11-20 20:41:16,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789756801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:16,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:16,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 20:41:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368513177] [2022-11-20 20:41:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:16,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:41:16,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:41:16,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:41:16,877 INFO L87 Difference]: Start difference. First operand 1645 states and 2194 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 20:41:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:17,502 INFO L93 Difference]: Finished difference Result 4693 states and 6246 transitions. [2022-11-20 20:41:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:41:17,503 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-20 20:41:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:17,520 INFO L225 Difference]: With dead ends: 4693 [2022-11-20 20:41:17,520 INFO L226 Difference]: Without dead ends: 3054 [2022-11-20 20:41:17,526 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-20 20:41:17,527 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:17,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 333 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:41:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-11-20 20:41:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2890. [2022-11-20 20:41:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2123 states have (on average 1.2925105982100802) internal successors, (2744), 2144 states have internal predecessors, (2744), 466 states have call successors, (466), 291 states have call predecessors, (466), 295 states have return successors, (598), 455 states have call predecessors, (598), 466 states have call successors, (598) [2022-11-20 20:41:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3808 transitions. [2022-11-20 20:41:17,888 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3808 transitions. Word has length 51 [2022-11-20 20:41:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:17,888 INFO L495 AbstractCegarLoop]: Abstraction has 2890 states and 3808 transitions. [2022-11-20 20:41:17,889 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-20 20:41:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3808 transitions. [2022-11-20 20:41:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-20 20:41:17,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:17,890 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-20 20:41:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 20:41:17,891 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-20 20:41:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash 289077579, now seen corresponding path program 1 times [2022-11-20 20:41:17,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:17,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363165536] [2022-11-20 20:41:17,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:17,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:17,940 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-20 20:41:17,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:17,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363165536] [2022-11-20 20:41:17,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363165536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:17,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:17,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:41:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342454218] [2022-11-20 20:41:17,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:17,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:41:17,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:17,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:41:17,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:41:17,943 INFO L87 Difference]: Start difference. First operand 2890 states and 3808 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-20 20:41:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:18,375 INFO L93 Difference]: Finished difference Result 5432 states and 7258 transitions. [2022-11-20 20:41:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:41:18,376 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-20 20:41:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:18,396 INFO L225 Difference]: With dead ends: 5432 [2022-11-20 20:41:18,396 INFO L226 Difference]: Without dead ends: 3475 [2022-11-20 20:41:18,403 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-20 20:41:18,404 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:18,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 273 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:41:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3475 states. [2022-11-20 20:41:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3475 to 3056. [2022-11-20 20:41:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3056 states, 2259 states have (on average 1.297476759628154) internal successors, (2931), 2280 states have internal predecessors, (2931), 481 states have call successors, (481), 306 states have call predecessors, (481), 310 states have return successors, (613), 470 states have call predecessors, (613), 481 states have call successors, (613) [2022-11-20 20:41:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4025 transitions. [2022-11-20 20:41:18,751 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 4025 transitions. Word has length 53 [2022-11-20 20:41:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:18,751 INFO L495 AbstractCegarLoop]: Abstraction has 3056 states and 4025 transitions. [2022-11-20 20:41:18,752 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-20 20:41:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 4025 transitions. [2022-11-20 20:41:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 20:41:18,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:18,754 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-20 20:41:18,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 20:41:18,754 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-20 20:41:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1844339700, now seen corresponding path program 1 times [2022-11-20 20:41:18,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:18,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51743111] [2022-11-20 20:41:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:41:18,810 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-20 20:41:18,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:41:18,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51743111] [2022-11-20 20:41:18,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51743111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:41:18,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:41:18,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:41:18,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897447638] [2022-11-20 20:41:18,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:41:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:41:18,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:41:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:41:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:41:18,814 INFO L87 Difference]: Start difference. First operand 3056 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 20:41:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:41:19,199 INFO L93 Difference]: Finished difference Result 5481 states and 7301 transitions. [2022-11-20 20:41:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:41:19,200 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-20 20:41:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:41:19,218 INFO L225 Difference]: With dead ends: 5481 [2022-11-20 20:41:19,218 INFO L226 Difference]: Without dead ends: 3565 [2022-11-20 20:41:19,224 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-20 20:41:19,226 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:41:19,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:41:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2022-11-20 20:41:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3324. [2022-11-20 20:41:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3324 states, 2481 states have (on average 1.3039097138250706) internal successors, (3235), 2502 states have internal predecessors, (3235), 504 states have call successors, (504), 329 states have call predecessors, (504), 333 states have return successors, (636), 493 states have call predecessors, (636), 504 states have call successors, (636) [2022-11-20 20:41:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4375 transitions. [2022-11-20 20:41:19,591 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4375 transitions. Word has length 66 [2022-11-20 20:41:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:41:19,592 INFO L495 AbstractCegarLoop]: Abstraction has 3324 states and 4375 transitions. [2022-11-20 20:41:19,592 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-20 20:41:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4375 transitions. [2022-11-20 20:41:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-20 20:41:19,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:41:19,594 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-20 20:41:19,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 20:41:19,595 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-20 20:41:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:41:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -112571788, now seen corresponding path program 1 times [2022-11-20 20:41:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:41:19,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258201565] [2022-11-20 20:41:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:41:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:41:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:41:19,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 20:41:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 20:41:19,713 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-20 20:41:19,713 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 20:41:19,715 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-20 20:41:19,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-20 20:41:19,719 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-20 20:41:19,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-20 20:41:19,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-20 20:41:19,720 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-20 20:41:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 20:41:19,725 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:41:19,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 20:41:19,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:41:19 BoogieIcfgContainer [2022-11-20 20:41:19,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 20:41:19,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 20:41:19,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 20:41:19,845 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 20:41:19,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:41:11" (3/4) ... [2022-11-20 20:41:19,848 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 20:41:19,992 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 20:41:19,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 20:41:19,993 INFO L158 Benchmark]: Toolchain (without parser) took 9695.80ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 134.7MB in the beginning and 223.0MB in the end (delta: -88.3MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,993 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 176.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:41:19,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.31ms. Allocated memory is still 176.2MB. Free memory was 134.7MB in the beginning and 120.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,994 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 117.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,995 INFO L158 Benchmark]: RCFGBuilder took 974.15ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 77.4MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,995 INFO L158 Benchmark]: TraceAbstraction took 8149.75ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 76.8MB in the beginning and 231.5MB in the end (delta: -154.6MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,996 INFO L158 Benchmark]: Witness Printer took 147.48ms. Allocated memory is still 356.5MB. Free memory was 231.5MB in the beginning and 223.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 20:41:19,999 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.28ms. Allocated memory is still 176.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.31ms. Allocated memory is still 176.2MB. Free memory was 134.7MB in the beginning and 120.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 176.2MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 117.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 974.15ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 77.4MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8149.75ms. Allocated memory was 176.2MB in the beginning and 356.5MB in the end (delta: 180.4MB). Free memory was 76.8MB in the beginning and 231.5MB in the end (delta: -154.6MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 147.48ms. Allocated memory is still 356.5MB. Free memory was 231.5MB in the beginning and 223.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 125]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L610] int __retres1 ; [L614] CALL init_model() [L524] m_i = 1 [L525] t1_i = 1 [L526] t2_i = 1 [L614] RET init_model() [L615] CALL start_simulation() [L551] int kernel_st ; [L552] int tmp ; [L553] int tmp___0 ; [L557] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] FCALL update_channels() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L559] CALL init_threads() [L243] COND TRUE m_i == 1 [L244] m_st = 0 [L248] COND TRUE t1_i == 1 [L249] t1_st = 0 [L253] COND TRUE t2_i == 1 [L254] t2_st = 0 [L559] RET init_threads() [L560] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L356] COND FALSE !(M_E == 0) [L361] COND FALSE !(T1_E == 0) [L366] COND FALSE !(T2_E == 0) [L371] COND FALSE !(E_M == 0) [L376] COND FALSE !(E_1 == 0) [L381] COND FALSE !(E_2 == 0) [L560] RET fire_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L561] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L188] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L197] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND FALSE !(\read(tmp___0)) [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L561] RET activate_threads() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L562] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L394] COND FALSE !(M_E == 1) [L399] COND FALSE !(T1_E == 1) [L404] COND FALSE !(T2_E == 1) [L409] COND FALSE !(E_M == 1) [L414] COND FALSE !(E_1 == 1) [L419] COND FALSE !(E_2 == 1) [L562] RET reset_delta_events() VAL [E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L565] COND TRUE 1 [L568] kernel_st = 1 [L569] CALL eval() [L289] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L117] COND TRUE 1 [L119] t1_pc = 1 [L120] t1_st = 2 [L323] RET transmit1() [L331] COND TRUE t2_st == 0 [L332] int tmp_ndt_3; [L333] tmp_ndt_3 = __VERIFIER_nondet_int() [L334] COND FALSE !(\read(tmp_ndt_3)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L293] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L263] int __retres1 ; [L266] COND TRUE m_st == 0 [L267] __retres1 = 1 [L284] return (__retres1); [L296] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L296] tmp = exists_runnable_thread() [L298] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=0, token=0] [L303] COND TRUE m_st == 0 [L304] int tmp_ndt_1; [L305] tmp_ndt_1 = __VERIFIER_nondet_int() [L306] COND TRUE \read(tmp_ndt_1) [L308] m_st = 1 [L309] CALL master() [L48] int tmp_var = __VERIFIER_nondet_int(); [L50] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=0] [L61] COND TRUE 1 [L64] token = __VERIFIER_nondet_int() [L65] local = token [L66] E_1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L67] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L467] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L429] int tmp ; [L430] int tmp___0 ; [L431] int tmp___1 ; [L435] CALL, EXPR is_master_triggered() [L175] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L178] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L188] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L190] return (__retres1); [L435] RET, EXPR is_master_triggered() [L435] tmp = is_master_triggered() [L437] COND FALSE !(\read(tmp)) [L443] CALL, EXPR is_transmit1_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L197] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L198] COND TRUE E_1 == 1 [L199] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=1, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L209] return (__retres1); [L443] RET, EXPR is_transmit1_triggered() [L443] tmp___0 = is_transmit1_triggered() [L445] COND TRUE \read(tmp___0) [L446] t1_st = 0 [L451] CALL, EXPR is_transmit2_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L216] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L226] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, __retres1=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L228] return (__retres1); [L451] RET, EXPR is_transmit2_triggered() [L451] tmp___1 = is_transmit2_triggered() [L453] COND FALSE !(\read(tmp___1)) [L467] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=0, E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L67] RET immediate_notify() VAL [E_1=1, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L68] E_1 = 2 [L69] m_pc = 1 [L70] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp_var=0, token=2147483647] [L309] RET master() [L317] COND TRUE t1_st == 0 [L318] int tmp_ndt_2; [L319] tmp_ndt_2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp_ndt_2) [L322] t1_st = 1 [L323] CALL transmit1() [L106] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L109] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] [L125] token += 1 VAL [E_1=2, E_2=2, E_M=2, local=2147483647, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=2147483647] - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 125]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 161]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 95 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1743 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1711 mSDsluCounter, 2816 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1485 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1147 IncrementalHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 1331 mSDtfsCounter, 1147 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.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3324occurred 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: 1.9s AutomataMinimizationTime, 9 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s 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-20 20:41:20,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_894f0ae4-a480-41a2-a723-572ffa0ef8bc/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)