./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ --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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:09:41,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:09:41,818 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-19 05:09:41,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:09:41,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:09:41,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:09:41,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:09:41,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:09:41,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:09:41,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:09:41,881 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:09:41,882 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:09:41,882 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:09:41,884 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:09:41,884 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:09:41,885 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:09:41,885 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:09:41,886 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:09:41,886 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:09:41,886 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:09:41,887 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:09:41,889 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:09:41,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:09:41,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:09:41,891 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:09:41,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:09:41,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:09:41,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:09:41,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:09:41,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:09:41,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:09:41,895 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 05:09:41,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:09:41,895 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:09:41,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:09:41,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:09:41,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:09:41,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:09:41,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:09:41,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:09:41,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:09:41,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:09:41,898 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:09:41,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:09:41,899 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:09:41,899 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:09:41,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:09:41,900 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_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/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_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2023-11-19 05:09:42,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:09:42,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:09:42,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:09:42,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:09:42,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:09:42,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2023-11-19 05:09:45,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:09:45,402 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:09:45,402 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2023-11-19 05:09:45,412 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/data/8b8f11e09/35d8cb783fc84aceac8493e3208c51a6/FLAGcebd142fb [2023-11-19 05:09:45,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/data/8b8f11e09/35d8cb783fc84aceac8493e3208c51a6 [2023-11-19 05:09:45,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:09:45,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:09:45,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:09:45,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:09:45,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:09:45,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a0e3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45, skipping insertion in model container [2023-11-19 05:09:45,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,469 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:09:45,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:09:45,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:09:45,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:09:45,723 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:09:45,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45 WrapperNode [2023-11-19 05:09:45,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:09:45,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:09:45,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:09:45,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:09:45,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,769 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 224 [2023-11-19 05:09:45,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:09:45,771 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:09:45,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:09:45,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:09:45,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:09:45,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:09:45,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:09:45,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:09:45,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (1/1) ... [2023-11-19 05:09:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:09:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:09:45,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:09:45,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:09:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:09:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-19 05:09:45,901 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-19 05:09:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-19 05:09:45,901 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-19 05:09:45,901 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-19 05:09:45,901 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-19 05:09:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-19 05:09:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-19 05:09:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-19 05:09:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-19 05:09:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:09:45,902 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-19 05:09:45,902 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-19 05:09:45,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:09:45,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:09:46,006 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:09:46,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:09:46,363 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:09:46,509 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:09:46,513 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 05:09:46,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:46 BoogieIcfgContainer [2023-11-19 05:09:46,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:09:46,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:09:46,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:09:46,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:09:46,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:09:45" (1/3) ... [2023-11-19 05:09:46,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62498dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:09:46, skipping insertion in model container [2023-11-19 05:09:46,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:45" (2/3) ... [2023-11-19 05:09:46,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62498dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:09:46, skipping insertion in model container [2023-11-19 05:09:46,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:46" (3/3) ... [2023-11-19 05:09:46,536 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2023-11-19 05:09:46,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:09:46,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 05:09:46,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:09:46,622 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7a7e41de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:09:46,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 05:09:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 53 states have internal predecessors, (70), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-19 05:09:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 05:09:46,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:46,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:46,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:46,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -436388563, now seen corresponding path program 1 times [2023-11-19 05:09:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:46,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616712373] [2023-11-19 05:09:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:09:47,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616712373] [2023-11-19 05:09:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616712373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:47,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:47,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:09:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645398603] [2023-11-19 05:09:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:09:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:09:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:09:47,114 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 53 states have internal predecessors, (70), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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) [2023-11-19 05:09:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:47,510 INFO L93 Difference]: Finished difference Result 205 states and 281 transitions. [2023-11-19 05:09:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:09:47,512 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 [2023-11-19 05:09:47,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:47,522 INFO L225 Difference]: With dead ends: 205 [2023-11-19 05:09:47,522 INFO L226 Difference]: Without dead ends: 132 [2023-11-19 05:09:47,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:09:47,532 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 162 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:47,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 222 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:09:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-19 05:09:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2023-11-19 05:09:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 92 states have internal predecessors, (117), 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) [2023-11-19 05:09:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 169 transitions. [2023-11-19 05:09:47,625 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 169 transitions. Word has length 32 [2023-11-19 05:09:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:47,627 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 169 transitions. [2023-11-19 05:09:47,627 INFO L496 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) [2023-11-19 05:09:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 169 transitions. [2023-11-19 05:09:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 05:09:47,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:47,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:47,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:09:47,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:47,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:47,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1735238475, now seen corresponding path program 1 times [2023-11-19 05:09:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532486659] [2023-11-19 05:09:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:09:47,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532486659] [2023-11-19 05:09:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532486659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:09:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915841850] [2023-11-19 05:09:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:47,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:09:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:09:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:09:47,968 INFO L87 Difference]: Start difference. First operand 129 states and 169 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) [2023-11-19 05:09:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:48,310 INFO L93 Difference]: Finished difference Result 328 states and 425 transitions. [2023-11-19 05:09:48,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:09:48,311 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 [2023-11-19 05:09:48,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:48,315 INFO L225 Difference]: With dead ends: 328 [2023-11-19 05:09:48,315 INFO L226 Difference]: Without dead ends: 205 [2023-11-19 05:09:48,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:09:48,319 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 186 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:48,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 255 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:09:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-19 05:09:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2023-11-19 05:09:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 138 states have internal predecessors, (176), 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) [2023-11-19 05:09:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 250 transitions. [2023-11-19 05:09:48,350 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 250 transitions. Word has length 33 [2023-11-19 05:09:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:48,350 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 250 transitions. [2023-11-19 05:09:48,351 INFO L496 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) [2023-11-19 05:09:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 250 transitions. [2023-11-19 05:09:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 05:09:48,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:48,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:48,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:09:48,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:48,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1575974625, now seen corresponding path program 1 times [2023-11-19 05:09:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:48,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956736951] [2023-11-19 05:09:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:09:48,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:48,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956736951] [2023-11-19 05:09:48,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956736951] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:48,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:48,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:09:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851277701] [2023-11-19 05:09:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:09:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:09:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:48,405 INFO L87 Difference]: Start difference. First operand 194 states and 250 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) [2023-11-19 05:09:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:48,481 INFO L93 Difference]: Finished difference Result 544 states and 702 transitions. [2023-11-19 05:09:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:09:48,481 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 [2023-11-19 05:09:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:48,485 INFO L225 Difference]: With dead ends: 544 [2023-11-19 05:09:48,485 INFO L226 Difference]: Without dead ends: 355 [2023-11-19 05:09:48,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:48,488 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 164 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:48,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 164 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:09:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-19 05:09:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 350. [2023-11-19 05:09:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 243 states have (on average 1.271604938271605) internal successors, (309), 249 states have internal predecessors, (309), 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) [2023-11-19 05:09:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 439 transitions. [2023-11-19 05:09:48,535 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 439 transitions. Word has length 35 [2023-11-19 05:09:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:48,536 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 439 transitions. [2023-11-19 05:09:48,536 INFO L496 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) [2023-11-19 05:09:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 439 transitions. [2023-11-19 05:09:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-19 05:09:48,539 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:48,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:48,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:09:48,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:48,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -141699400, now seen corresponding path program 1 times [2023-11-19 05:09:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797560129] [2023-11-19 05:09:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:48,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:48,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 05:09:48,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:48,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797560129] [2023-11-19 05:09:48,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797560129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:48,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:48,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:09:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109081294] [2023-11-19 05:09:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:09:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:09:48,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:48,612 INFO L87 Difference]: Start difference. First operand 350 states and 439 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) [2023-11-19 05:09:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:48,682 INFO L93 Difference]: Finished difference Result 644 states and 815 transitions. [2023-11-19 05:09:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:09:48,682 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 [2023-11-19 05:09:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:48,687 INFO L225 Difference]: With dead ends: 644 [2023-11-19 05:09:48,687 INFO L226 Difference]: Without dead ends: 456 [2023-11-19 05:09:48,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:48,690 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 195 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:48,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 195 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:09:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-19 05:09:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 381. [2023-11-19 05:09:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 268 states have (on average 1.2686567164179106) internal successors, (340), 274 states have internal predecessors, (340), 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) [2023-11-19 05:09:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2023-11-19 05:09:48,776 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 49 [2023-11-19 05:09:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:48,777 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2023-11-19 05:09:48,777 INFO L496 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) [2023-11-19 05:09:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2023-11-19 05:09:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 05:09:48,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:48,780 INFO L195 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] [2023-11-19 05:09:48,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:09:48,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:48,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash -890921722, now seen corresponding path program 1 times [2023-11-19 05:09:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244304290] [2023-11-19 05:09:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:09:49,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244304290] [2023-11-19 05:09:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244304290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:09:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189595986] [2023-11-19 05:09:49,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:09:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:09:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:09:49,131 INFO L87 Difference]: Start difference. First operand 381 states and 476 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) [2023-11-19 05:09:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:49,400 INFO L93 Difference]: Finished difference Result 929 states and 1158 transitions. [2023-11-19 05:09:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:09:49,401 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 [2023-11-19 05:09:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:49,405 INFO L225 Difference]: With dead ends: 929 [2023-11-19 05:09:49,406 INFO L226 Difference]: Without dead ends: 554 [2023-11-19 05:09:49,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-19 05:09:49,408 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 176 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:49,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 195 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:09:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2023-11-19 05:09:49,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 532. [2023-11-19 05:09:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 373 states have (on average 1.2520107238605898) internal successors, (467), 380 states have internal predecessors, (467), 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) [2023-11-19 05:09:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 659 transitions. [2023-11-19 05:09:49,489 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 659 transitions. Word has length 58 [2023-11-19 05:09:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:49,490 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 659 transitions. [2023-11-19 05:09:49,490 INFO L496 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) [2023-11-19 05:09:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 659 transitions. [2023-11-19 05:09:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 05:09:49,496 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:49,496 INFO L195 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] [2023-11-19 05:09:49,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:09:49,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:49,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:49,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1297642190, now seen corresponding path program 1 times [2023-11-19 05:09:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:49,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560289005] [2023-11-19 05:09:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 05:09:49,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:49,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560289005] [2023-11-19 05:09:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560289005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:49,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:49,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:09:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018887078] [2023-11-19 05:09:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:49,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:09:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:09:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:49,614 INFO L87 Difference]: Start difference. First operand 532 states and 659 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) [2023-11-19 05:09:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:49,732 INFO L93 Difference]: Finished difference Result 952 states and 1187 transitions. [2023-11-19 05:09:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:09:49,739 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 [2023-11-19 05:09:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:49,746 INFO L225 Difference]: With dead ends: 952 [2023-11-19 05:09:49,746 INFO L226 Difference]: Without dead ends: 621 [2023-11-19 05:09:49,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:49,749 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:49,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:09:49,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-11-19 05:09:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 573. [2023-11-19 05:09:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 406 states have (on average 1.2536945812807883) internal successors, (509), 413 states have internal predecessors, (509), 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) [2023-11-19 05:09:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 709 transitions. [2023-11-19 05:09:49,834 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 709 transitions. Word has length 60 [2023-11-19 05:09:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:49,836 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 709 transitions. [2023-11-19 05:09:49,837 INFO L496 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) [2023-11-19 05:09:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 709 transitions. [2023-11-19 05:09:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-19 05:09:49,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:49,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:09:49,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:49,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash -894815356, now seen corresponding path program 1 times [2023-11-19 05:09:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351975360] [2023-11-19 05:09:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 05:09:49,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351975360] [2023-11-19 05:09:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351975360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:49,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:09:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810678822] [2023-11-19 05:09:49,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:49,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:09:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:09:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:09:49,918 INFO L87 Difference]: Start difference. First operand 573 states and 709 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) [2023-11-19 05:09:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:50,112 INFO L93 Difference]: Finished difference Result 978 states and 1237 transitions. [2023-11-19 05:09:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:09:50,112 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 [2023-11-19 05:09:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:50,117 INFO L225 Difference]: With dead ends: 978 [2023-11-19 05:09:50,117 INFO L226 Difference]: Without dead ends: 578 [2023-11-19 05:09:50,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:09:50,121 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 146 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 214 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:09:50,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 214 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:09:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2023-11-19 05:09:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 571. [2023-11-19 05:09:50,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 404 states have (on average 1.2153465346534653) internal successors, (491), 411 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) [2023-11-19 05:09:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 691 transitions. [2023-11-19 05:09:50,216 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 691 transitions. Word has length 65 [2023-11-19 05:09:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:50,216 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 691 transitions. [2023-11-19 05:09:50,217 INFO L496 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) [2023-11-19 05:09:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 691 transitions. [2023-11-19 05:09:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-19 05:09:50,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:50,218 INFO L195 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] [2023-11-19 05:09:50,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:09:50,219 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:50,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 109545765, now seen corresponding path program 1 times [2023-11-19 05:09:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820411390] [2023-11-19 05:09:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:09:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 05:09:50,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:09:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820411390] [2023-11-19 05:09:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820411390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:09:50,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:09:50,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:09:50,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991966441] [2023-11-19 05:09:50,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:09:50,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:09:50,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:09:50,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:09:50,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:50,281 INFO L87 Difference]: Start difference. First operand 571 states and 691 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) [2023-11-19 05:09:50,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:09:50,379 INFO L93 Difference]: Finished difference Result 571 states and 691 transitions. [2023-11-19 05:09:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:09:50,380 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 [2023-11-19 05:09:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:09:50,384 INFO L225 Difference]: With dead ends: 571 [2023-11-19 05:09:50,384 INFO L226 Difference]: Without dead ends: 570 [2023-11-19 05:09:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:09:50,386 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 76 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 [2023-11-19 05:09:50,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:09:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-11-19 05:09:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2023-11-19 05:09:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 404 states have (on average 1.2079207920792079) internal successors, (488), 410 states have internal predecessors, (488), 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) [2023-11-19 05:09:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 688 transitions. [2023-11-19 05:09:50,463 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 688 transitions. Word has length 65 [2023-11-19 05:09:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:09:50,463 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 688 transitions. [2023-11-19 05:09:50,463 INFO L496 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) [2023-11-19 05:09:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 688 transitions. [2023-11-19 05:09:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-19 05:09:50,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:09:50,465 INFO L195 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] [2023-11-19 05:09:50,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:09:50,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-19 05:09:50,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:09:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -899048295, now seen corresponding path program 1 times [2023-11-19 05:09:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:09:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062735032] [2023-11-19 05:09:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:09:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:09:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:09:50,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:09:50,550 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:09:50,550 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:09:50,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-19 05:09:50,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-19 05:09:50,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-19 05:09:50,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-19 05:09:50,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:09:50,558 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:09:50,563 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:09:50,624 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:09:50,627 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:09:50,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:09:50 BoogieIcfgContainer [2023-11-19 05:09:50,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:09:50,649 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:09:50,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:09:50,650 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:09:50,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:46" (3/4) ... [2023-11-19 05:09:50,651 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 05:09:50,663 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:09:50,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-19 05:09:50,719 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:09:50,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:09:50,720 INFO L158 Benchmark]: Toolchain (without parser) took 5291.27ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 136.4MB in the beginning and 62.9MB in the end (delta: 73.5MB). Peak memory consumption was 106.5MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,720 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 119.5MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:09:50,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.51ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 123.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.92ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,722 INFO L158 Benchmark]: Boogie Preprocessor took 30.55ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,722 INFO L158 Benchmark]: RCFGBuilder took 718.18ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 109.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,722 INFO L158 Benchmark]: TraceAbstraction took 4124.09ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 108.4MB in the beginning and 68.2MB in the end (delta: 40.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,723 INFO L158 Benchmark]: Witness Printer took 70.02ms. Allocated memory is still 201.3MB. Free memory was 68.2MB in the beginning and 62.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 05:09:50,725 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.24ms. Allocated memory is still 119.5MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.51ms. Allocated memory is still 167.8MB. Free memory was 135.9MB in the beginning and 123.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.92ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.55ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 119.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 718.18ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 109.1MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4124.09ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 108.4MB in the beginning and 68.2MB in the end (delta: 40.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 70.02ms. Allocated memory is still 201.3MB. Free memory was 68.2MB in the beginning and 62.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 107]: 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 ; [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 [L422] RET init_threads() [L423] 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] [L259] COND FALSE !(M_E == 0) [L264] COND FALSE !(T1_E == 0) [L269] COND FALSE !(E_M == 0) [L274] COND FALSE !(E_1 == 0) [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] 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] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] 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] [L124] 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] [L134] __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] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) [L325] CALL, EXPR is_transmit1_triggered() [L140] 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] [L143] 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] [L153] __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] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] 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] [L287] COND FALSE !(M_E == 1) [L292] COND FALSE !(T1_E == 1) [L297] COND FALSE !(E_M == 1) [L302] COND FALSE !(E_1 == 1) [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 [L431] kernel_st = 1 [L432] CALL eval() [L206] 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] [L210] 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] [L213] 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] [L185] int __retres1 ; [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 [L201] return (__retres1); [L213] 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] [L213] tmp = exists_runnable_thread() [L215] 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, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE, EXPR !(\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, tmp=1, tmp_ndt_1=0, token=0] [L220-L231] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } 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, tmp=1, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE, EXPR \read(tmp_ndt_2) [L239] EXPR t1_st = 1 [L240] CALL, EXPR transmit1() [L88] 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] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 [L240] RET, EXPR transmit1() [L234-L245] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } 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, tmp=1, token=0] [L210] 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, tmp=1, token=0] [L213] 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] [L185] int __retres1 ; [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 [L201] return (__retres1); [L213] 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, tmp=1, token=0] [L213] tmp = exists_runnable_thread() [L215] 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, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE, EXPR \read(tmp_ndt_1) [L225] EXPR m_st = 1 [L226] CALL, EXPR master() [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, 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, 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] [L341] 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] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] 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] [L124] 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] [L134] __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] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) [L325] CALL, EXPR is_transmit1_triggered() [L140] 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] [L143] 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] [L144] COND TRUE E_1 == 1 [L145] __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] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 [L341] 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, 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, token=2147483647] [L226] RET, EXPR master() [L220-L231] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } 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=1, token=2147483647] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] 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] [L91] 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] [L107] 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: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 74 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 887 mSDsluCounter, 1506 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 662 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 668 IncrementalHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 844 mSDtfsCounter, 668 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred 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, 171 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s 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! [2023-11-19 05:09:50,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65bff16b-d47c-4f08-a672-04abf9f9e5bf/bin/utaipan-verify-t7M7D8N6sZ/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)