./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh --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 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:41:18,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:41:18,480 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 18:41:18,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:41:18,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:41:18,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:41:18,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:41:18,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:41:18,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:41:18,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:41:18,517 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:41:18,517 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:41:18,518 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:41:18,518 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:41:18,519 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:41:18,519 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:41:18,520 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:41:18,520 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:41:18,521 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:41:18,521 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:41:18,522 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:41:18,523 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:41:18,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:41:18,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 18:41:18,525 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:41:18,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:41:18,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:41:18,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:41:18,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 18:41:18,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:41:18,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 18:41:18,528 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:41:18,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 18:41:18,528 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:41:18,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:41:18,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:41:18,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:41:18,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:41:18,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:41:18,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:41:18,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 18:41:18,530 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:41:18,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:41:18,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:41:18,531 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 18:41:18,531 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:41:18,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:41:18,532 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_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/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_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2023-12-02 18:41:18,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:41:18,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:41:18,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:41:18,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:41:18,819 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:41:18,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-12-02 18:41:21,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:41:22,148 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:41:22,148 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/sv-benchmarks/c/systemc/transmitter.03.cil.c [2023-12-02 18:41:22,161 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/data/9454abbe1/285441dacd0b499d89a193e01e7b4105/FLAG6a86a5504 [2023-12-02 18:41:22,174 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/data/9454abbe1/285441dacd0b499d89a193e01e7b4105 [2023-12-02 18:41:22,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:41:22,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:41:22,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:41:22,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:41:22,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:41:22,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddaa728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22, skipping insertion in model container [2023-12-02 18:41:22,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,236 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:41:22,426 WARN L240 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_5146b7d5-a934-47c2-9a06-28426c680703/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-12-02 18:41:22,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:41:22,509 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:41:22,519 WARN L240 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_5146b7d5-a934-47c2-9a06-28426c680703/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2023-12-02 18:41:22,557 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:41:22,574 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:41:22,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22 WrapperNode [2023-12-02 18:41:22,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:41:22,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:41:22,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:41:22,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:41:22,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,623 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 328 [2023-12-02 18:41:22,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:41:22,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:41:22,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:41:22,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:41:22,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:41:22,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:41:22,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:41:22,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:41:22,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (1/1) ... [2023-12-02 18:41:22,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:41:22,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:22,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:41:22,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:41:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:41:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-02 18:41:22,764 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-02 18:41:22,764 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-02 18:41:22,765 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-02 18:41:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-02 18:41:22,765 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-02 18:41:22,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-02 18:41:22,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-02 18:41:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-02 18:41:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-02 18:41:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 18:41:22,766 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-02 18:41:22,766 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-02 18:41:22,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:41:22,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:41:22,855 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:41:22,858 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:41:23,270 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:41:23,463 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:41:23,463 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-12-02 18:41:23,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:41:23 BoogieIcfgContainer [2023-12-02 18:41:23,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:41:23,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:41:23,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:41:23,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:41:23,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:41:22" (1/3) ... [2023-12-02 18:41:23,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a51d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:41:23, skipping insertion in model container [2023-12-02 18:41:23,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:41:22" (2/3) ... [2023-12-02 18:41:23,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a51d73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:41:23, skipping insertion in model container [2023-12-02 18:41:23,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:41:23" (3/3) ... [2023-12-02 18:41:23,476 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2023-12-02 18:41:23,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:41:23,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 18:41:23,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:41:23,566 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d626335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:41:23,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 18:41:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 69 states have internal predecessors, (99), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:41:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 18:41:23,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:23,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:23,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:23,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:23,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1180821683, now seen corresponding path program 1 times [2023-12-02 18:41:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:23,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326896008] [2023-12-02 18:41:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:23,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:23,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:23,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326896008] [2023-12-02 18:41:23,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326896008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:23,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937547122] [2023-12-02 18:41:23,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:23,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:23,971 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 69 states have internal predecessors, (99), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:24,381 INFO L93 Difference]: Finished difference Result 260 states and 379 transitions. [2023-12-02 18:41:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:41:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-12-02 18:41:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:24,394 INFO L225 Difference]: With dead ends: 260 [2023-12-02 18:41:24,395 INFO L226 Difference]: Without dead ends: 170 [2023-12-02 18:41:24,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:24,403 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 218 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:24,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 314 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 18:41:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-12-02 18:41:24,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2023-12-02 18:41:24,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.384) internal successors, (173), 127 states have internal predecessors, (173), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-02 18:41:24,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 229 transitions. [2023-12-02 18:41:24,474 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 229 transitions. Word has length 41 [2023-12-02 18:41:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:24,475 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 229 transitions. [2023-12-02 18:41:24,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 229 transitions. [2023-12-02 18:41:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 18:41:24,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:24,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:24,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 18:41:24,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:24,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash -590649292, now seen corresponding path program 1 times [2023-12-02 18:41:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485819881] [2023-12-02 18:41:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:24,632 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:24,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485819881] [2023-12-02 18:41:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485819881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:24,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:24,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:41:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310077076] [2023-12-02 18:41:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:24,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:41:24,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:24,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:41:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:41:24,636 INFO L87 Difference]: Start difference. First operand 166 states and 229 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:25,230 INFO L93 Difference]: Finished difference Result 937 states and 1341 transitions. [2023-12-02 18:41:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:41:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-12-02 18:41:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:25,244 INFO L225 Difference]: With dead ends: 937 [2023-12-02 18:41:25,245 INFO L226 Difference]: Without dead ends: 776 [2023-12-02 18:41:25,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:41:25,250 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 484 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:25,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 412 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:41:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-02 18:41:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 740. [2023-12-02 18:41:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 567 states have (on average 1.36331569664903) internal successors, (773), 575 states have internal predecessors, (773), 112 states have call successors, (112), 60 states have call predecessors, (112), 60 states have return successors, (154), 105 states have call predecessors, (154), 112 states have call successors, (154) [2023-12-02 18:41:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1039 transitions. [2023-12-02 18:41:25,360 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1039 transitions. Word has length 41 [2023-12-02 18:41:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1039 transitions. [2023-12-02 18:41:25,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1039 transitions. [2023-12-02 18:41:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 18:41:25,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:25,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:25,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 18:41:25,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:25,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:25,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1646713973, now seen corresponding path program 1 times [2023-12-02 18:41:25,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:25,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754700008] [2023-12-02 18:41:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:25,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754700008] [2023-12-02 18:41:25,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754700008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:25,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:25,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:41:25,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814086429] [2023-12-02 18:41:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:25,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:41:25,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:41:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:41:25,515 INFO L87 Difference]: Start difference. First operand 740 states and 1039 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:26,158 INFO L93 Difference]: Finished difference Result 2905 states and 4198 transitions. [2023-12-02 18:41:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:41:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2023-12-02 18:41:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:26,181 INFO L225 Difference]: With dead ends: 2905 [2023-12-02 18:41:26,181 INFO L226 Difference]: Without dead ends: 2170 [2023-12-02 18:41:26,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:41:26,188 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 475 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:26,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 424 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:41:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2023-12-02 18:41:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 1942. [2023-12-02 18:41:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1501 states have (on average 1.3610926049300467) internal successors, (2043), 1507 states have internal predecessors, (2043), 276 states have call successors, (276), 148 states have call predecessors, (276), 164 states have return successors, (464), 287 states have call predecessors, (464), 276 states have call successors, (464) [2023-12-02 18:41:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2783 transitions. [2023-12-02 18:41:26,416 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2783 transitions. Word has length 41 [2023-12-02 18:41:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:26,417 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 2783 transitions. [2023-12-02 18:41:26,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2783 transitions. [2023-12-02 18:41:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-02 18:41:26,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:26,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:26,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 18:41:26,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:26,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash -970893634, now seen corresponding path program 1 times [2023-12-02 18:41:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:26,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106765374] [2023-12-02 18:41:26,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:26,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:26,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106765374] [2023-12-02 18:41:26,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106765374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:26,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:26,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:41:26,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860856767] [2023-12-02 18:41:26,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:26,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:41:26,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:26,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:41:26,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:26,646 INFO L87 Difference]: Start difference. First operand 1942 states and 2783 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:27,128 INFO L93 Difference]: Finished difference Result 5184 states and 7429 transitions. [2023-12-02 18:41:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:41:27,129 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-12-02 18:41:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:27,151 INFO L225 Difference]: With dead ends: 5184 [2023-12-02 18:41:27,151 INFO L226 Difference]: Without dead ends: 3248 [2023-12-02 18:41:27,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:41:27,159 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 302 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:27,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 261 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2023-12-02 18:41:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3035. [2023-12-02 18:41:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 2362 states have (on average 1.342506350550381) internal successors, (3171), 2371 states have internal predecessors, (3171), 406 states have call successors, (406), 238 states have call predecessors, (406), 266 states have return successors, (676), 426 states have call predecessors, (676), 406 states have call successors, (676) [2023-12-02 18:41:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4253 transitions. [2023-12-02 18:41:27,408 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4253 transitions. Word has length 45 [2023-12-02 18:41:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:27,409 INFO L495 AbstractCegarLoop]: Abstraction has 3035 states and 4253 transitions. [2023-12-02 18:41:27,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 18:41:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4253 transitions. [2023-12-02 18:41:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 18:41:27,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:27,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:27,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 18:41:27,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:27,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 22959824, now seen corresponding path program 1 times [2023-12-02 18:41:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799360092] [2023-12-02 18:41:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:27,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799360092] [2023-12-02 18:41:27,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799360092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:27,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:41:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121056875] [2023-12-02 18:41:27,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:27,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:41:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:27,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:41:27,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:41:27,475 INFO L87 Difference]: Start difference. First operand 3035 states and 4253 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:41:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:27,846 INFO L93 Difference]: Finished difference Result 5871 states and 8353 transitions. [2023-12-02 18:41:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:41:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2023-12-02 18:41:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:27,883 INFO L225 Difference]: With dead ends: 5871 [2023-12-02 18:41:27,884 INFO L226 Difference]: Without dead ends: 3867 [2023-12-02 18:41:27,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:41:27,895 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 94 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:27,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 192 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2023-12-02 18:41:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3211. [2023-12-02 18:41:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 2472 states have (on average 1.311084142394822) internal successors, (3241), 2504 states have internal predecessors, (3241), 450 states have call successors, (450), 270 states have call predecessors, (450), 288 states have return successors, (644), 437 states have call predecessors, (644), 450 states have call successors, (644) [2023-12-02 18:41:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4335 transitions. [2023-12-02 18:41:28,218 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4335 transitions. Word has length 47 [2023-12-02 18:41:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:28,219 INFO L495 AbstractCegarLoop]: Abstraction has 3211 states and 4335 transitions. [2023-12-02 18:41:28,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 18:41:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4335 transitions. [2023-12-02 18:41:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 18:41:28,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:28,223 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 18:41:28,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 18:41:28,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:28,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:28,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1551169436, now seen corresponding path program 1 times [2023-12-02 18:41:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:28,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649164197] [2023-12-02 18:41:28,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:28,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 18:41:28,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:28,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649164197] [2023-12-02 18:41:28,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649164197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:28,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:28,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:41:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284275048] [2023-12-02 18:41:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:28,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:41:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:41:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:28,414 INFO L87 Difference]: Start difference. First operand 3211 states and 4335 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 18:41:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:29,080 INFO L93 Difference]: Finished difference Result 9135 states and 12328 transitions. [2023-12-02 18:41:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:41:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2023-12-02 18:41:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:29,132 INFO L225 Difference]: With dead ends: 9135 [2023-12-02 18:41:29,133 INFO L226 Difference]: Without dead ends: 5930 [2023-12-02 18:41:29,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:41:29,148 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 279 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:29,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 295 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5930 states. [2023-12-02 18:41:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5930 to 5620. [2023-12-02 18:41:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5620 states, 4315 states have (on average 1.2977983777520279) internal successors, (5600), 4366 states have internal predecessors, (5600), 788 states have call successors, (788), 480 states have call predecessors, (788), 516 states have return successors, (1142), 774 states have call predecessors, (1142), 788 states have call successors, (1142) [2023-12-02 18:41:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 7530 transitions. [2023-12-02 18:41:29,759 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 7530 transitions. Word has length 59 [2023-12-02 18:41:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:29,760 INFO L495 AbstractCegarLoop]: Abstraction has 5620 states and 7530 transitions. [2023-12-02 18:41:29,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 18:41:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 7530 transitions. [2023-12-02 18:41:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 18:41:29,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:29,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:29,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 18:41:29,765 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:29,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 565553542, now seen corresponding path program 1 times [2023-12-02 18:41:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684218361] [2023-12-02 18:41:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 18:41:29,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684218361] [2023-12-02 18:41:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684218361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:41:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501905266] [2023-12-02 18:41:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:29,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:41:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:41:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:29,963 INFO L87 Difference]: Start difference. First operand 5620 states and 7530 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 18:41:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:30,794 INFO L93 Difference]: Finished difference Result 15076 states and 20088 transitions. [2023-12-02 18:41:30,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:41:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2023-12-02 18:41:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:30,868 INFO L225 Difference]: With dead ends: 15076 [2023-12-02 18:41:30,868 INFO L226 Difference]: Without dead ends: 9462 [2023-12-02 18:41:30,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-02 18:41:30,891 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 337 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:30,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 219 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9462 states. [2023-12-02 18:41:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9462 to 9444. [2023-12-02 18:41:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9444 states, 7240 states have (on average 1.2776243093922652) internal successors, (9250), 7313 states have internal predecessors, (9250), 1335 states have call successors, (1335), 828 states have call predecessors, (1335), 868 states have return successors, (1891), 1303 states have call predecessors, (1891), 1335 states have call successors, (1891) [2023-12-02 18:41:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 12476 transitions. [2023-12-02 18:41:31,811 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 12476 transitions. Word has length 63 [2023-12-02 18:41:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:31,812 INFO L495 AbstractCegarLoop]: Abstraction has 9444 states and 12476 transitions. [2023-12-02 18:41:31,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 18:41:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 12476 transitions. [2023-12-02 18:41:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 18:41:31,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:31,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:31,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 18:41:31,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:31,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:31,818 INFO L85 PathProgramCache]: Analyzing trace with hash 113091130, now seen corresponding path program 1 times [2023-12-02 18:41:31,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:31,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706715788] [2023-12-02 18:41:31,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:31,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:41:31,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706715788] [2023-12-02 18:41:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706715788] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:31,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010161591] [2023-12-02 18:41:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:31,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:31,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:31,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:31,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 18:41:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:32,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:41:32,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:32,078 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:41:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010161591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:32,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:41:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 18:41:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313663688] [2023-12-02 18:41:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:32,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:41:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:41:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:32,082 INFO L87 Difference]: Start difference. First operand 9444 states and 12476 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-02 18:41:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:32,643 INFO L93 Difference]: Finished difference Result 15200 states and 20380 transitions. [2023-12-02 18:41:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:41:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2023-12-02 18:41:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:32,700 INFO L225 Difference]: With dead ends: 15200 [2023-12-02 18:41:32,700 INFO L226 Difference]: Without dead ends: 11836 [2023-12-02 18:41:32,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:32,715 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:32,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 276 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2023-12-02 18:41:33,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 10296. [2023-12-02 18:41:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10296 states, 8002 states have (on average 1.2838040489877531) internal successors, (10273), 8075 states have internal predecessors, (10273), 1380 states have call successors, (1380), 873 states have call predecessors, (1380), 913 states have return successors, (1936), 1348 states have call predecessors, (1936), 1380 states have call successors, (1936) [2023-12-02 18:41:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10296 states to 10296 states and 13589 transitions. [2023-12-02 18:41:33,535 INFO L78 Accepts]: Start accepts. Automaton has 10296 states and 13589 transitions. Word has length 67 [2023-12-02 18:41:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:33,536 INFO L495 AbstractCegarLoop]: Abstraction has 10296 states and 13589 transitions. [2023-12-02 18:41:33,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-02 18:41:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 10296 states and 13589 transitions. [2023-12-02 18:41:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-02 18:41:33,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:33,556 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:33,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 18:41:33,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:33,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:33,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1210685998, now seen corresponding path program 1 times [2023-12-02 18:41:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:33,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663661429] [2023-12-02 18:41:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 18:41:33,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663661429] [2023-12-02 18:41:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663661429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:33,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:33,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:41:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036167305] [2023-12-02 18:41:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:33,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:41:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:41:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:41:33,816 INFO L87 Difference]: Start difference. First operand 10296 states and 13589 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 18:41:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:34,716 INFO L93 Difference]: Finished difference Result 21851 states and 28930 transitions. [2023-12-02 18:41:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:41:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 89 [2023-12-02 18:41:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:34,770 INFO L225 Difference]: With dead ends: 21851 [2023-12-02 18:41:34,770 INFO L226 Difference]: Without dead ends: 13024 [2023-12-02 18:41:34,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:41:34,799 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:34,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 197 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2023-12-02 18:41:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 7687. [2023-12-02 18:41:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7687 states, 6015 states have (on average 1.2799667497921863) internal successors, (7699), 6048 states have internal predecessors, (7699), 1016 states have call successors, (1016), 647 states have call predecessors, (1016), 655 states have return successors, (1280), 992 states have call predecessors, (1280), 1016 states have call successors, (1280) [2023-12-02 18:41:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7687 states to 7687 states and 9995 transitions. [2023-12-02 18:41:35,371 INFO L78 Accepts]: Start accepts. Automaton has 7687 states and 9995 transitions. Word has length 89 [2023-12-02 18:41:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:35,372 INFO L495 AbstractCegarLoop]: Abstraction has 7687 states and 9995 transitions. [2023-12-02 18:41:35,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-02 18:41:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7687 states and 9995 transitions. [2023-12-02 18:41:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 18:41:35,379 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:35,380 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:35,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 18:41:35,380 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:35,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1833439747, now seen corresponding path program 1 times [2023-12-02 18:41:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814134730] [2023-12-02 18:41:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 18:41:35,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814134730] [2023-12-02 18:41:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814134730] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664196081] [2023-12-02 18:41:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:35,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:35,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 18:41:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:35,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:41:35,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:41:35,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:41:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664196081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:35,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:41:35,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-02 18:41:35,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856800237] [2023-12-02 18:41:35,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:35,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:41:35,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:41:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:35,634 INFO L87 Difference]: Start difference. First operand 7687 states and 9995 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 18:41:36,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:36,272 INFO L93 Difference]: Finished difference Result 14535 states and 19118 transitions. [2023-12-02 18:41:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:41:36,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2023-12-02 18:41:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:36,295 INFO L225 Difference]: With dead ends: 14535 [2023-12-02 18:41:36,295 INFO L226 Difference]: Without dead ends: 9241 [2023-12-02 18:41:36,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:41:36,307 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 56 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:36,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 268 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2023-12-02 18:41:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 8404. [2023-12-02 18:41:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8404 states, 6654 states have (on average 1.2883979561166217) internal successors, (8573), 6687 states have internal predecessors, (8573), 1055 states have call successors, (1055), 686 states have call predecessors, (1055), 694 states have return successors, (1319), 1031 states have call predecessors, (1319), 1055 states have call successors, (1319) [2023-12-02 18:41:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8404 states to 8404 states and 10947 transitions. [2023-12-02 18:41:36,791 INFO L78 Accepts]: Start accepts. Automaton has 8404 states and 10947 transitions. Word has length 91 [2023-12-02 18:41:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:36,791 INFO L495 AbstractCegarLoop]: Abstraction has 8404 states and 10947 transitions. [2023-12-02 18:41:36,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 18:41:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8404 states and 10947 transitions. [2023-12-02 18:41:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:36,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:36,798 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:36,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 18:41:36,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 18:41:36,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:36,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -221669517, now seen corresponding path program 1 times [2023-12-02 18:41:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229386702] [2023-12-02 18:41:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 18:41:37,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:37,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229386702] [2023-12-02 18:41:37,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229386702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:37,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:37,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:37,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834061744] [2023-12-02 18:41:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:37,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:37,043 INFO L87 Difference]: Start difference. First operand 8404 states and 10947 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:37,668 INFO L93 Difference]: Finished difference Result 12561 states and 16561 transitions. [2023-12-02 18:41:37,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:41:37,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-12-02 18:41:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:37,683 INFO L225 Difference]: With dead ends: 12561 [2023-12-02 18:41:37,683 INFO L226 Difference]: Without dead ends: 5089 [2023-12-02 18:41:37,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:37,700 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 194 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:37,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 310 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5089 states. [2023-12-02 18:41:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5089 to 5033. [2023-12-02 18:41:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5033 states, 4016 states have (on average 1.2756474103585658) internal successors, (5123), 4035 states have internal predecessors, (5123), 618 states have call successors, (618), 398 states have call predecessors, (618), 398 states have return successors, (618), 600 states have call predecessors, (618), 618 states have call successors, (618) [2023-12-02 18:41:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5033 states to 5033 states and 6359 transitions. [2023-12-02 18:41:38,098 INFO L78 Accepts]: Start accepts. Automaton has 5033 states and 6359 transitions. Word has length 90 [2023-12-02 18:41:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:38,098 INFO L495 AbstractCegarLoop]: Abstraction has 5033 states and 6359 transitions. [2023-12-02 18:41:38,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5033 states and 6359 transitions. [2023-12-02 18:41:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:38,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:38,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:38,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 18:41:38,105 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:38,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1001650446, now seen corresponding path program 1 times [2023-12-02 18:41:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:38,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302279043] [2023-12-02 18:41:38,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:38,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 18:41:38,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302279043] [2023-12-02 18:41:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302279043] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949314359] [2023-12-02 18:41:38,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:38,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:38,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:38,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:38,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 18:41:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:38,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 18:41:38,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 18:41:38,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:41:38,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949314359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:41:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-02 18:41:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303160346] [2023-12-02 18:41:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:38,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:41:38,467 INFO L87 Difference]: Start difference. First operand 5033 states and 6359 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-02 18:41:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:39,191 INFO L93 Difference]: Finished difference Result 9777 states and 12368 transitions. [2023-12-02 18:41:39,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:41:39,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-02 18:41:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:39,218 INFO L225 Difference]: With dead ends: 9777 [2023-12-02 18:41:39,218 INFO L226 Difference]: Without dead ends: 6461 [2023-12-02 18:41:39,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:41:39,229 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 95 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:39,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 381 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2023-12-02 18:41:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 6227. [2023-12-02 18:41:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6227 states, 4899 states have (on average 1.269034496836089) internal successors, (6217), 4924 states have internal predecessors, (6217), 803 states have call successors, (803), 520 states have call predecessors, (803), 524 states have return successors, (891), 783 states have call predecessors, (891), 803 states have call successors, (891) [2023-12-02 18:41:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 7911 transitions. [2023-12-02 18:41:39,776 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 7911 transitions. Word has length 90 [2023-12-02 18:41:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:39,777 INFO L495 AbstractCegarLoop]: Abstraction has 6227 states and 7911 transitions. [2023-12-02 18:41:39,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-02 18:41:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 7911 transitions. [2023-12-02 18:41:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:39,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:39,782 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:39,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 18:41:39,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 18:41:39,987 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:39,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2079148477, now seen corresponding path program 1 times [2023-12-02 18:41:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48774090] [2023-12-02 18:41:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 18:41:40,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48774090] [2023-12-02 18:41:40,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48774090] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:40,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:40,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812753123] [2023-12-02 18:41:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:40,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:40,133 INFO L87 Difference]: Start difference. First operand 6227 states and 7911 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-02 18:41:40,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:40,698 INFO L93 Difference]: Finished difference Result 12333 states and 15809 transitions. [2023-12-02 18:41:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:41:40,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-02 18:41:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:40,722 INFO L225 Difference]: With dead ends: 12333 [2023-12-02 18:41:40,722 INFO L226 Difference]: Without dead ends: 7959 [2023-12-02 18:41:40,729 INFO L412 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 [2023-12-02 18:41:40,730 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 96 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:40,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 393 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7959 states. [2023-12-02 18:41:41,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7959 to 7667. [2023-12-02 18:41:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7667 states, 5953 states have (on average 1.2637325718125314) internal successors, (7523), 5996 states have internal predecessors, (7523), 1037 states have call successors, (1037), 668 states have call predecessors, (1037), 676 states have return successors, (1299), 1003 states have call predecessors, (1299), 1037 states have call successors, (1299) [2023-12-02 18:41:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7667 states to 7667 states and 9859 transitions. [2023-12-02 18:41:41,293 INFO L78 Accepts]: Start accepts. Automaton has 7667 states and 9859 transitions. Word has length 90 [2023-12-02 18:41:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:41,293 INFO L495 AbstractCegarLoop]: Abstraction has 7667 states and 9859 transitions. [2023-12-02 18:41:41,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-02 18:41:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7667 states and 9859 transitions. [2023-12-02 18:41:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:41,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:41,300 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:41,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 18:41:41,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:41,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1965761820, now seen corresponding path program 1 times [2023-12-02 18:41:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:41,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572205007] [2023-12-02 18:41:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:41:41,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:41,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572205007] [2023-12-02 18:41:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572205007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:41,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113413054] [2023-12-02 18:41:41,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:41,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:41,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:41,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:41,365 INFO L87 Difference]: Start difference. First operand 7667 states and 9859 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:42,003 INFO L93 Difference]: Finished difference Result 13501 states and 17837 transitions. [2023-12-02 18:41:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:41:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-12-02 18:41:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:42,023 INFO L225 Difference]: With dead ends: 13501 [2023-12-02 18:41:42,023 INFO L226 Difference]: Without dead ends: 7687 [2023-12-02 18:41:42,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:42,033 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 200 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:42,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 310 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7687 states. [2023-12-02 18:41:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7687 to 7649. [2023-12-02 18:41:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 5935 states have (on average 1.2392586352148274) internal successors, (7355), 5978 states have internal predecessors, (7355), 1037 states have call successors, (1037), 668 states have call predecessors, (1037), 676 states have return successors, (1299), 1003 states have call predecessors, (1299), 1037 states have call successors, (1299) [2023-12-02 18:41:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 9691 transitions. [2023-12-02 18:41:42,478 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 9691 transitions. Word has length 90 [2023-12-02 18:41:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:42,479 INFO L495 AbstractCegarLoop]: Abstraction has 7649 states and 9691 transitions. [2023-12-02 18:41:42,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 9691 transitions. [2023-12-02 18:41:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:42,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:42,485 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:42,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 18:41:42,485 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:42,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash -185807376, now seen corresponding path program 1 times [2023-12-02 18:41:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234099518] [2023-12-02 18:41:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-02 18:41:42,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234099518] [2023-12-02 18:41:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234099518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:42,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:42,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 18:41:42,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199402265] [2023-12-02 18:41:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:42,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:41:42,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:41:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:41:42,898 INFO L87 Difference]: Start difference. First operand 7649 states and 9691 transitions. Second operand has 11 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 18:41:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:44,679 INFO L93 Difference]: Finished difference Result 20721 states and 27110 transitions. [2023-12-02 18:41:44,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 18:41:44,680 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 90 [2023-12-02 18:41:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:44,722 INFO L225 Difference]: With dead ends: 20721 [2023-12-02 18:41:44,722 INFO L226 Difference]: Without dead ends: 13989 [2023-12-02 18:41:44,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:41:44,740 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 664 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:44,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 423 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 18:41:44,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13989 states. [2023-12-02 18:41:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13989 to 10762. [2023-12-02 18:41:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10762 states, 8654 states have (on average 1.231107002542177) internal successors, (10654), 8717 states have internal predecessors, (10654), 1198 states have call successors, (1198), 881 states have call predecessors, (1198), 909 states have return successors, (1567), 1164 states have call predecessors, (1567), 1198 states have call successors, (1567) [2023-12-02 18:41:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10762 states to 10762 states and 13419 transitions. [2023-12-02 18:41:45,668 INFO L78 Accepts]: Start accepts. Automaton has 10762 states and 13419 transitions. Word has length 90 [2023-12-02 18:41:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:45,668 INFO L495 AbstractCegarLoop]: Abstraction has 10762 states and 13419 transitions. [2023-12-02 18:41:45,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-02 18:41:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 10762 states and 13419 transitions. [2023-12-02 18:41:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 18:41:45,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:45,675 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:45,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 18:41:45,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:45,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1159296335, now seen corresponding path program 1 times [2023-12-02 18:41:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:45,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135896708] [2023-12-02 18:41:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 18:41:45,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135896708] [2023-12-02 18:41:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135896708] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:45,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920036787] [2023-12-02 18:41:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:45,751 INFO L87 Difference]: Start difference. First operand 10762 states and 13419 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:46,812 INFO L93 Difference]: Finished difference Result 16571 states and 21180 transitions. [2023-12-02 18:41:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:41:46,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2023-12-02 18:41:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:46,839 INFO L225 Difference]: With dead ends: 16571 [2023-12-02 18:41:46,839 INFO L226 Difference]: Without dead ends: 10646 [2023-12-02 18:41:46,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:46,851 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 209 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:46,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 310 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2023-12-02 18:41:47,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10552. [2023-12-02 18:41:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10552 states, 8468 states have (on average 1.2083136513934813) internal successors, (10232), 8507 states have internal predecessors, (10232), 1198 states have call successors, (1198), 881 states have call predecessors, (1198), 885 states have return successors, (1522), 1164 states have call predecessors, (1522), 1198 states have call successors, (1522) [2023-12-02 18:41:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10552 states to 10552 states and 12952 transitions. [2023-12-02 18:41:47,731 INFO L78 Accepts]: Start accepts. Automaton has 10552 states and 12952 transitions. Word has length 90 [2023-12-02 18:41:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:47,732 INFO L495 AbstractCegarLoop]: Abstraction has 10552 states and 12952 transitions. [2023-12-02 18:41:47,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-02 18:41:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 10552 states and 12952 transitions. [2023-12-02 18:41:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 18:41:47,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:47,737 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:47,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 18:41:47,737 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:47,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1919031453, now seen corresponding path program 1 times [2023-12-02 18:41:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302849439] [2023-12-02 18:41:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 18:41:47,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302849439] [2023-12-02 18:41:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302849439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 18:41:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610706908] [2023-12-02 18:41:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:47,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:41:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:41:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:41:47,919 INFO L87 Difference]: Start difference. First operand 10552 states and 12952 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 18:41:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:49,031 INFO L93 Difference]: Finished difference Result 19129 states and 23686 transitions. [2023-12-02 18:41:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 18:41:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2023-12-02 18:41:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:49,061 INFO L225 Difference]: With dead ends: 19129 [2023-12-02 18:41:49,061 INFO L226 Difference]: Without dead ends: 14300 [2023-12-02 18:41:49,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:41:49,073 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 86 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:49,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 371 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:41:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14300 states. [2023-12-02 18:41:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14300 to 13866. [2023-12-02 18:41:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13866 states, 11095 states have (on average 1.2057683641279855) internal successors, (13378), 11110 states have internal predecessors, (13378), 1621 states have call successors, (1621), 1189 states have call predecessors, (1621), 1149 states have return successors, (2120), 1567 states have call predecessors, (2120), 1621 states have call successors, (2120) [2023-12-02 18:41:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13866 states to 13866 states and 17119 transitions. [2023-12-02 18:41:50,016 INFO L78 Accepts]: Start accepts. Automaton has 13866 states and 17119 transitions. Word has length 91 [2023-12-02 18:41:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 13866 states and 17119 transitions. [2023-12-02 18:41:50,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-12-02 18:41:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 13866 states and 17119 transitions. [2023-12-02 18:41:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 18:41:50,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:50,031 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 18:41:50,031 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:50,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1725146296, now seen corresponding path program 1 times [2023-12-02 18:41:50,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869551543] [2023-12-02 18:41:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:50,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-02 18:41:50,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869551543] [2023-12-02 18:41:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869551543] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:50,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:50,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 18:41:50,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404850082] [2023-12-02 18:41:50,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:50,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 18:41:50,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:50,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 18:41:50,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:41:50,436 INFO L87 Difference]: Start difference. First operand 13866 states and 17119 transitions. Second operand has 11 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-02 18:41:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:52,934 INFO L93 Difference]: Finished difference Result 39290 states and 49798 transitions. [2023-12-02 18:41:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 18:41:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 115 [2023-12-02 18:41:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:52,988 INFO L225 Difference]: With dead ends: 39290 [2023-12-02 18:41:52,988 INFO L226 Difference]: Without dead ends: 28206 [2023-12-02 18:41:53,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-12-02 18:41:53,003 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 718 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:53,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 383 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 18:41:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28206 states. [2023-12-02 18:41:54,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28206 to 20818. [2023-12-02 18:41:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20818 states, 17072 states have (on average 1.186269915651359) internal successors, (20252), 17211 states have internal predecessors, (20252), 2053 states have call successors, (2053), 1613 states have call predecessors, (2053), 1692 states have return successors, (2820), 1994 states have call predecessors, (2820), 2053 states have call successors, (2820) [2023-12-02 18:41:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20818 states to 20818 states and 25125 transitions. [2023-12-02 18:41:54,706 INFO L78 Accepts]: Start accepts. Automaton has 20818 states and 25125 transitions. Word has length 115 [2023-12-02 18:41:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:54,706 INFO L495 AbstractCegarLoop]: Abstraction has 20818 states and 25125 transitions. [2023-12-02 18:41:54,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 5 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-02 18:41:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 20818 states and 25125 transitions. [2023-12-02 18:41:54,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-02 18:41:54,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:54,727 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:54,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 18:41:54,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:54,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash -945165367, now seen corresponding path program 1 times [2023-12-02 18:41:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75520112] [2023-12-02 18:41:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 18:41:54,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:54,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75520112] [2023-12-02 18:41:54,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75520112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:41:54,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:41:54,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:41:54,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765057253] [2023-12-02 18:41:54,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:41:54,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:41:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:41:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:41:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:54,807 INFO L87 Difference]: Start difference. First operand 20818 states and 25125 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 18:41:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:41:56,319 INFO L93 Difference]: Finished difference Result 30254 states and 37345 transitions. [2023-12-02 18:41:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:41:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2023-12-02 18:41:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:41:56,352 INFO L225 Difference]: With dead ends: 30254 [2023-12-02 18:41:56,352 INFO L226 Difference]: Without dead ends: 19327 [2023-12-02 18:41:56,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:41:56,367 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 195 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:41:56,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 296 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:41:56,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19327 states. [2023-12-02 18:41:57,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19327 to 19144. [2023-12-02 18:41:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19144 states, 15578 states have (on average 1.1683142893824625) internal successors, (18200), 15648 states have internal predecessors, (18200), 1969 states have call successors, (1969), 1541 states have call predecessors, (1969), 1596 states have return successors, (2600), 1955 states have call predecessors, (2600), 1969 states have call successors, (2600) [2023-12-02 18:41:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19144 states to 19144 states and 22769 transitions. [2023-12-02 18:41:57,763 INFO L78 Accepts]: Start accepts. Automaton has 19144 states and 22769 transitions. Word has length 115 [2023-12-02 18:41:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:41:57,763 INFO L495 AbstractCegarLoop]: Abstraction has 19144 states and 22769 transitions. [2023-12-02 18:41:57,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-02 18:41:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19144 states and 22769 transitions. [2023-12-02 18:41:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 18:41:57,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:41:57,778 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:41:57,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 18:41:57,778 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:41:57,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:41:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1144745364, now seen corresponding path program 1 times [2023-12-02 18:41:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:41:57,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911299373] [2023-12-02 18:41:57,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:57,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:41:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 18:41:57,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:41:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911299373] [2023-12-02 18:41:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911299373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:41:57,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55402227] [2023-12-02 18:41:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:41:57,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:41:57,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:41:57,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:41:57,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 18:41:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:41:58,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 18:41:58,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:41:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 39 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:41:58,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:41:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-02 18:41:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55402227] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:41:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1814083737] [2023-12-02 18:41:58,463 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2023-12-02 18:41:58,463 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 18:41:58,467 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 18:41:58,473 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 18:41:58,473 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 18:42:02,886 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 102 for LOIs [2023-12-02 18:42:02,940 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-12-02 18:42:02,964 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2023-12-02 18:42:04,403 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 84 for LOIs [2023-12-02 18:42:04,427 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 70 for LOIs [2023-12-02 18:42:04,436 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 1 for LOIs [2023-12-02 18:42:04,443 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 127 for LOIs [2023-12-02 18:42:05,511 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 191 for LOIs [2023-12-02 18:42:06,032 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 18:42:18,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '522514#(and (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483648)) (= 2 ~t2_st~0) (= ~t3_st~0 1) (<= |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483647) (= ~t2_pc~0 1) (not (= |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 0)) (= ~t3_pc~0 1))' at error location [2023-12-02 18:42:18,813 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 18:42:18,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:42:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 10 [2023-12-02 18:42:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879219353] [2023-12-02 18:42:18,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:42:18,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 18:42:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 18:42:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3912, Unknown=0, NotChecked=0, Total=4160 [2023-12-02 18:42:18,819 INFO L87 Difference]: Start difference. First operand 19144 states and 22769 transitions. Second operand has 10 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2023-12-02 18:42:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:21,481 INFO L93 Difference]: Finished difference Result 38381 states and 46355 transitions. [2023-12-02 18:42:21,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:42:21,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 116 [2023-12-02 18:42:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:21,537 INFO L225 Difference]: With dead ends: 38381 [2023-12-02 18:42:21,537 INFO L226 Difference]: Without dead ends: 22325 [2023-12-02 18:42:21,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=304, Invalid=4666, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 18:42:21,573 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 409 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:21,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 282 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 18:42:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22325 states. [2023-12-02 18:42:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22325 to 21339. [2023-12-02 18:42:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21339 states, 17399 states have (on average 1.1485142824300247) internal successors, (19983), 17438 states have internal predecessors, (19983), 2184 states have call successors, (2184), 1708 states have call predecessors, (2184), 1755 states have return successors, (2486), 2193 states have call predecessors, (2486), 2184 states have call successors, (2486) [2023-12-02 18:42:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21339 states to 21339 states and 24653 transitions. [2023-12-02 18:42:23,686 INFO L78 Accepts]: Start accepts. Automaton has 21339 states and 24653 transitions. Word has length 116 [2023-12-02 18:42:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:23,686 INFO L495 AbstractCegarLoop]: Abstraction has 21339 states and 24653 transitions. [2023-12-02 18:42:23,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2023-12-02 18:42:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21339 states and 24653 transitions. [2023-12-02 18:42:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-02 18:42:23,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:23,701 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:42:23,706 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 18:42:23,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:23,901 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:42:23,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:23,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1954784414, now seen corresponding path program 1 times [2023-12-02 18:42:23,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:23,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451910017] [2023-12-02 18:42:23,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 18:42:24,234 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:24,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451910017] [2023-12-02 18:42:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451910017] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:42:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699024326] [2023-12-02 18:42:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:24,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:24,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:42:24,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 18:42:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:24,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 18:42:24,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:42:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:42:24,456 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:42:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699024326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:42:24,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:42:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2023-12-02 18:42:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550252167] [2023-12-02 18:42:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:42:24,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 18:42:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:24,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 18:42:24,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 18:42:24,458 INFO L87 Difference]: Start difference. First operand 21339 states and 24653 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-02 18:42:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:26,135 INFO L93 Difference]: Finished difference Result 29250 states and 33765 transitions. [2023-12-02 18:42:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 18:42:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 118 [2023-12-02 18:42:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:26,166 INFO L225 Difference]: With dead ends: 29250 [2023-12-02 18:42:26,166 INFO L226 Difference]: Without dead ends: 16174 [2023-12-02 18:42:26,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 18:42:26,183 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 198 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:26,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 426 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 18:42:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16174 states. [2023-12-02 18:42:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16174 to 15493. [2023-12-02 18:42:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15493 states, 12615 states have (on average 1.1421323820848197) internal successors, (14408), 12651 states have internal predecessors, (14408), 1588 states have call successors, (1588), 1242 states have call predecessors, (1588), 1289 states have return successors, (1828), 1600 states have call predecessors, (1828), 1588 states have call successors, (1828) [2023-12-02 18:42:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15493 states to 15493 states and 17824 transitions. [2023-12-02 18:42:27,646 INFO L78 Accepts]: Start accepts. Automaton has 15493 states and 17824 transitions. Word has length 118 [2023-12-02 18:42:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:27,647 INFO L495 AbstractCegarLoop]: Abstraction has 15493 states and 17824 transitions. [2023-12-02 18:42:27,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-02 18:42:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15493 states and 17824 transitions. [2023-12-02 18:42:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-02 18:42:27,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:27,654 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:42:27,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 18:42:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:27,855 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:42:27,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1935085263, now seen corresponding path program 1 times [2023-12-02 18:42:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172245129] [2023-12-02 18:42:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-02 18:42:27,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172245129] [2023-12-02 18:42:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172245129] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:42:27,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:42:27,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:42:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157800288] [2023-12-02 18:42:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:42:27,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:42:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:42:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:42:27,930 INFO L87 Difference]: Start difference. First operand 15493 states and 17824 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 18:42:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:29,587 INFO L93 Difference]: Finished difference Result 30769 states and 35680 transitions. [2023-12-02 18:42:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:42:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 119 [2023-12-02 18:42:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:29,618 INFO L225 Difference]: With dead ends: 30769 [2023-12-02 18:42:29,618 INFO L226 Difference]: Without dead ends: 18018 [2023-12-02 18:42:29,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:42:29,632 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 45 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:29,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 247 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 18:42:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18018 states. [2023-12-02 18:42:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18018 to 16356. [2023-12-02 18:42:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16356 states, 13374 states have (on average 1.1479736802751608) internal successors, (15353), 13410 states have internal predecessors, (15353), 1640 states have call successors, (1640), 1294 states have call predecessors, (1640), 1341 states have return successors, (1880), 1652 states have call predecessors, (1880), 1640 states have call successors, (1880) [2023-12-02 18:42:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16356 states to 16356 states and 18873 transitions. [2023-12-02 18:42:31,230 INFO L78 Accepts]: Start accepts. Automaton has 16356 states and 18873 transitions. Word has length 119 [2023-12-02 18:42:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:31,231 INFO L495 AbstractCegarLoop]: Abstraction has 16356 states and 18873 transitions. [2023-12-02 18:42:31,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-02 18:42:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 16356 states and 18873 transitions. [2023-12-02 18:42:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 18:42:31,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:31,240 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:42:31,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 18:42:31,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:42:31,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 952826786, now seen corresponding path program 1 times [2023-12-02 18:42:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996967340] [2023-12-02 18:42:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-12-02 18:42:31,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 18:42:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996967340] [2023-12-02 18:42:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996967340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:42:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843886796] [2023-12-02 18:42:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:31,332 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:42:31,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 18:42:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:42:31,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:42:31,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:42:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-02 18:42:31,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:42:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843886796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:42:31,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 18:42:31,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 18:42:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777539979] [2023-12-02 18:42:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:42:31,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:42:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 18:42:31,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:42:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:42:31,516 INFO L87 Difference]: Start difference. First operand 16356 states and 18873 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 18:42:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:42:32,719 INFO L93 Difference]: Finished difference Result 23475 states and 27355 transitions. [2023-12-02 18:42:32,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:42:32,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2023-12-02 18:42:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:42:32,745 INFO L225 Difference]: With dead ends: 23475 [2023-12-02 18:42:32,745 INFO L226 Difference]: Without dead ends: 13867 [2023-12-02 18:42:32,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:42:32,759 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:42:32,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 128 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 18:42:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13867 states. [2023-12-02 18:42:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13867 to 11113. [2023-12-02 18:42:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11113 states, 9198 states have (on average 1.1295933898673625) internal successors, (10390), 9225 states have internal predecessors, (10390), 1042 states have call successors, (1042), 834 states have call predecessors, (1042), 872 states have return successors, (1134), 1054 states have call predecessors, (1134), 1042 states have call successors, (1134) [2023-12-02 18:42:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12566 transitions. [2023-12-02 18:42:33,857 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 12566 transitions. Word has length 144 [2023-12-02 18:42:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:42:33,858 INFO L495 AbstractCegarLoop]: Abstraction has 11113 states and 12566 transitions. [2023-12-02 18:42:33,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-02 18:42:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 12566 transitions. [2023-12-02 18:42:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-02 18:42:33,864 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:42:33,864 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:42:33,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 18:42:34,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:42:34,065 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 18:42:34,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:42:34,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1546697020, now seen corresponding path program 1 times [2023-12-02 18:42:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 18:42:34,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328268020] [2023-12-02 18:42:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:42:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 18:42:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:42:34,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 18:42:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 18:42:34,177 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 18:42:34,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 18:42:34,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 18:42:34,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 18:42:34,185 INFO L445 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, 1, 1, 1] [2023-12-02 18:42:34,189 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 18:42:34,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-12-02 18:42:34,273 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-12-02 18:42:34,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:42:34 BoogieIcfgContainer [2023-12-02 18:42:34,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 18:42:34,332 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 18:42:34,332 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 18:42:34,332 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 18:42:34,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:41:23" (3/4) ... [2023-12-02 18:42:34,334 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 18:42:34,367 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-12-02 18:42:34,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-12-02 18:42:34,475 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 18:42:34,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 18:42:34,476 INFO L158 Benchmark]: Toolchain (without parser) took 72297.07ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 131.7MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 509.3MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,476 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:42:34,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.86ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 129.8MB in the end (delta: 1.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.79ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 126.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,477 INFO L158 Benchmark]: Boogie Preprocessor took 46.42ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:42:34,478 INFO L158 Benchmark]: RCFGBuilder took 793.37ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 78.0MB in the end (delta: 47.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,478 INFO L158 Benchmark]: TraceAbstraction took 70862.80ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 77.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 441.8MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,479 INFO L158 Benchmark]: Witness Printer took 143.02ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 18:42:34,481 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.14ms. Allocated memory is still 115.3MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.86ms. Allocated memory is still 167.8MB. Free memory was 131.7MB in the beginning and 129.8MB in the end (delta: 1.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.79ms. Allocated memory is still 167.8MB. Free memory was 129.8MB in the beginning and 126.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.42ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 125.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 793.37ms. Allocated memory is still 167.8MB. Free memory was 125.0MB in the beginning and 78.0MB in the end (delta: 47.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 70862.80ms. Allocated memory was 167.8MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 77.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 441.8MB. Max. memory is 16.1GB. * Witness Printer took 143.02ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) [L423] COND FALSE !(T1_E == 0) [L428] COND FALSE !(T2_E == 0) [L433] COND FALSE !(T3_E == 0) [L438] COND FALSE !(E_1 == 0) [L443] COND FALSE !(E_2 == 0) [L448] COND FALSE !(E_3 == 0) [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) [L466] COND FALSE !(T1_E == 1) [L471] COND FALSE !(T2_E == 1) [L476] COND FALSE !(T3_E == 1) [L481] COND FALSE !(E_1 == 1) [L486] COND FALSE !(E_2 == 1) [L491] COND FALSE !(E_3 == 1) [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, kernel_st=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L351-L362] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE, EXPR \read(tmp_ndt_2) [L370] EXPR t1_st = 1 [L371] CALL, EXPR transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET, EXPR transmit1() [L365-L376] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE, EXPR \read(tmp_ndt_3) [L384] EXPR t2_st = 1 [L385] CALL, EXPR transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET, EXPR transmit2() [L379-L390] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE, EXPR \read(tmp_ndt_4) [L398] EXPR t3_st = 1 [L399] CALL, EXPR transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 [L399] RET, EXPR transmit3() [L393-L404] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE, EXPR \read(tmp_ndt_1) [L356] EXPR m_st = 1 [L357] CALL, EXPR master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET, EXPR master() [L351-L362] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE, EXPR \read(tmp_ndt_2) [L370] EXPR t1_st = 1 [L371] CALL, EXPR transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET, EXPR transmit1() [L365-L376] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=1] [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE, EXPR \read(tmp_ndt_3) [L384] EXPR t2_st = 1 [L385] CALL, EXPR transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 [L548] RET activate_threads() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET, EXPR transmit2() [L379-L390] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1] [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.6s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5696 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5602 mSDsluCounter, 7118 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3881 mSDsCounter, 1217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4226 IncrementalHoareTripleChecker+Invalid, 5443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1217 mSolverCounterUnsat, 3237 mSDtfsCounter, 4226 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1861 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21339occurred in iteration=20, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 27208 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2714 NumberOfCodeBlocks, 2714 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2654 ConstructedInterpolants, 0 QuantifiedInterpolants, 4841 SizeOfPredicates, 7 NumberOfNonLiveVariables, 2716 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 1043/1102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-02 18:42:34,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5146b7d5-a934-47c2-9a06-28426c680703/bin/utaipan-verify-nQ1chXbOIh/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