./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:46:22,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:46:22,624 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:46:22,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:46:22,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:46:22,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:46:22,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:46:22,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:46:22,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:46:22,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:46:22,671 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:46:22,671 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:46:22,676 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:46:22,676 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:46:22,676 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:46:22,677 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:46:22,677 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:46:22,677 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:46:22,678 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:46:22,678 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:46:22,678 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:46:22,679 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:46:22,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:46:22,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:46:22,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:46:22,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:46:22,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:46:22,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:46:22,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:46:22,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:46:22,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:46:22,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:46:22,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:46:22,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:46:22,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:46:22,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:46:22,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:46:22,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:46:22,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:22,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:46:22,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:46:22,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:46:22,692 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:46:22,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:46:22,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:46:22,694 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:46:22,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:46:22,694 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_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/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_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje 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 ! call(reach_error())) ) 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2024-11-09 04:46:23,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:46:23,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:46:23,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:46:23,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:46:23,140 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:46:23,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/systemc/kundu1.cil.c Unable to find full path for "g++" [2024-11-09 04:46:25,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:46:25,883 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:46:25,884 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/sv-benchmarks/c/systemc/kundu1.cil.c [2024-11-09 04:46:25,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/data/d4c5ebdcb/a7d8475dfdb847258a0e054df5b6c984/FLAG6077af17a [2024-11-09 04:46:26,228 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/data/d4c5ebdcb/a7d8475dfdb847258a0e054df5b6c984 [2024-11-09 04:46:26,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:46:26,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:46:26,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:26,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:46:26,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:46:26,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc0e57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26, skipping insertion in model container [2024-11-09 04:46:26,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:46:26,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-09 04:46:26,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:26,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:46:26,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2024-11-09 04:46:26,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:26,765 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:46:26,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26 WrapperNode [2024-11-09 04:46:26,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:26,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:26,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:46:26,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:46:26,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,877 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 254 [2024-11-09 04:46:26,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:26,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:46:26,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:46:26,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:46:26,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:46:26,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:46:26,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:46:26,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:46:26,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (1/1) ... [2024-11-09 04:46:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:27,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:46:27,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:46:27,064 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-09 04:46:27,065 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-09 04:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-09 04:46:27,065 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-09 04:46:27,065 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-09 04:46:27,065 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-09 04:46:27,066 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-09 04:46:27,066 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-09 04:46:27,066 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-09 04:46:27,066 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-09 04:46:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:46:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-09 04:46:27,067 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-09 04:46:27,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:46:27,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:46:27,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:46:27,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:46:27,708 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-09 04:46:27,708 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:46:27,832 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:46:27,832 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 04:46:27,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:27 BoogieIcfgContainer [2024-11-09 04:46:27,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:46:27,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:46:27,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:46:27,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:46:27,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:46:26" (1/3) ... [2024-11-09 04:46:27,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edf181b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:27, skipping insertion in model container [2024-11-09 04:46:27,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:26" (2/3) ... [2024-11-09 04:46:27,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4edf181b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:27, skipping insertion in model container [2024-11-09 04:46:27,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:27" (3/3) ... [2024-11-09 04:46:27,844 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2024-11-09 04:46:27,867 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:46:27,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:46:27,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:46:27,957 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8307eee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:46:27,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:46:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 56 states have (on average 1.5) internal successors, (84), 60 states have internal predecessors, (84), 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) [2024-11-09 04:46:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:46:27,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:27,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:27,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:27,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2122078957, now seen corresponding path program 1 times [2024-11-09 04:46:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:27,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567120297] [2024-11-09 04:46:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:28,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567120297] [2024-11-09 04:46:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567120297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:28,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:28,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:46:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356809754] [2024-11-09 04:46:28,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:28,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:46:28,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:28,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:46:28,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:46:28,400 INFO L87 Difference]: Start difference. First operand has 79 states, 56 states have (on average 1.5) internal successors, (84), 60 states have internal predecessors, (84), 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 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:28,772 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2024-11-09 04:46:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:46:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-11-09 04:46:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:28,813 INFO L225 Difference]: With dead ends: 221 [2024-11-09 04:46:28,813 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 04:46:28,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:46:28,821 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 188 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:28,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 296 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:46:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 04:46:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2024-11-09 04:46:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 104 states have internal predecessors, (144), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 04:46:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2024-11-09 04:46:28,930 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 35 [2024-11-09 04:46:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2024-11-09 04:46:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2024-11-09 04:46:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:46:28,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:28,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:28,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:46:28,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash 64474926, now seen corresponding path program 1 times [2024-11-09 04:46:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566449413] [2024-11-09 04:46:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:29,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566449413] [2024-11-09 04:46:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566449413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:29,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:46:29,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876203393] [2024-11-09 04:46:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:29,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:29,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:29,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:29,138 INFO L87 Difference]: Start difference. First operand 135 states and 187 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:29,786 INFO L93 Difference]: Finished difference Result 570 states and 787 transitions. [2024-11-09 04:46:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:46:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-11-09 04:46:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:29,800 INFO L225 Difference]: With dead ends: 570 [2024-11-09 04:46:29,800 INFO L226 Difference]: Without dead ends: 417 [2024-11-09 04:46:29,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:46:29,804 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 387 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:29,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 417 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:46:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-09 04:46:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 308. [2024-11-09 04:46:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 239 states have (on average 1.4225941422594142) internal successors, (340), 241 states have internal predecessors, (340), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2024-11-09 04:46:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 427 transitions. [2024-11-09 04:46:29,870 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 427 transitions. Word has length 35 [2024-11-09 04:46:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:29,870 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 427 transitions. [2024-11-09 04:46:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 427 transitions. [2024-11-09 04:46:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:46:29,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:29,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:29,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:46:29,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:29,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash -720646393, now seen corresponding path program 1 times [2024-11-09 04:46:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:29,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158989180] [2024-11-09 04:46:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:30,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158989180] [2024-11-09 04:46:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158989180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:46:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12409920] [2024-11-09 04:46:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:30,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:46:30,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:46:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:46:30,047 INFO L87 Difference]: Start difference. First operand 308 states and 427 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:30,403 INFO L93 Difference]: Finished difference Result 790 states and 1097 transitions. [2024-11-09 04:46:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:46:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-11-09 04:46:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:30,409 INFO L225 Difference]: With dead ends: 790 [2024-11-09 04:46:30,410 INFO L226 Difference]: Without dead ends: 487 [2024-11-09 04:46:30,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:46:30,414 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 174 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:30,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 374 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:46:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-09 04:46:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 395. [2024-11-09 04:46:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 296 states have (on average 1.3344594594594594) internal successors, (395), 299 states have internal predecessors, (395), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2024-11-09 04:46:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 522 transitions. [2024-11-09 04:46:30,510 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 522 transitions. Word has length 36 [2024-11-09 04:46:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 522 transitions. [2024-11-09 04:46:30,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 04:46:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 522 transitions. [2024-11-09 04:46:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:46:30,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:30,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:30,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:46:30,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:30,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -834033050, now seen corresponding path program 1 times [2024-11-09 04:46:30,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:30,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160228827] [2024-11-09 04:46:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:30,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:30,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160228827] [2024-11-09 04:46:30,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160228827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:30,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:30,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:46:30,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580524951] [2024-11-09 04:46:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:30,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:46:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:46:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:46:30,641 INFO L87 Difference]: Start difference. First operand 395 states and 522 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:30,850 INFO L93 Difference]: Finished difference Result 953 states and 1259 transitions. [2024-11-09 04:46:30,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:46:30,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-11-09 04:46:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:30,856 INFO L225 Difference]: With dead ends: 953 [2024-11-09 04:46:30,856 INFO L226 Difference]: Without dead ends: 614 [2024-11-09 04:46:30,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:30,859 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:30,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 268 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:46:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-09 04:46:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 609. [2024-11-09 04:46:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 458 states have (on average 1.3253275109170306) internal successors, (607), 461 states have internal predecessors, (607), 95 states have call successors, (95), 56 states have call predecessors, (95), 55 states have return successors, (98), 92 states have call predecessors, (98), 92 states have call successors, (98) [2024-11-09 04:46:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 800 transitions. [2024-11-09 04:46:30,958 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 800 transitions. Word has length 36 [2024-11-09 04:46:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:30,958 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 800 transitions. [2024-11-09 04:46:30,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 800 transitions. [2024-11-09 04:46:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:46:30,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:30,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:46:30,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:30,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 500537027, now seen corresponding path program 1 times [2024-11-09 04:46:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270710520] [2024-11-09 04:46:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:31,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:31,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270710520] [2024-11-09 04:46:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270710520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:46:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688174072] [2024-11-09 04:46:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:31,106 INFO L87 Difference]: Start difference. First operand 609 states and 800 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:31,408 INFO L93 Difference]: Finished difference Result 1017 states and 1335 transitions. [2024-11-09 04:46:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:46:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2024-11-09 04:46:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:31,415 INFO L225 Difference]: With dead ends: 1017 [2024-11-09 04:46:31,415 INFO L226 Difference]: Without dead ends: 678 [2024-11-09 04:46:31,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:31,418 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 282 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:31,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 278 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:46:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-09 04:46:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 667. [2024-11-09 04:46:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 503 states have (on average 1.320079522862823) internal successors, (664), 506 states have internal predecessors, (664), 103 states have call successors, (103), 61 states have call predecessors, (103), 60 states have return successors, (106), 100 states have call predecessors, (106), 100 states have call successors, (106) [2024-11-09 04:46:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 873 transitions. [2024-11-09 04:46:31,519 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 873 transitions. Word has length 45 [2024-11-09 04:46:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:31,520 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 873 transitions. [2024-11-09 04:46:31,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 873 transitions. [2024-11-09 04:46:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 04:46:31,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:31,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:31,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:46:31,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:31,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash -643162974, now seen corresponding path program 1 times [2024-11-09 04:46:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262356205] [2024-11-09 04:46:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:46:31,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:31,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262356205] [2024-11-09 04:46:31,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262356205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:46:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417044809] [2024-11-09 04:46:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:31,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:31,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:31,770 INFO L87 Difference]: Start difference. First operand 667 states and 873 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:32,122 INFO L93 Difference]: Finished difference Result 1299 states and 1702 transitions. [2024-11-09 04:46:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:46:32,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2024-11-09 04:46:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:32,132 INFO L225 Difference]: With dead ends: 1299 [2024-11-09 04:46:32,132 INFO L226 Difference]: Without dead ends: 904 [2024-11-09 04:46:32,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:46:32,136 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 153 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:32,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 427 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:46:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-09 04:46:32,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 888. [2024-11-09 04:46:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 672 states have (on average 1.318452380952381) internal successors, (886), 675 states have internal predecessors, (886), 135 states have call successors, (135), 81 states have call predecessors, (135), 80 states have return successors, (140), 132 states have call predecessors, (140), 132 states have call successors, (140) [2024-11-09 04:46:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1161 transitions. [2024-11-09 04:46:32,268 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1161 transitions. Word has length 48 [2024-11-09 04:46:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1161 transitions. [2024-11-09 04:46:32,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 04:46:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1161 transitions. [2024-11-09 04:46:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 04:46:32,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:32,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:46:32,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1748390410, now seen corresponding path program 1 times [2024-11-09 04:46:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410000445] [2024-11-09 04:46:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:46:32,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410000445] [2024-11-09 04:46:32,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410000445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:32,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:32,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:46:32,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018556006] [2024-11-09 04:46:32,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:32,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:46:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:32,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:46:32,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:46:32,511 INFO L87 Difference]: Start difference. First operand 888 states and 1161 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:33,043 INFO L93 Difference]: Finished difference Result 2549 states and 3315 transitions. [2024-11-09 04:46:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:46:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-09 04:46:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:33,057 INFO L225 Difference]: With dead ends: 2549 [2024-11-09 04:46:33,057 INFO L226 Difference]: Without dead ends: 1667 [2024-11-09 04:46:33,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:46:33,061 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 192 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:33,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 229 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:46:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-09 04:46:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1631. [2024-11-09 04:46:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1207 states have (on average 1.288318144159072) internal successors, (1555), 1210 states have internal predecessors, (1555), 263 states have call successors, (263), 161 states have call predecessors, (263), 160 states have return successors, (276), 260 states have call predecessors, (276), 260 states have call successors, (276) [2024-11-09 04:46:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2094 transitions. [2024-11-09 04:46:33,316 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2094 transitions. Word has length 50 [2024-11-09 04:46:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:33,317 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2094 transitions. [2024-11-09 04:46:33,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2094 transitions. [2024-11-09 04:46:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:46:33,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:33,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:33,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:46:33,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:33,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash 826863846, now seen corresponding path program 1 times [2024-11-09 04:46:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:33,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064256133] [2024-11-09 04:46:33,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:33,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:46:33,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:33,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064256133] [2024-11-09 04:46:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064256133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:46:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032057725] [2024-11-09 04:46:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:33,439 INFO L87 Difference]: Start difference. First operand 1631 states and 2094 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:34,060 INFO L93 Difference]: Finished difference Result 3870 states and 4933 transitions. [2024-11-09 04:46:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:46:34,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2024-11-09 04:46:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:34,079 INFO L225 Difference]: With dead ends: 3870 [2024-11-09 04:46:34,079 INFO L226 Difference]: Without dead ends: 2245 [2024-11-09 04:46:34,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:46:34,086 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 434 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:34,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 316 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:46:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-09 04:46:34,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1785. [2024-11-09 04:46:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1353 states have (on average 1.2971175166297118) internal successors, (1755), 1357 states have internal predecessors, (1755), 261 states have call successors, (261), 171 states have call predecessors, (261), 170 states have return successors, (258), 257 states have call predecessors, (258), 258 states have call successors, (258) [2024-11-09 04:46:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2274 transitions. [2024-11-09 04:46:34,318 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2274 transitions. Word has length 51 [2024-11-09 04:46:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:34,319 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2274 transitions. [2024-11-09 04:46:34,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2274 transitions. [2024-11-09 04:46:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:46:34,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:34,322 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 04:46:34,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:46:34,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:34,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1572566379, now seen corresponding path program 1 times [2024-11-09 04:46:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814900487] [2024-11-09 04:46:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:34,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 04:46:34,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:34,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814900487] [2024-11-09 04:46:34,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814900487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:34,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:34,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:46:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441850230] [2024-11-09 04:46:34,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:34,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:46:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:46:34,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:46:34,511 INFO L87 Difference]: Start difference. First operand 1785 states and 2274 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:35,200 INFO L93 Difference]: Finished difference Result 4824 states and 6051 transitions. [2024-11-09 04:46:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:46:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2024-11-09 04:46:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:35,225 INFO L225 Difference]: With dead ends: 4824 [2024-11-09 04:46:35,226 INFO L226 Difference]: Without dead ends: 3045 [2024-11-09 04:46:35,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 04:46:35,234 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 220 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:35,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 255 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:46:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2024-11-09 04:46:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 2879. [2024-11-09 04:46:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2087 states have (on average 1.2414949688548156) internal successors, (2591), 2090 states have internal predecessors, (2591), 483 states have call successors, (483), 309 states have call predecessors, (483), 308 states have return successors, (480), 480 states have call predecessors, (480), 480 states have call successors, (480) [2024-11-09 04:46:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3554 transitions. [2024-11-09 04:46:35,674 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3554 transitions. Word has length 51 [2024-11-09 04:46:35,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:35,675 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 3554 transitions. [2024-11-09 04:46:35,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3554 transitions. [2024-11-09 04:46:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 04:46:35,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:35,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:35,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:46:35,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1173222557, now seen corresponding path program 1 times [2024-11-09 04:46:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607399938] [2024-11-09 04:46:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 04:46:35,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607399938] [2024-11-09 04:46:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607399938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:35,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:46:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081788939] [2024-11-09 04:46:35,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:35,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:35,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:35,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:35,795 INFO L87 Difference]: Start difference. First operand 2879 states and 3554 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:36,545 INFO L93 Difference]: Finished difference Result 6561 states and 8080 transitions. [2024-11-09 04:46:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:46:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2024-11-09 04:46:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:36,566 INFO L225 Difference]: With dead ends: 6561 [2024-11-09 04:46:36,567 INFO L226 Difference]: Without dead ends: 3688 [2024-11-09 04:46:36,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:46:36,575 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 403 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 326 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:46:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2024-11-09 04:46:36,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3091. [2024-11-09 04:46:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3091 states, 2271 states have (on average 1.2501100836635843) internal successors, (2839), 2274 states have internal predecessors, (2839), 497 states have call successors, (497), 323 states have call predecessors, (497), 322 states have return successors, (494), 494 states have call predecessors, (494), 494 states have call successors, (494) [2024-11-09 04:46:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 3091 states and 3830 transitions. [2024-11-09 04:46:36,961 INFO L78 Accepts]: Start accepts. Automaton has 3091 states and 3830 transitions. Word has length 53 [2024-11-09 04:46:36,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:36,962 INFO L471 AbstractCegarLoop]: Abstraction has 3091 states and 3830 transitions. [2024-11-09 04:46:36,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 04:46:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3091 states and 3830 transitions. [2024-11-09 04:46:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 04:46:36,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:36,966 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:36,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:46:36,966 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 917613741, now seen corresponding path program 1 times [2024-11-09 04:46:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326192553] [2024-11-09 04:46:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:46:37,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326192553] [2024-11-09 04:46:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326192553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120247420] [2024-11-09 04:46:37,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:37,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:37,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:37,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:46:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:37,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:46:37,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 04:46:37,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120247420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:46:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 14 [2024-11-09 04:46:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233309336] [2024-11-09 04:46:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:37,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:46:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:46:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:46:37,762 INFO L87 Difference]: Start difference. First operand 3091 states and 3830 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:46:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:38,472 INFO L93 Difference]: Finished difference Result 8293 states and 10294 transitions. [2024-11-09 04:46:38,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:46:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-11-09 04:46:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:38,510 INFO L225 Difference]: With dead ends: 8293 [2024-11-09 04:46:38,510 INFO L226 Difference]: Without dead ends: 6064 [2024-11-09 04:46:38,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:46:38,519 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 54 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:38,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 188 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:46:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2024-11-09 04:46:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5853. [2024-11-09 04:46:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4335 states have (on average 1.2459054209919262) internal successors, (5401), 4338 states have internal predecessors, (5401), 896 states have call successors, (896), 622 states have call predecessors, (896), 621 states have return successors, (893), 893 states have call predecessors, (893), 893 states have call successors, (893) [2024-11-09 04:46:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 7190 transitions. [2024-11-09 04:46:39,397 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 7190 transitions. Word has length 90 [2024-11-09 04:46:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:39,398 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 7190 transitions. [2024-11-09 04:46:39,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:46:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 7190 transitions. [2024-11-09 04:46:39,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 04:46:39,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:39,402 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:39,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:46:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 04:46:39,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 639892785, now seen corresponding path program 1 times [2024-11-09 04:46:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:39,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145671660] [2024-11-09 04:46:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 04:46:39,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145671660] [2024-11-09 04:46:39,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145671660] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137306714] [2024-11-09 04:46:39,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:39,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:39,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:39,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:39,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:46:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:40,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:46:40,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:40,248 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 04:46:40,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137306714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:40,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:46:40,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2024-11-09 04:46:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322766221] [2024-11-09 04:46:40,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:40,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:46:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:40,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:46:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:46:40,254 INFO L87 Difference]: Start difference. First operand 5853 states and 7190 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:46:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:41,014 INFO L93 Difference]: Finished difference Result 11502 states and 14182 transitions. [2024-11-09 04:46:41,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:46:41,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2024-11-09 04:46:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:41,051 INFO L225 Difference]: With dead ends: 11502 [2024-11-09 04:46:41,052 INFO L226 Difference]: Without dead ends: 5853 [2024-11-09 04:46:41,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:46:41,065 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:41,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:46:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2024-11-09 04:46:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2024-11-09 04:46:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4335 states have (on average 1.2385236447520185) internal successors, (5369), 4338 states have internal predecessors, (5369), 896 states have call successors, (896), 622 states have call predecessors, (896), 621 states have return successors, (893), 893 states have call predecessors, (893), 893 states have call successors, (893) [2024-11-09 04:46:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 7158 transitions. [2024-11-09 04:46:42,066 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 7158 transitions. Word has length 91 [2024-11-09 04:46:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:42,068 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 7158 transitions. [2024-11-09 04:46:42,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:46:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 7158 transitions. [2024-11-09 04:46:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 04:46:42,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:42,073 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:42,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:46:42,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:42,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:42,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:42,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1350761333, now seen corresponding path program 1 times [2024-11-09 04:46:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:42,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590360823] [2024-11-09 04:46:42,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:46:42,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590360823] [2024-11-09 04:46:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590360823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268365641] [2024-11-09 04:46:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:42,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:42,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:42,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:46:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:42,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:46:42,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:46:43,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:46:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 04:46:43,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268365641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:46:43,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1379213609] [2024-11-09 04:46:43,447 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2024-11-09 04:46:43,448 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:46:43,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:46:43,462 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:46:43,462 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:46:47,652 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 72 for LOIs [2024-11-09 04:46:47,697 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 76 for LOIs [2024-11-09 04:46:47,748 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 76 for LOIs [2024-11-09 04:46:47,798 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 38 for LOIs [2024-11-09 04:46:47,812 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 83 for LOIs [2024-11-09 04:46:48,000 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:46:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1379213609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:51,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:46:51,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [13, 4, 5] total 37 [2024-11-09 04:46:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337532841] [2024-11-09 04:46:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:51,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 04:46:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 04:46:51,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 04:46:51,577 INFO L87 Difference]: Start difference. First operand 5853 states and 7158 transitions. Second operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 04:46:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:57,894 INFO L93 Difference]: Finished difference Result 11605 states and 14192 transitions. [2024-11-09 04:46:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 04:46:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-11-09 04:46:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:57,937 INFO L225 Difference]: With dead ends: 11605 [2024-11-09 04:46:57,937 INFO L226 Difference]: Without dead ends: 5758 [2024-11-09 04:46:57,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 240 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=355, Invalid=3185, Unknown=0, NotChecked=0, Total=3540 [2024-11-09 04:46:57,955 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 104 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:57,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 713 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 04:46:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5758 states. [2024-11-09 04:46:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5758 to 5748. [2024-11-09 04:46:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5748 states, 4258 states have (on average 1.2374354156881164) internal successors, (5269), 4262 states have internal predecessors, (5269), 880 states have call successors, (880), 610 states have call predecessors, (880), 609 states have return successors, (877), 876 states have call predecessors, (877), 877 states have call successors, (877) [2024-11-09 04:46:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 7026 transitions. [2024-11-09 04:46:58,768 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 7026 transitions. Word has length 91 [2024-11-09 04:46:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:58,769 INFO L471 AbstractCegarLoop]: Abstraction has 5748 states and 7026 transitions. [2024-11-09 04:46:58,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 18 states have internal predecessors, (40), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 04:46:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 7026 transitions. [2024-11-09 04:46:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 04:46:58,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:58,772 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:58,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 04:46:58,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:58,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:58,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1196280581, now seen corresponding path program 1 times [2024-11-09 04:46:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104746737] [2024-11-09 04:46:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:58,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 04:46:59,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:46:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104746737] [2024-11-09 04:46:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104746737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:46:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767959220] [2024-11-09 04:46:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:59,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:46:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:59,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:46:59,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 04:46:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:59,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:46:59,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 04:46:59,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767959220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:59,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:46:59,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2024-11-09 04:46:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584392586] [2024-11-09 04:46:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:59,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:46:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:46:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:46:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:46:59,466 INFO L87 Difference]: Start difference. First operand 5748 states and 7026 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:46:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:59,918 INFO L93 Difference]: Finished difference Result 10375 states and 12743 transitions. [2024-11-09 04:46:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:46:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 92 [2024-11-09 04:46:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:59,949 INFO L225 Difference]: With dead ends: 10375 [2024-11-09 04:46:59,949 INFO L226 Difference]: Without dead ends: 4726 [2024-11-09 04:46:59,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:46:59,962 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 60 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:59,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 212 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:46:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2024-11-09 04:47:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 4662. [2024-11-09 04:47:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4662 states, 3446 states have (on average 1.2190946024376088) internal successors, (4201), 3450 states have internal predecessors, (4201), 721 states have call successors, (721), 495 states have call predecessors, (721), 494 states have return successors, (718), 717 states have call predecessors, (718), 718 states have call successors, (718) [2024-11-09 04:47:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 5640 transitions. [2024-11-09 04:47:00,480 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 5640 transitions. Word has length 92 [2024-11-09 04:47:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:00,481 INFO L471 AbstractCegarLoop]: Abstraction has 4662 states and 5640 transitions. [2024-11-09 04:47:00,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 04:47:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 5640 transitions. [2024-11-09 04:47:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 04:47:00,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:00,485 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:00,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 04:47:00,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:00,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:00,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash -663630867, now seen corresponding path program 1 times [2024-11-09 04:47:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:00,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436784276] [2024-11-09 04:47:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 04:47:00,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436784276] [2024-11-09 04:47:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436784276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989992278] [2024-11-09 04:47:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:00,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:00,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:00,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 04:47:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:01,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:47:01,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:47:01,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:47:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989992278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:47:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-09 04:47:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389849993] [2024-11-09 04:47:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:01,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:47:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:47:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:47:01,228 INFO L87 Difference]: Start difference. First operand 4662 states and 5640 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:01,760 INFO L93 Difference]: Finished difference Result 8927 states and 10861 transitions. [2024-11-09 04:47:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:47:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-11-09 04:47:01,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:01,787 INFO L225 Difference]: With dead ends: 8927 [2024-11-09 04:47:01,787 INFO L226 Difference]: Without dead ends: 4365 [2024-11-09 04:47:01,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-09 04:47:01,800 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 50 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:01,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 302 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:47:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2024-11-09 04:47:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 3802. [2024-11-09 04:47:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 2755 states have (on average 1.206896551724138) internal successors, (3325), 2790 states have internal predecessors, (3325), 610 states have call successors, (610), 421 states have call predecessors, (610), 436 states have return successors, (656), 591 states have call predecessors, (656), 608 states have call successors, (656) [2024-11-09 04:47:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 4591 transitions. [2024-11-09 04:47:02,376 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 4591 transitions. Word has length 93 [2024-11-09 04:47:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:02,377 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 4591 transitions. [2024-11-09 04:47:02,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 4591 transitions. [2024-11-09 04:47:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 04:47:02,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:02,382 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:02,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 04:47:02,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 04:47:02,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:02,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1099646754, now seen corresponding path program 1 times [2024-11-09 04:47:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988117227] [2024-11-09 04:47:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 04:47:02,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988117227] [2024-11-09 04:47:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988117227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478428488] [2024-11-09 04:47:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:02,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:02,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:02,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 04:47:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:02,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:47:02,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 04:47:02,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:47:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478428488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:02,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:47:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-11-09 04:47:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676022932] [2024-11-09 04:47:02,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:02,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:47:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:47:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:47:02,912 INFO L87 Difference]: Start difference. First operand 3802 states and 4591 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:03,144 INFO L93 Difference]: Finished difference Result 5730 states and 6945 transitions. [2024-11-09 04:47:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:47:03,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-11-09 04:47:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:03,159 INFO L225 Difference]: With dead ends: 5730 [2024-11-09 04:47:03,159 INFO L226 Difference]: Without dead ends: 2726 [2024-11-09 04:47:03,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:47:03,168 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 28 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:03,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:47:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-09 04:47:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2723. [2024-11-09 04:47:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 1956 states have (on average 1.1993865030674846) internal successors, (2346), 1981 states have internal predecessors, (2346), 454 states have call successors, (454), 305 states have call predecessors, (454), 312 states have return successors, (484), 437 states have call predecessors, (484), 452 states have call successors, (484) [2024-11-09 04:47:03,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3284 transitions. [2024-11-09 04:47:03,548 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3284 transitions. Word has length 101 [2024-11-09 04:47:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3284 transitions. [2024-11-09 04:47:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3284 transitions. [2024-11-09 04:47:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 04:47:03,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:03,553 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:03,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 04:47:03,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 04:47:03,753 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:03,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1734454035, now seen corresponding path program 1 times [2024-11-09 04:47:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:03,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279636806] [2024-11-09 04:47:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 04:47:04,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279636806] [2024-11-09 04:47:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279636806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905967200] [2024-11-09 04:47:04,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:04,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:04,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 04:47:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:04,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 04:47:04,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 04:47:04,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:47:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 04:47:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905967200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:47:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [122267407] [2024-11-09 04:47:04,852 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2024-11-09 04:47:04,854 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 04:47:04,854 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 04:47:04,855 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 04:47:04,855 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 04:47:07,568 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 57 for LOIs [2024-11-09 04:47:07,590 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 85 for LOIs [2024-11-09 04:47:07,645 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 74 for LOIs [2024-11-09 04:47:07,676 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 74 for LOIs [2024-11-09 04:47:07,703 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 34 for LOIs [2024-11-09 04:47:07,710 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 34 for LOIs [2024-11-09 04:47:07,841 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 04:47:12,669 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '175448#(and (exists ((|v_ULTIMATE.start_eval_~tmp~0#1_30| Int)) (and (<= 0 (+ |v_ULTIMATE.start_eval_~tmp~0#1_30| 2147483648)) (not (= |v_ULTIMATE.start_eval_~tmp~0#1_30| 0)) (<= |v_ULTIMATE.start_eval_~tmp~0#1_30| 2147483647))) (<= 1 |#StackHeapBarrier|) (<= 0 ~data_0~0) (<= 0 ~P_1_ev~0) (= ~i~0 0) (= ~e~0 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= ~C_1_pc~0 0) (<= 0 ~C_1_ev~0) (<= 0 ~P_1_pc~0) (exists ((|v_ULTIMATE.start_eval_~tmp___2~0#1_36| Int)) (and (<= 0 |v_ULTIMATE.start_eval_~tmp___2~0#1_36|) (not (= |v_ULTIMATE.start_eval_~tmp___2~0#1_36| 0)) (<= |v_ULTIMATE.start_eval_~tmp___2~0#1_36| 1))) (not (= ~num~0 0)) (<= 0 ~num~0) (= ~data_1~0 0) (not (= ~num~0 1)) (= ~timer~0 0) (= ~C_1_i~0 1))' at error location [2024-11-09 04:47:12,670 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 04:47:12,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:47:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 5] total 16 [2024-11-09 04:47:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322585641] [2024-11-09 04:47:12,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:47:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 04:47:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 04:47:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 04:47:12,674 INFO L87 Difference]: Start difference. First operand 2723 states and 3284 transitions. Second operand has 16 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 7 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-09 04:47:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:15,908 INFO L93 Difference]: Finished difference Result 5732 states and 7035 transitions. [2024-11-09 04:47:15,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-09 04:47:15,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 7 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 102 [2024-11-09 04:47:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:15,934 INFO L225 Difference]: With dead ends: 5732 [2024-11-09 04:47:15,934 INFO L226 Difference]: Without dead ends: 3157 [2024-11-09 04:47:15,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 267 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3509 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=716, Invalid=8026, Unknown=0, NotChecked=0, Total=8742 [2024-11-09 04:47:15,947 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 523 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:15,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1969 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 04:47:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2024-11-09 04:47:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 2794. [2024-11-09 04:47:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2010 states have (on average 1.1920398009950248) internal successors, (2396), 2037 states have internal predecessors, (2396), 462 states have call successors, (462), 314 states have call predecessors, (462), 321 states have return successors, (492), 443 states have call predecessors, (492), 460 states have call successors, (492) [2024-11-09 04:47:16,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3350 transitions. [2024-11-09 04:47:16,412 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3350 transitions. Word has length 102 [2024-11-09 04:47:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 3350 transitions. [2024-11-09 04:47:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.642857142857142) internal successors, (121), 15 states have internal predecessors, (121), 7 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2024-11-09 04:47:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3350 transitions. [2024-11-09 04:47:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 04:47:16,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:16,416 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:16,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 04:47:16,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 04:47:16,622 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1563448482, now seen corresponding path program 1 times [2024-11-09 04:47:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:16,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515158318] [2024-11-09 04:47:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 04:47:16,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:16,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515158318] [2024-11-09 04:47:16,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515158318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:16,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:47:16,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:47:16,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086365770] [2024-11-09 04:47:16,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:16,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:47:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:47:16,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:47:16,791 INFO L87 Difference]: Start difference. First operand 2794 states and 3350 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:17,340 INFO L93 Difference]: Finished difference Result 4990 states and 6030 transitions. [2024-11-09 04:47:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:47:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-11-09 04:47:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:17,358 INFO L225 Difference]: With dead ends: 4990 [2024-11-09 04:47:17,358 INFO L226 Difference]: Without dead ends: 3126 [2024-11-09 04:47:17,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:47:17,365 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 62 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:17,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 287 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:47:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2024-11-09 04:47:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 3120. [2024-11-09 04:47:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 2244 states have (on average 1.1907308377896613) internal successors, (2672), 2274 states have internal predecessors, (2672), 516 states have call successors, (516), 350 states have call predecessors, (516), 359 states have return successors, (554), 496 states have call predecessors, (554), 514 states have call successors, (554) [2024-11-09 04:47:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 3742 transitions. [2024-11-09 04:47:17,707 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 3742 transitions. Word has length 102 [2024-11-09 04:47:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:17,708 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 3742 transitions. [2024-11-09 04:47:17,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 04:47:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 3742 transitions. [2024-11-09 04:47:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 04:47:17,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:17,717 INFO L215 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:17,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 04:47:17,717 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:17,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 217855457, now seen corresponding path program 1 times [2024-11-09 04:47:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603695030] [2024-11-09 04:47:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 90 proven. 17 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-09 04:47:17,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:17,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603695030] [2024-11-09 04:47:17,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603695030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:17,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497932607] [2024-11-09 04:47:17,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:17,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:17,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:17,945 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:17,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 04:47:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:18,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 04:47:18,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:18,188 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 04:47:18,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:47:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497932607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:47:18,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:47:18,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-09 04:47:18,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106934263] [2024-11-09 04:47:18,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:18,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:47:18,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:47:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:47:18,191 INFO L87 Difference]: Start difference. First operand 3120 states and 3742 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 04:47:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:18,932 INFO L93 Difference]: Finished difference Result 7071 states and 8607 transitions. [2024-11-09 04:47:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 04:47:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 162 [2024-11-09 04:47:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:18,962 INFO L225 Difference]: With dead ends: 7071 [2024-11-09 04:47:18,962 INFO L226 Difference]: Without dead ends: 3948 [2024-11-09 04:47:18,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:47:18,973 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 60 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:18,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 350 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:47:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2024-11-09 04:47:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3726. [2024-11-09 04:47:19,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 2668 states have (on average 1.1810344827586208) internal successors, (3151), 2740 states have internal predecessors, (3151), 610 states have call successors, (610), 408 states have call predecessors, (610), 447 states have return successors, (788), 578 states have call predecessors, (788), 608 states have call successors, (788) [2024-11-09 04:47:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 4549 transitions. [2024-11-09 04:47:19,550 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 4549 transitions. Word has length 162 [2024-11-09 04:47:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:19,551 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 4549 transitions. [2024-11-09 04:47:19,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 04:47:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 4549 transitions. [2024-11-09 04:47:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 04:47:19,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:19,561 INFO L215 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:19,584 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 04:47:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:19,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:19,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2118570399, now seen corresponding path program 1 times [2024-11-09 04:47:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204438584] [2024-11-09 04:47:19,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 86 proven. 35 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 04:47:19,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:47:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204438584] [2024-11-09 04:47:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204438584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398756849] [2024-11-09 04:47:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:19,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:47:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:47:19,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:47:19,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 04:47:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:20,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:47:20,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 205 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 04:47:20,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:47:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-09 04:47:20,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398756849] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 04:47:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 04:47:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 7 [2024-11-09 04:47:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548040750] [2024-11-09 04:47:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:47:20,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:47:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:47:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:47:20,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:47:20,372 INFO L87 Difference]: Start difference. First operand 3726 states and 4549 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-09 04:47:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:21,046 INFO L93 Difference]: Finished difference Result 7418 states and 9123 transitions. [2024-11-09 04:47:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:47:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 173 [2024-11-09 04:47:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:21,076 INFO L225 Difference]: With dead ends: 7418 [2024-11-09 04:47:21,076 INFO L226 Difference]: Without dead ends: 4062 [2024-11-09 04:47:21,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:47:21,089 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 82 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:21,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 170 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 04:47:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2024-11-09 04:47:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 3889. [2024-11-09 04:47:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3889 states, 2851 states have (on average 1.151876534549281) internal successors, (3284), 2906 states have internal predecessors, (3284), 574 states have call successors, (574), 439 states have call predecessors, (574), 463 states have return successors, (622), 544 states have call predecessors, (622), 572 states have call successors, (622) [2024-11-09 04:47:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3889 states to 3889 states and 4480 transitions. [2024-11-09 04:47:21,700 INFO L78 Accepts]: Start accepts. Automaton has 3889 states and 4480 transitions. Word has length 173 [2024-11-09 04:47:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:21,701 INFO L471 AbstractCegarLoop]: Abstraction has 3889 states and 4480 transitions. [2024-11-09 04:47:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-09 04:47:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3889 states and 4480 transitions. [2024-11-09 04:47:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 04:47:21,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:21,710 INFO L215 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:21,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 04:47:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 04:47:21,915 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash 53130473, now seen corresponding path program 1 times [2024-11-09 04:47:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:47:21,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927254647] [2024-11-09 04:47:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:47:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:47:21,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:47:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:47:22,052 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:47:22,053 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:47:22,054 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:47:22,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 04:47:22,059 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:22,256 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:47:22,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:47:22 BoogieIcfgContainer [2024-11-09 04:47:22,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:47:22,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:47:22,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:47:22,262 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:47:22,263 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:27" (3/4) ... [2024-11-09 04:47:22,264 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 04:47:22,455 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 04:47:22,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:47:22,460 INFO L158 Benchmark]: Toolchain (without parser) took 56226.95ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 114.6MB in the beginning and 1.1GB in the end (delta: -958.4MB). Peak memory consumption was 796.2MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,460 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 115.3MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:47:22,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.62ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 98.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.83ms. Allocated memory is still 172.0MB. Free memory was 98.6MB in the beginning and 142.4MB in the end (delta: -43.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,461 INFO L158 Benchmark]: Boogie Preprocessor took 67.12ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 140.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,462 INFO L158 Benchmark]: RCFGBuilder took 869.95ms. Allocated memory is still 172.0MB. Free memory was 140.7MB in the beginning and 111.4MB in the end (delta: 29.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,462 INFO L158 Benchmark]: TraceAbstraction took 54424.97ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 110.8MB in the beginning and 1.1GB in the end (delta: -981.1MB). Peak memory consumption was 773.3MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,462 INFO L158 Benchmark]: Witness Printer took 197.73ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 04:47:22,468 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.35ms. Allocated memory is still 115.3MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.62ms. Allocated memory is still 172.0MB. Free memory was 114.4MB in the beginning and 98.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.83ms. Allocated memory is still 172.0MB. Free memory was 98.6MB in the beginning and 142.4MB in the end (delta: -43.8MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.12ms. Allocated memory is still 172.0MB. Free memory was 142.4MB in the beginning and 140.7MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 869.95ms. Allocated memory is still 172.0MB. Free memory was 140.7MB in the beginning and 111.4MB in the end (delta: 29.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 54424.97ms. Allocated memory was 172.0MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 110.8MB in the beginning and 1.1GB in the end (delta: -981.1MB). Peak memory consumption was 773.3MB. Max. memory is 16.1GB. * Witness Printer took 197.73ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND FALSE !(i < max_loop) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND FALSE !(i < max_loop) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND FALSE !(i < max_loop) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND FALSE !(i < max_loop) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.1s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3633 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3587 mSDsluCounter, 7639 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5099 mSDsCounter, 706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5725 IncrementalHoareTripleChecker+Invalid, 6431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 706 mSolverCounterUnsat, 2540 mSDtfsCounter, 5725 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1826 GetRequests, 1530 SyntacticMatches, 31 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4614 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5853occurred in iteration=11, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 3115 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 2718 NumberOfCodeBlocks, 2718 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2866 ConstructedInterpolants, 0 QuantifiedInterpolants, 6002 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2695 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 32 InterpolantComputations, 18 PerfectInterpolantSequences, 2005/2265 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: OVERALL_TIME: 4.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 93, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 115, TOOLS_POST_TIME: 1.4s, TOOLS_POST_CALL_APPLICATIONS: 75, TOOLS_POST_CALL_TIME: 0.7s, TOOLS_POST_RETURN_APPLICATIONS: 64, TOOLS_POST_RETURN_TIME: 1.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 254, TOOLS_QUANTIFIERELIM_TIME: 3.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 265, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 75, DOMAIN_JOIN_TIME: 1.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 93, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 2.6s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.6s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 64, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 1351, DAG_COMPRESSION_RETAINED_NODES: 187, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 04:47:22,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cb8ef43c-1a90-491e-a90b-46a86e2eda28/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE