./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 11:24:06,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 11:24:06,223 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-02 11:24:06,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 11:24:06,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 11:24:06,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 11:24:06,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 11:24:06,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 11:24:06,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 11:24:06,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 11:24:06,282 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 11:24:06,283 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 11:24:06,283 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 11:24:06,285 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 11:24:06,286 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 11:24:06,286 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 11:24:06,287 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 11:24:06,287 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 11:24:06,287 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 11:24:06,288 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 11:24:06,288 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 11:24:06,293 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 11:24:06,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 11:24:06,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 11:24:06,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 11:24:06,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 11:24:06,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 11:24:06,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 11:24:06,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 11:24:06,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 11:24:06,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 11:24:06,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 11:24:06,320 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-02 11:24:06,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 11:24:06,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 11:24:06,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 11:24:06,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 11:24:06,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 11:24:06,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 11:24:06,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 11:24:06,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:24:06,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 11:24:06,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 11:24:06,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 11:24:06,325 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 11:24:06,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 11:24:06,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 11:24:06,325 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 11:24:06,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 11:24:06,326 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/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_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2024-11-02 11:24:06,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 11:24:06,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 11:24:06,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 11:24:06,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 11:24:06,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 11:24:06,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-02 11:24:08,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 11:24:09,107 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 11:24:09,108 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-11-02 11:24:09,119 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/data/da693fc95/83493cfaacc54767981aa8f0f93d165c/FLAG671f52f7a [2024-11-02 11:24:09,132 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/data/da693fc95/83493cfaacc54767981aa8f0f93d165c [2024-11-02 11:24:09,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 11:24:09,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 11:24:09,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 11:24:09,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 11:24:09,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 11:24:09,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc89dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09, skipping insertion in model container [2024-11-02 11:24:09,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 11:24:09,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:24:09,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 11:24:09,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 11:24:09,679 INFO L204 MainTranslator]: Completed translation [2024-11-02 11:24:09,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09 WrapperNode [2024-11-02 11:24:09,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 11:24:09,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 11:24:09,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 11:24:09,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 11:24:09,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,748 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 234 [2024-11-02 11:24:09,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 11:24:09,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 11:24:09,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 11:24:09,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 11:24:09,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 11:24:09,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 11:24:09,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 11:24:09,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 11:24:09,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (1/1) ... [2024-11-02 11:24:09,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 11:24:09,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 11:24:09,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 11:24:09,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 11:24:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 11:24:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-02 11:24:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-02 11:24:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-02 11:24:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-02 11:24:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-02 11:24:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-02 11:24:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-02 11:24:09,886 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-02 11:24:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-02 11:24:09,887 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-02 11:24:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-02 11:24:09,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-02 11:24:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 11:24:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-02 11:24:09,890 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-02 11:24:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 11:24:09,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 11:24:09,997 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 11:24:10,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 11:24:10,505 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-02 11:24:10,505 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 11:24:10,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 11:24:10,711 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-02 11:24:10,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:24:10 BoogieIcfgContainer [2024-11-02 11:24:10,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 11:24:10,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 11:24:10,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 11:24:10,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 11:24:10,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 11:24:09" (1/3) ... [2024-11-02 11:24:10,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755298c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:24:10, skipping insertion in model container [2024-11-02 11:24:10,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 11:24:09" (2/3) ... [2024-11-02 11:24:10,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755298c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 11:24:10, skipping insertion in model container [2024-11-02 11:24:10,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:24:10" (3/3) ... [2024-11-02 11:24:10,718 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2024-11-02 11:24:10,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 11:24:10,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-02 11:24:10,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 11:24:10,799 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@11cf213b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 11:24:10,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-02 11:24:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 53 states have (on average 1.490566037735849) internal successors, (79), 60 states have internal predecessors, (79), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-02 11:24:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-02 11:24:10,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:10,811 INFO L215 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] [2024-11-02 11:24:10,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:10,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:10,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1430459322, now seen corresponding path program 1 times [2024-11-02 11:24:10,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:10,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886639796] [2024-11-02 11:24:10,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:24:11,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886639796] [2024-11-02 11:24:11,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886639796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:11,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:11,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:24:11,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970470261] [2024-11-02 11:24:11,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:24:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:11,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:24:11,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:24:11,233 INFO L87 Difference]: Start difference. First operand has 82 states, 53 states have (on average 1.490566037735849) internal successors, (79), 60 states have internal predecessors, (79), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-02 11:24:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:11,621 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2024-11-02 11:24:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:24:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 32 [2024-11-02 11:24:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:11,643 INFO L225 Difference]: With dead ends: 219 [2024-11-02 11:24:11,646 INFO L226 Difference]: Without dead ends: 135 [2024-11-02 11:24:11,652 INFO L431 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 [2024-11-02 11:24:11,655 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 168 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:11,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 240 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:24:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-02 11:24:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-02 11:24:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 95 states have internal predecessors, (119), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-02 11:24:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2024-11-02 11:24:11,725 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 32 [2024-11-02 11:24:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2024-11-02 11:24:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2024-11-02 11:24:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2024-11-02 11:24:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-02 11:24:11,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:11,730 INFO L215 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] [2024-11-02 11:24:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 11:24:11,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:11,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:11,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1723402418, now seen corresponding path program 1 times [2024-11-02 11:24:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:11,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985226913] [2024-11-02 11:24:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:11,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:24:12,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985226913] [2024-11-02 11:24:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985226913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:24:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748045310] [2024-11-02 11:24:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:24:12,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:24:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:24:12,103 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-11-02 11:24:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:12,521 INFO L93 Difference]: Finished difference Result 334 states and 428 transitions. [2024-11-02 11:24:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:24:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 33 [2024-11-02 11:24:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:12,528 INFO L225 Difference]: With dead ends: 334 [2024-11-02 11:24:12,529 INFO L226 Difference]: Without dead ends: 208 [2024-11-02 11:24:12,532 INFO L431 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 [2024-11-02 11:24:12,534 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 191 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:12,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 225 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:24:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-02 11:24:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 197. [2024-11-02 11:24:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 141 states have internal predecessors, (177), 37 states have call successors, (37), 20 states have call predecessors, (37), 20 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-02 11:24:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 251 transitions. [2024-11-02 11:24:12,589 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 251 transitions. Word has length 33 [2024-11-02 11:24:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:12,590 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 251 transitions. [2024-11-02 11:24:12,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) [2024-11-02 11:24:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 251 transitions. [2024-11-02 11:24:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-02 11:24:12,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:12,592 INFO L215 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] [2024-11-02 11:24:12,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 11:24:12,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:12,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:12,595 INFO L85 PathProgramCache]: Analyzing trace with hash -686108129, now seen corresponding path program 1 times [2024-11-02 11:24:12,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:12,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30190886] [2024-11-02 11:24:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:12,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 11:24:12,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30190886] [2024-11-02 11:24:12,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30190886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:12,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:12,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:24:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140273201] [2024-11-02 11:24:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:24:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:24:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:24:12,674 INFO L87 Difference]: Start difference. First operand 197 states and 251 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-02 11:24:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:12,812 INFO L93 Difference]: Finished difference Result 553 states and 705 transitions. [2024-11-02 11:24:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 35 [2024-11-02 11:24:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:12,817 INFO L225 Difference]: With dead ends: 553 [2024-11-02 11:24:12,817 INFO L226 Difference]: Without dead ends: 361 [2024-11-02 11:24:12,819 INFO L431 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 [2024-11-02 11:24:12,821 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:12,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 174 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:24:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-02 11:24:12,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 356. [2024-11-02 11:24:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 249 states have (on average 1.248995983935743) internal successors, (311), 255 states have internal predecessors, (311), 65 states have call successors, (65), 38 states have call predecessors, (65), 38 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-02 11:24:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 441 transitions. [2024-11-02 11:24:12,915 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 441 transitions. Word has length 35 [2024-11-02 11:24:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:12,917 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 441 transitions. [2024-11-02 11:24:12,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-02 11:24:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 441 transitions. [2024-11-02 11:24:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-02 11:24:12,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:12,920 INFO L215 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] [2024-11-02 11:24:12,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 11:24:12,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 926294385, now seen corresponding path program 1 times [2024-11-02 11:24:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449319017] [2024-11-02 11:24:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:12,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 11:24:13,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449319017] [2024-11-02 11:24:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449319017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:24:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442805800] [2024-11-02 11:24:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:13,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:24:13,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:13,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:24:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:24:13,061 INFO L87 Difference]: Start difference. First operand 356 states and 441 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-02 11:24:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:13,206 INFO L93 Difference]: Finished difference Result 656 states and 819 transitions. [2024-11-02 11:24:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:24:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 49 [2024-11-02 11:24:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:13,215 INFO L225 Difference]: With dead ends: 656 [2024-11-02 11:24:13,215 INFO L226 Difference]: Without dead ends: 465 [2024-11-02 11:24:13,218 INFO L431 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 [2024-11-02 11:24:13,219 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 43 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:13,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 210 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:24:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-02 11:24:13,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 387. [2024-11-02 11:24:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 274 states have (on average 1.2481751824817517) internal successors, (342), 280 states have internal predecessors, (342), 68 states have call successors, (68), 41 states have call predecessors, (68), 41 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-02 11:24:13,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 478 transitions. [2024-11-02 11:24:13,296 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 478 transitions. Word has length 49 [2024-11-02 11:24:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:13,297 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 478 transitions. [2024-11-02 11:24:13,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-02 11:24:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 478 transitions. [2024-11-02 11:24:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-02 11:24:13,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:13,303 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 11:24:13,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 11:24:13,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:13,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 169830596, now seen corresponding path program 1 times [2024-11-02 11:24:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83204090] [2024-11-02 11:24:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-02 11:24:13,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83204090] [2024-11-02 11:24:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83204090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 11:24:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257131239] [2024-11-02 11:24:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:13,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 11:24:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 11:24:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 11:24:13,732 INFO L87 Difference]: Start difference. First operand 387 states and 478 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-02 11:24:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:14,163 INFO L93 Difference]: Finished difference Result 944 states and 1163 transitions. [2024-11-02 11:24:14,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 11:24:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2024-11-02 11:24:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:14,172 INFO L225 Difference]: With dead ends: 944 [2024-11-02 11:24:14,172 INFO L226 Difference]: Without dead ends: 563 [2024-11-02 11:24:14,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-02 11:24:14,175 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 191 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:14,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 255 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 11:24:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-02 11:24:14,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 541. [2024-11-02 11:24:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 382 states have (on average 1.2303664921465969) internal successors, (470), 389 states have internal predecessors, (470), 96 states have call successors, (96), 59 states have call predecessors, (96), 59 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-02 11:24:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 662 transitions. [2024-11-02 11:24:14,262 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 662 transitions. Word has length 58 [2024-11-02 11:24:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:14,263 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 662 transitions. [2024-11-02 11:24:14,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-02 11:24:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 662 transitions. [2024-11-02 11:24:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-02 11:24:14,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:14,265 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 11:24:14,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 11:24:14,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:14,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1967629932, now seen corresponding path program 1 times [2024-11-02 11:24:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214600444] [2024-11-02 11:24:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-02 11:24:14,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214600444] [2024-11-02 11:24:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214600444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 11:24:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590575837] [2024-11-02 11:24:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:24:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:24:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:24:14,386 INFO L87 Difference]: Start difference. First operand 541 states and 662 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-02 11:24:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:14,512 INFO L93 Difference]: Finished difference Result 973 states and 1196 transitions. [2024-11-02 11:24:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:24:14,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 60 [2024-11-02 11:24:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:14,519 INFO L225 Difference]: With dead ends: 973 [2024-11-02 11:24:14,520 INFO L226 Difference]: Without dead ends: 630 [2024-11-02 11:24:14,522 INFO L431 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 [2024-11-02 11:24:14,526 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:14,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 194 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 11:24:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-02 11:24:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 582. [2024-11-02 11:24:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 415 states have (on average 1.2337349397590363) internal successors, (512), 422 states have internal predecessors, (512), 100 states have call successors, (100), 63 states have call predecessors, (100), 63 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-02 11:24:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 712 transitions. [2024-11-02 11:24:14,609 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 712 transitions. Word has length 60 [2024-11-02 11:24:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:14,610 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 712 transitions. [2024-11-02 11:24:14,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-11-02 11:24:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 712 transitions. [2024-11-02 11:24:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-02 11:24:14,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:14,614 INFO L215 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] [2024-11-02 11:24:14,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 11:24:14,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:14,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:14,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1609057223, now seen corresponding path program 1 times [2024-11-02 11:24:14,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:14,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908844503] [2024-11-02 11:24:14,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:14,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 11:24:14,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908844503] [2024-11-02 11:24:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908844503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 11:24:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30411586] [2024-11-02 11:24:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 11:24:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 11:24:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 11:24:14,695 INFO L87 Difference]: Start difference. First operand 582 states and 712 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-02 11:24:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:14,995 INFO L93 Difference]: Finished difference Result 993 states and 1242 transitions. [2024-11-02 11:24:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 11:24:14,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-02 11:24:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:15,003 INFO L225 Difference]: With dead ends: 993 [2024-11-02 11:24:15,003 INFO L226 Difference]: Without dead ends: 587 [2024-11-02 11:24:15,005 INFO L431 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 [2024-11-02 11:24:15,006 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 156 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:15,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 234 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 11:24:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-11-02 11:24:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 580. [2024-11-02 11:24:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 413 states have (on average 1.1961259079903148) internal successors, (494), 420 states have internal predecessors, (494), 100 states have call successors, (100), 63 states have call predecessors, (100), 63 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-02 11:24:15,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 694 transitions. [2024-11-02 11:24:15,084 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 694 transitions. Word has length 65 [2024-11-02 11:24:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:15,086 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 694 transitions. [2024-11-02 11:24:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-02 11:24:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 694 transitions. [2024-11-02 11:24:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-02 11:24:15,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:15,089 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 11:24:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 11:24:15,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -604696102, now seen corresponding path program 1 times [2024-11-02 11:24:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809122932] [2024-11-02 11:24:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 11:24:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-02 11:24:15,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 11:24:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809122932] [2024-11-02 11:24:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809122932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 11:24:15,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 11:24:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 11:24:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124088434] [2024-11-02 11:24:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 11:24:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 11:24:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 11:24:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 11:24:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:24:15,166 INFO L87 Difference]: Start difference. First operand 580 states and 694 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-02 11:24:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 11:24:15,292 INFO L93 Difference]: Finished difference Result 580 states and 694 transitions. [2024-11-02 11:24:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 11:24:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-02 11:24:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 11:24:15,296 INFO L225 Difference]: With dead ends: 580 [2024-11-02 11:24:15,296 INFO L226 Difference]: Without dead ends: 579 [2024-11-02 11:24:15,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 11:24:15,297 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 11:24:15,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 81 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 11:24:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-02 11:24:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2024-11-02 11:24:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 413 states have (on average 1.188861985472155) internal successors, (491), 419 states have internal predecessors, (491), 100 states have call successors, (100), 63 states have call predecessors, (100), 63 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-02 11:24:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 691 transitions. [2024-11-02 11:24:15,383 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 691 transitions. Word has length 65 [2024-11-02 11:24:15,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 11:24:15,384 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 691 transitions. [2024-11-02 11:24:15,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-02 11:24:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 691 transitions. [2024-11-02 11:24:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-02 11:24:15,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 11:24:15,386 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-02 11:24:15,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 11:24:15,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-02 11:24:15,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 11:24:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1565709667, now seen corresponding path program 1 times [2024-11-02 11:24:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 11:24:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738626459] [2024-11-02 11:24:15,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 11:24:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 11:24:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:24:15,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 11:24:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 11:24:15,457 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 11:24:15,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 11:24:15,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-02 11:24:15,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-02 11:24:15,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-02 11:24:15,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-02 11:24:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 11:24:15,470 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 11:24:15,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 11:24:15,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 11:24:15 BoogieIcfgContainer [2024-11-02 11:24:15,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 11:24:15,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 11:24:15,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 11:24:15,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 11:24:15,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 11:24:10" (3/4) ... [2024-11-02 11:24:15,567 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 11:24:15,658 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 11:24:15,658 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 11:24:15,659 INFO L158 Benchmark]: Toolchain (without parser) took 6523.55ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 86.2MB in the beginning and 118.5MB in the end (delta: -32.3MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,659 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 11:24:15,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.24ms. Allocated memory is still 121.6MB. Free memory was 86.2MB in the beginning and 71.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.95ms. Allocated memory is still 121.6MB. Free memory was 71.0MB in the beginning and 69.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,660 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 121.6MB. Free memory was 69.0MB in the beginning and 67.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,660 INFO L158 Benchmark]: RCFGBuilder took 928.43ms. Allocated memory is still 121.6MB. Free memory was 67.3MB in the beginning and 88.1MB in the end (delta: -20.8MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,661 INFO L158 Benchmark]: TraceAbstraction took 4850.18ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 87.5MB in the beginning and 125.8MB in the end (delta: -38.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,661 INFO L158 Benchmark]: Witness Printer took 94.24ms. Allocated memory is still 199.2MB. Free memory was 125.8MB in the beginning and 118.5MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-02 11:24:15,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.24ms. Allocated memory is still 121.6MB. Free memory was 86.2MB in the beginning and 71.4MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.95ms. Allocated memory is still 121.6MB. Free memory was 71.0MB in the beginning and 69.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 121.6MB. Free memory was 69.0MB in the beginning and 67.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 928.43ms. Allocated memory is still 121.6MB. Free memory was 67.3MB in the beginning and 88.1MB in the end (delta: -20.8MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4850.18ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 87.5MB in the beginning and 125.8MB in the end (delta: -38.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 94.24ms. Allocated memory is still 199.2MB. Free memory was 125.8MB in the beginning and 118.5MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. 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: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) [L276] COND FALSE !(T1_E == 0) [L281] COND FALSE !(E_M == 0) [L286] COND FALSE !(E_1 == 0) [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) [L436] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) [L304] COND FALSE !(T1_E == 1) [L309] COND FALSE !(E_M == 1) [L314] COND FALSE !(E_1 == 1) [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 [L113] t1_pc = 1 [L114] t1_st = 2 [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 [L353] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: 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, 82 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 954 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 937 mSDsluCounter, 1613 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 717 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 658 IncrementalHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 896 mSDtfsCounter, 658 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 174 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 85/85 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! [2024-11-02 11:24:15,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb2f543d-9fd3-4e4b-83ee-88688685d404/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)