./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/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_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/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_ecdad9bb-601c-472a-a27e-2225a220578a/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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:17:44,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:17:45,033 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:17:45,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:17:45,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:17:45,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:17:45,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:17:45,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:17:45,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:17:45,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:17:45,067 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:17:45,067 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:17:45,068 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:17:45,068 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:17:45,069 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:17:45,069 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:17:45,070 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:17:45,070 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:17:45,071 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:17:45,071 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:17:45,072 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:17:45,073 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:17:45,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:17:45,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:17:45,074 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:17:45,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:17:45,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:17:45,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:17:45,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:17:45,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:17:45,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:17:45,077 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:17:45,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:17:45,078 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:17:45,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:17:45,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:17:45,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:17:45,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:17:45,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:17:45,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:17:45,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:17:45,080 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:17:45,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:17:45,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:17:45,080 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:17:45,080 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:17:45,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:17:45,081 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_ecdad9bb-601c-472a-a27e-2225a220578a/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_ecdad9bb-601c-472a-a27e-2225a220578a/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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2023-12-02 15:17:45,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:17:45,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:17:45,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:17:45,338 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:17:45,339 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:17:45,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/systemc/kundu1.cil.c [2023-12-02 15:17:48,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:17:48,232 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:17:48,233 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/sv-benchmarks/c/systemc/kundu1.cil.c [2023-12-02 15:17:48,242 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/data/02c928882/212162c8c3784e3cae26d74eebbc9750/FLAGf47eb8632 [2023-12-02 15:17:48,254 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/data/02c928882/212162c8c3784e3cae26d74eebbc9750 [2023-12-02 15:17:48,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:17:48,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:17:48,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:17:48,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:17:48,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:17:48,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5f08e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48, skipping insertion in model container [2023-12-02 15:17:48,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:17:48,438 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_ecdad9bb-601c-472a-a27e-2225a220578a/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2023-12-02 15:17:48,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:17:48,500 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:17:48,512 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_ecdad9bb-601c-472a-a27e-2225a220578a/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2023-12-02 15:17:48,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:17:48,553 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:17:48,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48 WrapperNode [2023-12-02 15:17:48,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:17:48,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:17:48,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:17:48,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:17:48,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,598 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 258 [2023-12-02 15:17:48,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:17:48,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:17:48,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:17:48,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:17:48,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:17:48,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:17:48,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:17:48,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:17:48,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (1/1) ... [2023-12-02 15:17:48,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:17:48,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:17:48,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:17:48,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:17:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:17:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-02 15:17:48,713 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-02 15:17:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-02 15:17:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-02 15:17:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-02 15:17:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-02 15:17:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-02 15:17:48,714 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-02 15:17:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-02 15:17:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-02 15:17:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:17:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-02 15:17:48,715 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-02 15:17:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:17:48,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:17:48,800 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:17:48,802 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:17:49,088 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:17:49,179 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:17:49,180 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 15:17:49,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:49 BoogieIcfgContainer [2023-12-02 15:17:49,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:17:49,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:17:49,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:17:49,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:17:49,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:17:48" (1/3) ... [2023-12-02 15:17:49,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ead3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:17:49, skipping insertion in model container [2023-12-02 15:17:49,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:48" (2/3) ... [2023-12-02 15:17:49,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ead3ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:17:49, skipping insertion in model container [2023-12-02 15:17:49,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:49" (3/3) ... [2023-12-02 15:17:49,191 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-12-02 15:17:49,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:17:49,209 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:17:49,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:17:49,255 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;@6389a6e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:17:49,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:17:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 56 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 15:17:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:17:49,267 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:49,268 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] [2023-12-02 15:17:49,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:49,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1060029656, now seen corresponding path program 1 times [2023-12-02 15:17:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297758148] [2023-12-02 15:17:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:49,537 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 15:17:49,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297758148] [2023-12-02 15:17:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297758148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:49,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:17:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404255409] [2023-12-02 15:17:49,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:17:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:17:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:17:49,579 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.5) internal successors, (78), 56 states have internal predecessors, (78), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:49,773 INFO L93 Difference]: Finished difference Result 209 states and 307 transitions. [2023-12-02 15:17:49,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:17:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-12-02 15:17:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:49,785 INFO L225 Difference]: With dead ends: 209 [2023-12-02 15:17:49,785 INFO L226 Difference]: Without dead ends: 135 [2023-12-02 15:17:49,788 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 15:17:49,791 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 176 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:49,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 264 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-02 15:17:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2023-12-02 15:17:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 96 states have internal predecessors, (132), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-02 15:17:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2023-12-02 15:17:49,844 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 34 [2023-12-02 15:17:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:49,845 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2023-12-02 15:17:49,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2023-12-02 15:17:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 15:17:49,847 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:49,847 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] [2023-12-02 15:17:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:17:49,848 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:49,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1644542663, now seen corresponding path program 1 times [2023-12-02 15:17:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981847420] [2023-12-02 15:17:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:49,953 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 15:17:49,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981847420] [2023-12-02 15:17:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981847420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:17:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292863755] [2023-12-02 15:17:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:49,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:17:49,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:17:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:17:49,957 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:50,371 INFO L93 Difference]: Finished difference Result 534 states and 733 transitions. [2023-12-02 15:17:50,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:17:50,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-12-02 15:17:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:50,379 INFO L225 Difference]: With dead ends: 534 [2023-12-02 15:17:50,379 INFO L226 Difference]: Without dead ends: 389 [2023-12-02 15:17:50,381 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 15:17:50,383 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 357 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:50,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 367 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:17:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-02 15:17:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 284. [2023-12-02 15:17:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 215 states have (on average 1.413953488372093) internal successors, (304), 217 states have internal predecessors, (304), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2023-12-02 15:17:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 391 transitions. [2023-12-02 15:17:50,432 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 391 transitions. Word has length 34 [2023-12-02 15:17:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:50,432 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 391 transitions. [2023-12-02 15:17:50,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 391 transitions. [2023-12-02 15:17:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 15:17:50,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:50,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:50,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:17:50,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:50,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash 509572110, now seen corresponding path program 1 times [2023-12-02 15:17:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908146621] [2023-12-02 15:17:50,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:50,503 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 15:17:50,503 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:50,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908146621] [2023-12-02 15:17:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908146621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:50,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:50,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:17:50,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419653397] [2023-12-02 15:17:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:17:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:17:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:17:50,506 INFO L87 Difference]: Start difference. First operand 284 states and 391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:50,695 INFO L93 Difference]: Finished difference Result 734 states and 1013 transitions. [2023-12-02 15:17:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:17:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-02 15:17:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:50,701 INFO L225 Difference]: With dead ends: 734 [2023-12-02 15:17:50,702 INFO L226 Difference]: Without dead ends: 455 [2023-12-02 15:17:50,704 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 15:17:50,705 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 163 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 333 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-12-02 15:17:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 367. [2023-12-02 15:17:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 271 states have internal predecessors, (353), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2023-12-02 15:17:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 480 transitions. [2023-12-02 15:17:50,751 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 480 transitions. Word has length 35 [2023-12-02 15:17:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:50,751 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 480 transitions. [2023-12-02 15:17:50,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-02 15:17:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 480 transitions. [2023-12-02 15:17:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 15:17:50,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:50,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:50,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 15:17:50,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:50,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -463916849, now seen corresponding path program 1 times [2023-12-02 15:17:50,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:50,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836609833] [2023-12-02 15:17:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:50,827 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 15:17:50,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:50,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836609833] [2023-12-02 15:17:50,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836609833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:50,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:50,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:17:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052769025] [2023-12-02 15:17:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:50,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:17:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:17:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:17:50,830 INFO L87 Difference]: Start difference. First operand 367 states and 480 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:50,968 INFO L93 Difference]: Finished difference Result 888 states and 1160 transitions. [2023-12-02 15:17:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:17:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2023-12-02 15:17:50,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:50,973 INFO L225 Difference]: With dead ends: 888 [2023-12-02 15:17:50,973 INFO L226 Difference]: Without dead ends: 573 [2023-12-02 15:17:50,974 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 15:17:50,976 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 69 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:50,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 244 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-02 15:17:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2023-12-02 15:17:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 414 states have (on average 1.3067632850241546) internal successors, (541), 417 states have internal predecessors, (541), 95 states have call successors, (95), 56 states have call predecessors, (95), 55 states have return successors, (98), 92 states have call predecessors, (98), 92 states have call successors, (98) [2023-12-02 15:17:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 734 transitions. [2023-12-02 15:17:51,028 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 734 transitions. Word has length 35 [2023-12-02 15:17:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:51,029 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 734 transitions. [2023-12-02 15:17:51,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 734 transitions. [2023-12-02 15:17:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 15:17:51,031 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:51,031 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] [2023-12-02 15:17:51,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 15:17:51,031 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:51,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 626801033, now seen corresponding path program 1 times [2023-12-02 15:17:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494882727] [2023-12-02 15:17:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:51,120 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 15:17:51,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494882727] [2023-12-02 15:17:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494882727] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:51,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:17:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596644163] [2023-12-02 15:17:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:51,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:17:51,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:17:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:17:51,122 INFO L87 Difference]: Start difference. First operand 565 states and 734 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:51,316 INFO L93 Difference]: Finished difference Result 945 states and 1227 transitions. [2023-12-02 15:17:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 15:17:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2023-12-02 15:17:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:51,320 INFO L225 Difference]: With dead ends: 945 [2023-12-02 15:17:51,321 INFO L226 Difference]: Without dead ends: 630 [2023-12-02 15:17:51,322 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 15:17:51,323 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 257 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:51,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 246 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2023-12-02 15:17:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 619. [2023-12-02 15:17:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 455 states have (on average 1.3010989010989011) internal successors, (592), 458 states have internal predecessors, (592), 103 states have call successors, (103), 61 states have call predecessors, (103), 60 states have return successors, (106), 100 states have call predecessors, (106), 100 states have call successors, (106) [2023-12-02 15:17:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 801 transitions. [2023-12-02 15:17:51,372 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 801 transitions. Word has length 43 [2023-12-02 15:17:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:51,372 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 801 transitions. [2023-12-02 15:17:51,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 801 transitions. [2023-12-02 15:17:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 15:17:51,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:51,374 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] [2023-12-02 15:17:51,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 15:17:51,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:51,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1503509538, now seen corresponding path program 1 times [2023-12-02 15:17:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540942139] [2023-12-02 15:17:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:51,536 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 15:17:51,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540942139] [2023-12-02 15:17:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540942139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:17:51,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439332370] [2023-12-02 15:17:51,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:51,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:17:51,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:51,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:17:51,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:17:51,540 INFO L87 Difference]: Start difference. First operand 619 states and 801 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:51,737 INFO L93 Difference]: Finished difference Result 1407 states and 1819 transitions. [2023-12-02 15:17:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:17:51,738 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2023-12-02 15:17:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:51,742 INFO L225 Difference]: With dead ends: 1407 [2023-12-02 15:17:51,742 INFO L226 Difference]: Without dead ends: 840 [2023-12-02 15:17:51,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:17:51,745 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 148 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:51,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 340 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2023-12-02 15:17:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 820. [2023-12-02 15:17:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 604 states have (on average 1.2963576158940397) internal successors, (783), 607 states have internal predecessors, (783), 135 states have call successors, (135), 81 states have call predecessors, (135), 80 states have return successors, (140), 132 states have call predecessors, (140), 132 states have call successors, (140) [2023-12-02 15:17:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1058 transitions. [2023-12-02 15:17:51,801 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1058 transitions. Word has length 46 [2023-12-02 15:17:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:51,801 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1058 transitions. [2023-12-02 15:17:51,801 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 15:17:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1058 transitions. [2023-12-02 15:17:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 15:17:51,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:51,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:51,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 15:17:51,803 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:51,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 863216478, now seen corresponding path program 1 times [2023-12-02 15:17:51,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:51,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211368939] [2023-12-02 15:17:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:17:51,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211368939] [2023-12-02 15:17:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211368939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:17:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110266983] [2023-12-02 15:17:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:51,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:17:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:17:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:17:51,927 INFO L87 Difference]: Start difference. First operand 820 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:52,260 INFO L93 Difference]: Finished difference Result 2381 states and 3061 transitions. [2023-12-02 15:17:52,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:17:52,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2023-12-02 15:17:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:52,273 INFO L225 Difference]: With dead ends: 2381 [2023-12-02 15:17:52,273 INFO L226 Difference]: Without dead ends: 1567 [2023-12-02 15:17:52,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-12-02 15:17:52,277 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 180 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:52,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 210 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2023-12-02 15:17:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1531. [2023-12-02 15:17:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1107 states have (on average 1.2682926829268293) internal successors, (1404), 1110 states have internal predecessors, (1404), 263 states have call successors, (263), 161 states have call predecessors, (263), 160 states have return successors, (276), 260 states have call predecessors, (276), 260 states have call successors, (276) [2023-12-02 15:17:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1943 transitions. [2023-12-02 15:17:52,464 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1943 transitions. Word has length 48 [2023-12-02 15:17:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:52,464 INFO L495 AbstractCegarLoop]: Abstraction has 1531 states and 1943 transitions. [2023-12-02 15:17:52,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1943 transitions. [2023-12-02 15:17:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 15:17:52,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:52,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:52,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 15:17:52,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:52,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -824343522, now seen corresponding path program 1 times [2023-12-02 15:17:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689796450] [2023-12-02 15:17:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:17:52,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:52,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689796450] [2023-12-02 15:17:52,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689796450] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:52,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:52,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:17:52,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310217920] [2023-12-02 15:17:52,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:52,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:17:52,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:52,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:17:52,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:17:52,537 INFO L87 Difference]: Start difference. First operand 1531 states and 1943 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:52,892 INFO L93 Difference]: Finished difference Result 3644 states and 4590 transitions. [2023-12-02 15:17:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:17:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2023-12-02 15:17:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:52,906 INFO L225 Difference]: With dead ends: 3644 [2023-12-02 15:17:52,906 INFO L226 Difference]: Without dead ends: 2119 [2023-12-02 15:17:52,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:17:52,911 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 322 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:52,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 310 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:17:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2023-12-02 15:17:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1665. [2023-12-02 15:17:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1233 states have (on average 1.275750202757502) internal successors, (1573), 1237 states have internal predecessors, (1573), 261 states have call successors, (261), 171 states have call predecessors, (261), 170 states have return successors, (258), 257 states have call predecessors, (258), 258 states have call successors, (258) [2023-12-02 15:17:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2092 transitions. [2023-12-02 15:17:53,083 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2092 transitions. Word has length 49 [2023-12-02 15:17:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:53,084 INFO L495 AbstractCegarLoop]: Abstraction has 1665 states and 2092 transitions. [2023-12-02 15:17:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2092 transitions. [2023-12-02 15:17:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 15:17:53,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:53,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:53,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 15:17:53,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:53,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash -733787936, now seen corresponding path program 1 times [2023-12-02 15:17:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:53,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893984588] [2023-12-02 15:17:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:53,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 15:17:53,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893984588] [2023-12-02 15:17:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893984588] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 15:17:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393432897] [2023-12-02 15:17:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:53,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:17:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:17:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:17:53,244 INFO L87 Difference]: Start difference. First operand 1665 states and 2092 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:53,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:53,724 INFO L93 Difference]: Finished difference Result 4584 states and 5687 transitions. [2023-12-02 15:17:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:17:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2023-12-02 15:17:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:53,742 INFO L225 Difference]: With dead ends: 4584 [2023-12-02 15:17:53,742 INFO L226 Difference]: Without dead ends: 2925 [2023-12-02 15:17:53,746 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 15:17:53,747 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 205 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:53,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 240 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:17:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2023-12-02 15:17:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2759. [2023-12-02 15:17:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 1967 states have (on average 1.224707676664972) internal successors, (2409), 1970 states have internal predecessors, (2409), 483 states have call successors, (483), 309 states have call predecessors, (483), 308 states have return successors, (480), 480 states have call predecessors, (480), 480 states have call successors, (480) [2023-12-02 15:17:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3372 transitions. [2023-12-02 15:17:54,069 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3372 transitions. Word has length 50 [2023-12-02 15:17:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:54,069 INFO L495 AbstractCegarLoop]: Abstraction has 2759 states and 3372 transitions. [2023-12-02 15:17:54,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3372 transitions. [2023-12-02 15:17:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 15:17:54,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:54,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:54,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 15:17:54,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:54,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:54,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1003288052, now seen corresponding path program 1 times [2023-12-02 15:17:54,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:54,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396898115] [2023-12-02 15:17:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 15:17:54,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396898115] [2023-12-02 15:17:54,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396898115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:54,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:17:54,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:17:54,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057476458] [2023-12-02 15:17:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:54,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:17:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:17:54,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:17:54,130 INFO L87 Difference]: Start difference. First operand 2759 states and 3372 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:54,619 INFO L93 Difference]: Finished difference Result 6287 states and 7664 transitions. [2023-12-02 15:17:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:17:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 52 [2023-12-02 15:17:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:54,641 INFO L225 Difference]: With dead ends: 6287 [2023-12-02 15:17:54,641 INFO L226 Difference]: Without dead ends: 3534 [2023-12-02 15:17:54,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:17:54,649 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 369 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 290 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 15:17:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2023-12-02 15:17:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 2943. [2023-12-02 15:17:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2123 states have (on average 1.2317475270843146) internal successors, (2615), 2126 states have internal predecessors, (2615), 497 states have call successors, (497), 323 states have call predecessors, (497), 322 states have return successors, (494), 494 states have call predecessors, (494), 494 states have call successors, (494) [2023-12-02 15:17:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 3606 transitions. [2023-12-02 15:17:54,921 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 3606 transitions. Word has length 52 [2023-12-02 15:17:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:54,921 INFO L495 AbstractCegarLoop]: Abstraction has 2943 states and 3606 transitions. [2023-12-02 15:17:54,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-02 15:17:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 3606 transitions. [2023-12-02 15:17:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 15:17:54,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:54,924 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 15:17:54,924 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:54,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1523342494, now seen corresponding path program 1 times [2023-12-02 15:17:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:54,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215138653] [2023-12-02 15:17:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:54,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 15:17:55,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215138653] [2023-12-02 15:17:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215138653] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:17:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669512398] [2023-12-02 15:17:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:17:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:17:55,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:17:55,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 15:17:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:55,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:17:55,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:17:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-02 15:17:55,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:17:55,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669512398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:17:55,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:17:55,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [13] total 14 [2023-12-02 15:17:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915516471] [2023-12-02 15:17:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:17:55,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:17:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:17:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:17:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:17:55,470 INFO L87 Difference]: Start difference. First operand 2943 states and 3606 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:17:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:17:55,960 INFO L93 Difference]: Finished difference Result 7897 states and 9696 transitions. [2023-12-02 15:17:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:17:55,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2023-12-02 15:17:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:17:55,994 INFO L225 Difference]: With dead ends: 7897 [2023-12-02 15:17:55,995 INFO L226 Difference]: Without dead ends: 5768 [2023-12-02 15:17:56,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:17:56,003 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 49 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:17:56,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:17:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2023-12-02 15:17:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5567. [2023-12-02 15:17:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 4049 states have (on average 1.2269696221289208) internal successors, (4968), 4052 states have internal predecessors, (4968), 896 states have call successors, (896), 622 states have call predecessors, (896), 621 states have return successors, (893), 893 states have call predecessors, (893), 893 states have call successors, (893) [2023-12-02 15:17:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 6757 transitions. [2023-12-02 15:17:56,658 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 6757 transitions. Word has length 88 [2023-12-02 15:17:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:17:56,659 INFO L495 AbstractCegarLoop]: Abstraction has 5567 states and 6757 transitions. [2023-12-02 15:17:56,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:17:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 6757 transitions. [2023-12-02 15:17:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-02 15:17:56,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:17:56,663 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:17:56,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:17:56,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-02 15:17:56,863 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:17:56,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:17:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash -119719694, now seen corresponding path program 1 times [2023-12-02 15:17:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:17:56,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678384478] [2023-12-02 15:17:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:17:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 15:17:57,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:17:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678384478] [2023-12-02 15:17:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678384478] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:17:57,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242935771] [2023-12-02 15:17:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:17:57,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:17:57,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:17:57,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:17:57,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 15:17:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:17:57,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 15:17:57,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:17:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 15:17:57,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:17:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 15:17:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242935771] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:17:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [957412658] [2023-12-02 15:17:57,703 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2023-12-02 15:17:57,703 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:17:57,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:17:57,710 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:17:57,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:18:00,740 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 57 for LOIs [2023-12-02 15:18:00,751 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 68 for LOIs [2023-12-02 15:18:00,816 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 72 for LOIs [2023-12-02 15:18:00,888 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 72 for LOIs [2023-12-02 15:18:00,959 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 50 for LOIs [2023-12-02 15:18:01,068 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 79 for LOIs [2023-12-02 15:18:01,235 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:18:05,156 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '64007#(and (<= 1 |#StackHeapBarrier|) (<= 0 ~data_0~0) (= ~i~0 0) (= ~e~0 0) (= ~P_1_ev~0 0) (= ~P_1_st~0 1) (= ~C_1_pr~0 0) (exists ((|v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| Int)) (and (not (= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| 0)) (<= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1| 1) (<= 0 |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_1|))) (= ~max_loop~0 2) (= ~P_1_i~0 1) (= ~C_1_pc~0 0) (exists ((|v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| Int)) (and (<= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 2147483647) (not (= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 0)) (<= 0 (+ |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_1| 2147483648)))) (<= 0 ~P_1_pc~0) (not (= ~num~0 0)) (<= 0 ~num~0) (= ~C_1_ev~0 0) (= ~data_1~0 0) (not (= ~num~0 1)) (= ~timer~0 0) (= ~C_1_i~0 1))' at error location [2023-12-02 15:18:05,157 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:18:05,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:18:05,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 5] total 16 [2023-12-02 15:18:05,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365972947] [2023-12-02 15:18:05,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:18:05,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 15:18:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:05,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 15:18:05,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=2045, Unknown=0, NotChecked=0, Total=2256 [2023-12-02 15:18:05,160 INFO L87 Difference]: Start difference. First operand 5567 states and 6757 transitions. Second operand has 16 states, 14 states have (on average 8.071428571428571) internal successors, (113), 15 states have internal predecessors, (113), 7 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-02 15:18:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:08,025 INFO L93 Difference]: Finished difference Result 13239 states and 16283 transitions. [2023-12-02 15:18:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-02 15:18:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.071428571428571) internal successors, (113), 15 states have internal predecessors, (113), 7 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) Word has length 89 [2023-12-02 15:18:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:08,069 INFO L225 Difference]: With dead ends: 13239 [2023-12-02 15:18:08,069 INFO L226 Difference]: Without dead ends: 7678 [2023-12-02 15:18:08,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 236 SyntacticMatches, 9 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1040, Invalid=13240, Unknown=0, NotChecked=0, Total=14280 [2023-12-02 15:18:08,089 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 689 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:08,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 1935 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 15:18:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7678 states. [2023-12-02 15:18:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7678 to 6670. [2023-12-02 15:18:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 4866 states have (on average 1.223181257706535) internal successors, (5952), 4869 states have internal predecessors, (5952), 1059 states have call successors, (1059), 745 states have call predecessors, (1059), 744 states have return successors, (1056), 1056 states have call predecessors, (1056), 1056 states have call successors, (1056) [2023-12-02 15:18:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 8067 transitions. [2023-12-02 15:18:08,787 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 8067 transitions. Word has length 89 [2023-12-02 15:18:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:08,788 INFO L495 AbstractCegarLoop]: Abstraction has 6670 states and 8067 transitions. [2023-12-02 15:18:08,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.071428571428571) internal successors, (113), 15 states have internal predecessors, (113), 7 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (37), 7 states have call predecessors, (37), 7 states have call successors, (37) [2023-12-02 15:18:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 8067 transitions. [2023-12-02 15:18:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 15:18:08,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:08,792 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:08,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 15:18:08,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:08,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:08,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1369158781, now seen corresponding path program 1 times [2023-12-02 15:18:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654482652] [2023-12-02 15:18:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 15:18:09,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654482652] [2023-12-02 15:18:09,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654482652] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:09,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669578810] [2023-12-02 15:18:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:09,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:09,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:09,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 15:18:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:09,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:18:09,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 15:18:09,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669578810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:18:09,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2023-12-02 15:18:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566656554] [2023-12-02 15:18:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:18:09,487 INFO L87 Difference]: Start difference. First operand 6670 states and 8067 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:09,910 INFO L93 Difference]: Finished difference Result 13139 states and 15943 transitions. [2023-12-02 15:18:09,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:09,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2023-12-02 15:18:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:09,965 INFO L225 Difference]: With dead ends: 13139 [2023-12-02 15:18:09,965 INFO L226 Difference]: Without dead ends: 6670 [2023-12-02 15:18:09,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:18:09,978 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:09,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 82 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:18:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2023-12-02 15:18:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2023-12-02 15:18:10,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 4866 states have (on average 1.2166050143855323) internal successors, (5920), 4869 states have internal predecessors, (5920), 1059 states have call successors, (1059), 745 states have call predecessors, (1059), 744 states have return successors, (1056), 1056 states have call predecessors, (1056), 1056 states have call successors, (1056) [2023-12-02 15:18:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 8035 transitions. [2023-12-02 15:18:10,449 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 8035 transitions. Word has length 90 [2023-12-02 15:18:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 6670 states and 8035 transitions. [2023-12-02 15:18:10,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 8035 transitions. [2023-12-02 15:18:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 15:18:10,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:10,452 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:10,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 15:18:10,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:10,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:10,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1219780671, now seen corresponding path program 1 times [2023-12-02 15:18:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336944712] [2023-12-02 15:18:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 15:18:10,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336944712] [2023-12-02 15:18:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336944712] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225053867] [2023-12-02 15:18:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:10,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:10,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:10,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:10,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 15:18:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:10,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:18:10,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:18:11,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225053867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:18:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2023-12-02 15:18:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041640923] [2023-12-02 15:18:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:11,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:11,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:11,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:11,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:18:11,032 INFO L87 Difference]: Start difference. First operand 6670 states and 8035 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 15:18:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:11,445 INFO L93 Difference]: Finished difference Result 12574 states and 15195 transitions. [2023-12-02 15:18:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 91 [2023-12-02 15:18:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:11,467 INFO L225 Difference]: With dead ends: 12574 [2023-12-02 15:18:11,467 INFO L226 Difference]: Without dead ends: 6105 [2023-12-02 15:18:11,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-02 15:18:11,481 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:11,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 211 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:18:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2023-12-02 15:18:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 6045. [2023-12-02 15:18:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6045 states, 4413 states have (on average 1.2021300702469975) internal successors, (5305), 4416 states have internal predecessors, (5305), 959 states have call successors, (959), 673 states have call predecessors, (959), 672 states have return successors, (956), 956 states have call predecessors, (956), 956 states have call successors, (956) [2023-12-02 15:18:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6045 states to 6045 states and 7220 transitions. [2023-12-02 15:18:11,872 INFO L78 Accepts]: Start accepts. Automaton has 6045 states and 7220 transitions. Word has length 91 [2023-12-02 15:18:11,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:11,872 INFO L495 AbstractCegarLoop]: Abstraction has 6045 states and 7220 transitions. [2023-12-02 15:18:11,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 15:18:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 6045 states and 7220 transitions. [2023-12-02 15:18:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 15:18:11,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:11,875 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:11,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 15:18:12,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:12,076 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:12,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1044037383, now seen corresponding path program 1 times [2023-12-02 15:18:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831677539] [2023-12-02 15:18:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 15:18:12,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831677539] [2023-12-02 15:18:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831677539] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814079393] [2023-12-02 15:18:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:12,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:12,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:12,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:12,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 15:18:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:12,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 15:18:12,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:18:12,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814079393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:18:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2023-12-02 15:18:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118765173] [2023-12-02 15:18:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:12,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 15:18:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 15:18:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-02 15:18:12,486 INFO L87 Difference]: Start difference. First operand 6045 states and 7220 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 15:18:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:12,927 INFO L93 Difference]: Finished difference Result 11119 states and 13502 transitions. [2023-12-02 15:18:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 15:18:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 92 [2023-12-02 15:18:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:12,942 INFO L225 Difference]: With dead ends: 11119 [2023-12-02 15:18:12,942 INFO L226 Difference]: Without dead ends: 5080 [2023-12-02 15:18:12,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-02 15:18:12,953 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 74 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:12,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 607 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2023-12-02 15:18:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 4155. [2023-12-02 15:18:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3141 states have (on average 1.224769181789239) internal successors, (3847), 3144 states have internal predecessors, (3847), 582 states have call successors, (582), 432 states have call predecessors, (582), 431 states have return successors, (579), 579 states have call predecessors, (579), 579 states have call successors, (579) [2023-12-02 15:18:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5008 transitions. [2023-12-02 15:18:13,297 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5008 transitions. Word has length 92 [2023-12-02 15:18:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:13,298 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5008 transitions. [2023-12-02 15:18:13,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-02 15:18:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5008 transitions. [2023-12-02 15:18:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 15:18:13,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:13,302 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:13,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 15:18:13,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:13,503 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:13,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash 130755016, now seen corresponding path program 1 times [2023-12-02 15:18:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000350297] [2023-12-02 15:18:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-12-02 15:18:13,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:13,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000350297] [2023-12-02 15:18:13,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000350297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:13,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:18:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633252169] [2023-12-02 15:18:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:13,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:18:13,586 INFO L87 Difference]: Start difference. First operand 4155 states and 5008 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:13,957 INFO L93 Difference]: Finished difference Result 7456 states and 8990 transitions. [2023-12-02 15:18:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-12-02 15:18:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:13,966 INFO L225 Difference]: With dead ends: 7456 [2023-12-02 15:18:13,967 INFO L226 Difference]: Without dead ends: 3381 [2023-12-02 15:18:13,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 15:18:13,974 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:13,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 168 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:18:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2023-12-02 15:18:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3367. [2023-12-02 15:18:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 2555 states have (on average 1.2230919765166341) internal successors, (3125), 2558 states have internal predecessors, (3125), 466 states have call successors, (466), 346 states have call predecessors, (466), 345 states have return successors, (463), 463 states have call predecessors, (463), 463 states have call successors, (463) [2023-12-02 15:18:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4054 transitions. [2023-12-02 15:18:14,287 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4054 transitions. Word has length 93 [2023-12-02 15:18:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:14,288 INFO L495 AbstractCegarLoop]: Abstraction has 3367 states and 4054 transitions. [2023-12-02 15:18:14,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4054 transitions. [2023-12-02 15:18:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 15:18:14,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:14,290 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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] [2023-12-02 15:18:14,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 15:18:14,290 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:14,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 378933650, now seen corresponding path program 1 times [2023-12-02 15:18:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489067744] [2023-12-02 15:18:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-02 15:18:14,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489067744] [2023-12-02 15:18:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489067744] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:14,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629821877] [2023-12-02 15:18:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:14,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:14,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:14,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 15:18:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:14,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:18:14,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 15:18:14,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:18:14,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629821877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:14,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 15:18:14,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2023-12-02 15:18:14,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172666423] [2023-12-02 15:18:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:14,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:18:14,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:18:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:18:14,533 INFO L87 Difference]: Start difference. First operand 3367 states and 4054 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:14,818 INFO L93 Difference]: Finished difference Result 6605 states and 7974 transitions. [2023-12-02 15:18:14,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:18:14,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-02 15:18:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:14,828 INFO L225 Difference]: With dead ends: 6605 [2023-12-02 15:18:14,828 INFO L226 Difference]: Without dead ends: 3372 [2023-12-02 15:18:14,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:18:14,835 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:14,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 170 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:18:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2023-12-02 15:18:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3367. [2023-12-02 15:18:15,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 2555 states have (on average 1.2176125244618394) internal successors, (3111), 2558 states have internal predecessors, (3111), 466 states have call successors, (466), 346 states have call predecessors, (466), 345 states have return successors, (463), 463 states have call predecessors, (463), 463 states have call successors, (463) [2023-12-02 15:18:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 4040 transitions. [2023-12-02 15:18:15,184 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 4040 transitions. Word has length 98 [2023-12-02 15:18:15,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:15,184 INFO L495 AbstractCegarLoop]: Abstraction has 3367 states and 4040 transitions. [2023-12-02 15:18:15,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 4040 transitions. [2023-12-02 15:18:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 15:18:15,187 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:15,187 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:15,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 15:18:15,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 15:18:15,388 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:15,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1277880514, now seen corresponding path program 1 times [2023-12-02 15:18:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:15,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516825466] [2023-12-02 15:18:15,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:15,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 15:18:15,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516825466] [2023-12-02 15:18:15,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516825466] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:18:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:18:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:18:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741488686] [2023-12-02 15:18:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:15,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:18:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:15,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:18:15,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:18:15,472 INFO L87 Difference]: Start difference. First operand 3367 states and 4040 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:15,800 INFO L93 Difference]: Finished difference Result 6332 states and 7608 transitions. [2023-12-02 15:18:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 15:18:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2023-12-02 15:18:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:15,811 INFO L225 Difference]: With dead ends: 6332 [2023-12-02 15:18:15,811 INFO L226 Difference]: Without dead ends: 3663 [2023-12-02 15:18:15,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 15:18:15,817 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 62 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:15,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 263 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2023-12-02 15:18:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3641. [2023-12-02 15:18:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3641 states, 2759 states have (on average 1.2094961942732874) internal successors, (3337), 2762 states have internal predecessors, (3337), 506 states have call successors, (506), 376 states have call predecessors, (506), 375 states have return successors, (503), 503 states have call predecessors, (503), 503 states have call successors, (503) [2023-12-02 15:18:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 4346 transitions. [2023-12-02 15:18:16,147 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 4346 transitions. Word has length 99 [2023-12-02 15:18:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:16,148 INFO L495 AbstractCegarLoop]: Abstraction has 3641 states and 4346 transitions. [2023-12-02 15:18:16,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-02 15:18:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 4346 transitions. [2023-12-02 15:18:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-02 15:18:16,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:16,151 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:16,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 15:18:16,151 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:16,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash 569455025, now seen corresponding path program 1 times [2023-12-02 15:18:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487689541] [2023-12-02 15:18:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 15:18:16,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487689541] [2023-12-02 15:18:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487689541] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234192363] [2023-12-02 15:18:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:16,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:16,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 15:18:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:16,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:18:16,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 15:18:16,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:18:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-02 15:18:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234192363] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:18:16,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [762232291] [2023-12-02 15:18:16,605 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2023-12-02 15:18:16,606 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:18:16,606 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:18:16,607 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:18:16,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:18:21,069 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 13 for LOIs [2023-12-02 15:18:21,071 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 11 for LOIs [2023-12-02 15:18:21,072 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 73 for LOIs [2023-12-02 15:18:21,103 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 11 for LOIs [2023-12-02 15:18:21,105 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 11 for LOIs [2023-12-02 15:18:21,111 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 80 for LOIs [2023-12-02 15:18:21,372 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:18:23,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '206140#(and (= ~C_1_pc~0 1) (= (+ ~num~0 1) 0) (<= ~timer~0 1) (<= 0 ~timer~0) (= ~C_1_st~0 1))' at error location [2023-12-02 15:18:23,857 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:18:23,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:18:23,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 4] total 11 [2023-12-02 15:18:23,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076968803] [2023-12-02 15:18:23,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:18:23,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:18:23,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:23,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:18:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2014, Unknown=0, NotChecked=0, Total=2256 [2023-12-02 15:18:23,860 INFO L87 Difference]: Start difference. First operand 3641 states and 4346 transitions. Second operand has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 8 states have call successors, (39), 5 states have call predecessors, (39), 6 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2023-12-02 15:18:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:24,669 INFO L93 Difference]: Finished difference Result 6007 states and 7258 transitions. [2023-12-02 15:18:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 15:18:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 8 states have call successors, (39), 5 states have call predecessors, (39), 6 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) Word has length 102 [2023-12-02 15:18:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:24,676 INFO L225 Difference]: With dead ends: 6007 [2023-12-02 15:18:24,677 INFO L226 Difference]: Without dead ends: 2500 [2023-12-02 15:18:24,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 279 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=520, Invalid=4736, Unknown=0, NotChecked=0, Total=5256 [2023-12-02 15:18:24,685 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 571 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:24,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 601 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 15:18:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2023-12-02 15:18:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 1799. [2023-12-02 15:18:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1323 states have (on average 1.180650037792895) internal successors, (1562), 1331 states have internal predecessors, (1562), 276 states have call successors, (276), 194 states have call predecessors, (276), 199 states have return successors, (298), 274 states have call predecessors, (298), 274 states have call successors, (298) [2023-12-02 15:18:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2136 transitions. [2023-12-02 15:18:24,824 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2136 transitions. Word has length 102 [2023-12-02 15:18:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:24,824 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2136 transitions. [2023-12-02 15:18:24,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.363636363636363) internal successors, (147), 11 states have internal predecessors, (147), 8 states have call successors, (39), 5 states have call predecessors, (39), 6 states have return successors, (38), 8 states have call predecessors, (38), 8 states have call successors, (38) [2023-12-02 15:18:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2136 transitions. [2023-12-02 15:18:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-02 15:18:24,827 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:24,827 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:24,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 15:18:25,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:25,028 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:25,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 140428513, now seen corresponding path program 1 times [2023-12-02 15:18:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:25,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082790910] [2023-12-02 15:18:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 88 proven. 17 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2023-12-02 15:18:25,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082790910] [2023-12-02 15:18:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082790910] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172712107] [2023-12-02 15:18:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:25,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:25,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:25,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 15:18:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:25,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 15:18:25,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-02 15:18:25,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:18:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 91 proven. 11 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-12-02 15:18:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172712107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:18:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1022925613] [2023-12-02 15:18:25,531 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2023-12-02 15:18:25,531 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 15:18:25,532 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 15:18:25,532 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 15:18:25,532 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 15:18:29,706 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 34 for LOIs [2023-12-02 15:18:29,709 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 70 for LOIs [2023-12-02 15:18:29,728 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 71 for LOIs [2023-12-02 15:18:29,749 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 71 for LOIs [2023-12-02 15:18:29,769 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 6 for LOIs [2023-12-02 15:18:29,772 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 78 for LOIs [2023-12-02 15:18:29,857 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 15:18:33,564 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '217617#(and (<= ~P_1_pc~0 1) (exists ((|v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_17| Int)) (and (<= 0 |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_17|) (not (= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_17| 0)) (<= |v_ULTIMATE.start_eval_~tmp___2~0#1_BEFORE_CALL_17| 1))) (exists ((|v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_16| Int)) (and (<= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_16| 2147483647) (<= 0 (+ |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_16| 2147483648)) (not (= |v_ULTIMATE.start_eval_~tmp~0#1_BEFORE_CALL_16| 0)))) (<= (+ ~i~0 1) ~max_loop~0) (= ~P_1_st~0 1) (<= 0 ~P_1_pc~0) (not (= ~num~0 0)) (not (= ~num~0 1)))' at error location [2023-12-02 15:18:33,564 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 15:18:33,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:18:33,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2023-12-02 15:18:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663366035] [2023-12-02 15:18:33,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:18:33,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:18:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:33,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:18:33,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2384, Unknown=0, NotChecked=0, Total=2652 [2023-12-02 15:18:33,567 INFO L87 Difference]: Start difference. First operand 1799 states and 2136 transitions. Second operand has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (41), 7 states have call predecessors, (41), 8 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-12-02 15:18:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:34,305 INFO L93 Difference]: Finished difference Result 5104 states and 6278 transitions. [2023-12-02 15:18:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-02 15:18:34,306 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (41), 7 states have call predecessors, (41), 8 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) Word has length 158 [2023-12-02 15:18:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:34,313 INFO L225 Difference]: With dead ends: 5104 [2023-12-02 15:18:34,313 INFO L226 Difference]: Without dead ends: 3722 [2023-12-02 15:18:34,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=438, Invalid=4254, Unknown=0, NotChecked=0, Total=4692 [2023-12-02 15:18:34,318 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 366 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:34,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 567 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 15:18:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2023-12-02 15:18:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 2556. [2023-12-02 15:18:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 1826 states have (on average 1.1631982475355969) internal successors, (2124), 1884 states have internal predecessors, (2124), 415 states have call successors, (415), 276 states have call predecessors, (415), 314 states have return successors, (593), 396 states have call predecessors, (593), 413 states have call successors, (593) [2023-12-02 15:18:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3132 transitions. [2023-12-02 15:18:34,574 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3132 transitions. Word has length 158 [2023-12-02 15:18:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:34,575 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3132 transitions. [2023-12-02 15:18:34,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.909090909090908) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (41), 7 states have call predecessors, (41), 8 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-12-02 15:18:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3132 transitions. [2023-12-02 15:18:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-02 15:18:34,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:34,581 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:18:34,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 15:18:34,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:34,787 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:34,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash 55952499, now seen corresponding path program 1 times [2023-12-02 15:18:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884174761] [2023-12-02 15:18:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 84 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 15:18:34,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:18:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884174761] [2023-12-02 15:18:34,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884174761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407037811] [2023-12-02 15:18:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:18:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:18:34,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:18:34,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 15:18:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:18:35,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 15:18:35,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:18:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 15:18:35,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:18:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-02 15:18:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407037811] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 15:18:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 15:18:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 7 [2023-12-02 15:18:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076189121] [2023-12-02 15:18:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:18:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:18:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:18:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:18:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:18:35,230 INFO L87 Difference]: Start difference. First operand 2556 states and 3132 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-02 15:18:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:18:35,553 INFO L93 Difference]: Finished difference Result 4965 states and 6130 transitions. [2023-12-02 15:18:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:18:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 169 [2023-12-02 15:18:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:18:35,557 INFO L225 Difference]: With dead ends: 4965 [2023-12-02 15:18:35,557 INFO L226 Difference]: Without dead ends: 2670 [2023-12-02 15:18:35,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 15:18:35,562 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 15:18:35,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 154 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 15:18:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2023-12-02 15:18:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2526. [2023-12-02 15:18:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 1832 states have (on average 1.1381004366812226) internal successors, (2085), 1868 states have internal predecessors, (2085), 385 states have call successors, (385), 291 states have call predecessors, (385), 308 states have return successors, (419), 367 states have call predecessors, (419), 383 states have call successors, (419) [2023-12-02 15:18:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 2889 transitions. [2023-12-02 15:18:35,753 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 2889 transitions. Word has length 169 [2023-12-02 15:18:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:18:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 2526 states and 2889 transitions. [2023-12-02 15:18:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-02 15:18:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 2889 transitions. [2023-12-02 15:18:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-02 15:18:35,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:18:35,758 INFO L195 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-02 15:18:35,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 15:18:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 15:18:35,959 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:18:35,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:18:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1877899295, now seen corresponding path program 1 times [2023-12-02 15:18:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:18:35,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47051676] [2023-12-02 15:18:35,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:18:35,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:18:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:18:36,014 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:18:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:18:36,095 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:18:36,095 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:18:36,096 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:18:36,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 15:18:36,101 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] [2023-12-02 15:18:36,105 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:18:36,165 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,176 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:18:36,180 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:18:36,181 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,183 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,186 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:18:36,188 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:18:36,189 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:18:36 BoogieIcfgContainer [2023-12-02 15:18:36,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:18:36,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:18:36,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:18:36,224 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:18:36,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:49" (3/4) ... [2023-12-02 15:18:36,225 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 15:18:36,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,254 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,257 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:18:36,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:18:36,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,260 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-12-02 15:18:36,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-12-02 15:18:36,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-12-02 15:18:36,358 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 15:18:36,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:18:36,359 INFO L158 Benchmark]: Toolchain (without parser) took 48100.87ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 116.5MB in the beginning and 962.7MB in the end (delta: -846.1MB). Peak memory consumption was 475.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,359 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:18:36,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.05ms. Allocated memory is still 155.2MB. Free memory was 116.5MB in the beginning and 103.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.83ms. Allocated memory is still 155.2MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,360 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 155.2MB. Free memory was 100.5MB in the beginning and 99.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,360 INFO L158 Benchmark]: RCFGBuilder took 549.16ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 103.9MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,361 INFO L158 Benchmark]: TraceAbstraction took 47039.22ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 103.2MB in the beginning and 979.4MB in the end (delta: -876.3MB). Peak memory consumption was 445.7MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,361 INFO L158 Benchmark]: Witness Printer took 134.56ms. Allocated memory is still 1.5GB. Free memory was 979.4MB in the beginning and 962.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 15:18:36,363 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.19ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.05ms. Allocated memory is still 155.2MB. Free memory was 116.5MB in the beginning and 103.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.83ms. Allocated memory is still 155.2MB. Free memory was 102.6MB in the beginning and 100.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 155.2MB. Free memory was 100.5MB in the beginning and 99.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 549.16ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 103.9MB in the end (delta: -4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 47039.22ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 103.2MB in the beginning and 979.4MB in the end (delta: -876.3MB). Peak memory consumption was 445.7MB. Max. memory is 16.1GB. * Witness Printer took 134.56ms. Allocated memory is still 1.5GB. Free memory was 979.4MB in the beginning and 962.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, kernel_st=0, max_loop=2, num=0, timer=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0, tmp=0, tmp___2=1] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1, tmp=0, tmp___1=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, \old(c)=65, \old(i___0)=0, c=65, data_0=65, data_1=0, e=0, i=1, i___0=0, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp=1, tmp___1=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=2, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, kernel_st=3, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, kernel_st=4, max_loop=2, num=1, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp=1, tmp___2=0] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=2, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND FALSE !((int )P_1_st == 0) [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 [L268] return (__retres1); [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, kernel_st=3, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 [L427] return (__retres2); [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, kernel_st=4, max_loop=2, num=2, timer=1, tmp=0, tmp___0=0] [L445] COND TRUE 1 [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L279] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 [L268] return (__retres1); [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1, tmp___2=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, \old(c)=65, \old(i___0)=2, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.9s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4400 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4337 mSDsluCounter, 7774 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5261 mSDsCounter, 954 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4925 IncrementalHoareTripleChecker+Invalid, 5879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 954 mSolverCounterUnsat, 2513 mSDtfsCounter, 4925 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2181 GetRequests, 1800 SyntacticMatches, 14 SemanticMatches, 367 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9675 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6670occurred in iteration=12, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 5733 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3056 ConstructedInterpolants, 0 QuantifiedInterpolants, 6362 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3075 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 34 InterpolantComputations, 18 PerfectInterpolantSequences, 2339/2556 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 15:18:36,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ecdad9bb-601c-472a-a27e-2225a220578a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE