./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:53:28,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:53:28,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:53:28,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:53:28,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:53:28,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:53:28,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:53:28,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:53:28,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:53:28,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:53:28,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:53:28,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:53:28,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:53:28,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:53:28,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:53:28,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:53:28,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:53:28,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:53:28,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:53:28,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:53:28,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:53:28,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:53:28,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:53:28,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:53:28,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:53:28,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:53:28,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:53:28,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:53:28,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:53:28,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:53:28,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:53:28,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:53:28,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:53:28,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:53:28,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:53:28,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:53:28,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:53:28,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:53:28,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:53:28,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:53:28,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:53:28,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:53:28,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:53:28,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:53:28,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:53:28,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:53:28,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:53:28,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:53:28,435 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:53:28,435 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:53:28,436 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:53:28,436 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:53:28,437 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:53:28,437 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:53:28,438 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:53:28,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:53:28,438 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:53:28,438 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:53:28,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:53:28,439 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:53:28,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:53:28,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:53:28,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:53:28,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:53:28,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:53:28,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:53:28,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:53:28,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:53:28,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:53:28,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:53:28,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:53:28,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:53:28,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:53:28,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:53:28,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:28,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:53:28,443 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:53:28,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:53:28,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:53:28,444 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:53:28,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:53:28,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:53:28,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:53:28,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/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_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2022-11-03 01:53:28,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:53:28,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:53:28,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:53:28,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:53:28,817 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:53:28,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-11-03 01:53:28,919 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/data/c5495572b/0fb16f9c2424471286b69a4f6d00d692/FLAG6a19fb655 [2022-11-03 01:53:29,424 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:53:29,430 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-11-03 01:53:29,442 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/data/c5495572b/0fb16f9c2424471286b69a4f6d00d692/FLAG6a19fb655 [2022-11-03 01:53:29,753 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/data/c5495572b/0fb16f9c2424471286b69a4f6d00d692 [2022-11-03 01:53:29,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:53:29,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:53:29,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:29,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:53:29,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:53:29,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:29" (1/1) ... [2022-11-03 01:53:29,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f519d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:29, skipping insertion in model container [2022-11-03 01:53:29,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:53:29" (1/1) ... [2022-11-03 01:53:29,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:53:29,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:53:29,988 WARN L230 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_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-11-03 01:53:30,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:30,122 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:53:30,136 WARN L230 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_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-11-03 01:53:30,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:53:30,190 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:53:30,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30 WrapperNode [2022-11-03 01:53:30,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:53:30,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:30,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:53:30,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:53:30,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,237 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 321 [2022-11-03 01:53:30,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:53:30,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:53:30,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:53:30,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:53:30,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,267 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:53:30,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:53:30,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:53:30,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:53:30,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (1/1) ... [2022-11-03 01:53:30,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:53:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:30,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:53:30,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:53:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:53:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-03 01:53:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-03 01:53:30,421 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-03 01:53:30,421 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-03 01:53:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 01:53:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 01:53:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-03 01:53:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-03 01:53:30,422 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-03 01:53:30,422 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-03 01:53:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:53:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-03 01:53:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-03 01:53:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:53:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:53:30,508 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:53:30,511 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:53:31,054 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:53:31,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:53:31,268 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-03 01:53:31,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:31 BoogieIcfgContainer [2022-11-03 01:53:31,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:53:31,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:53:31,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:53:31,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:53:31,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:53:29" (1/3) ... [2022-11-03 01:53:31,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee23b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:31, skipping insertion in model container [2022-11-03 01:53:31,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:53:30" (2/3) ... [2022-11-03 01:53:31,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee23b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:53:31, skipping insertion in model container [2022-11-03 01:53:31,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:31" (3/3) ... [2022-11-03 01:53:31,286 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2022-11-03 01:53:31,315 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:53:31,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:53:31,389 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:53:31,401 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=LoopsAndPotentialCycles, 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;@44f27601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:53:31,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:53:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-03 01:53:31,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 01:53:31,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:31,427 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] [2022-11-03 01:53:31,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 199495985, now seen corresponding path program 1 times [2022-11-03 01:53:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:31,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401805399] [2022-11-03 01:53:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:31,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:31,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:31,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401805399] [2022-11-03 01:53:31,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401805399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:31,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:31,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315411734] [2022-11-03 01:53:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:31,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:31,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:31,891 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:32,293 INFO L93 Difference]: Finished difference Result 244 states and 365 transitions. [2022-11-03 01:53:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:32,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-03 01:53:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:32,317 INFO L225 Difference]: With dead ends: 244 [2022-11-03 01:53:32,317 INFO L226 Difference]: Without dead ends: 158 [2022-11-03 01:53:32,324 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 [2022-11-03 01:53:32,329 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 202 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:32,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 294 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:32,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-03 01:53:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2022-11-03 01:53:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 115 states have (on average 1.391304347826087) internal successors, (160), 116 states have internal predecessors, (160), 27 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-03 01:53:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 214 transitions. [2022-11-03 01:53:32,409 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 214 transitions. Word has length 41 [2022-11-03 01:53:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:32,410 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 214 transitions. [2022-11-03 01:53:32,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 214 transitions. [2022-11-03 01:53:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 01:53:32,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:32,414 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] [2022-11-03 01:53:32,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:53:32,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:32,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1571974990, now seen corresponding path program 1 times [2022-11-03 01:53:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:32,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569761043] [2022-11-03 01:53:32,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:32,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569761043] [2022-11-03 01:53:32,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569761043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:32,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:32,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067574107] [2022-11-03 01:53:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:32,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:32,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:32,664 INFO L87 Difference]: Start difference. First operand 155 states and 214 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:33,139 INFO L93 Difference]: Finished difference Result 517 states and 715 transitions. [2022-11-03 01:53:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-03 01:53:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:33,157 INFO L225 Difference]: With dead ends: 517 [2022-11-03 01:53:33,158 INFO L226 Difference]: Without dead ends: 350 [2022-11-03 01:53:33,160 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 [2022-11-03 01:53:33,161 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 376 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:33,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 472 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:53:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-03 01:53:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 338. [2022-11-03 01:53:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 257 states have (on average 1.3852140077821011) internal successors, (356), 256 states have internal predecessors, (356), 52 states have call successors, (52), 26 states have call predecessors, (52), 28 states have return successors, (56), 56 states have call predecessors, (56), 52 states have call successors, (56) [2022-11-03 01:53:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 464 transitions. [2022-11-03 01:53:33,234 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 464 transitions. Word has length 41 [2022-11-03 01:53:33,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:33,235 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 464 transitions. [2022-11-03 01:53:33,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 464 transitions. [2022-11-03 01:53:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 01:53:33,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:33,237 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] [2022-11-03 01:53:33,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:53:33,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:33,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash 665388275, now seen corresponding path program 1 times [2022-11-03 01:53:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:33,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850204756] [2022-11-03 01:53:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:33,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:33,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850204756] [2022-11-03 01:53:33,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850204756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:33,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:33,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:33,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855571549] [2022-11-03 01:53:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:33,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:33,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:33,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:33,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:33,444 INFO L87 Difference]: Start difference. First operand 338 states and 464 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:33,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:33,936 INFO L93 Difference]: Finished difference Result 1157 states and 1606 transitions. [2022-11-03 01:53:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:33,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-03 01:53:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:33,942 INFO L225 Difference]: With dead ends: 1157 [2022-11-03 01:53:33,942 INFO L226 Difference]: Without dead ends: 793 [2022-11-03 01:53:33,946 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 [2022-11-03 01:53:33,958 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 378 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:33,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 385 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-11-03 01:53:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 625. [2022-11-03 01:53:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 472 states have (on average 1.3728813559322033) internal successors, (648), 472 states have internal predecessors, (648), 96 states have call successors, (96), 50 states have call predecessors, (96), 56 states have return successors, (109), 103 states have call predecessors, (109), 96 states have call successors, (109) [2022-11-03 01:53:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 853 transitions. [2022-11-03 01:53:34,032 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 853 transitions. Word has length 41 [2022-11-03 01:53:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:34,033 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 853 transitions. [2022-11-03 01:53:34,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 01:53:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 853 transitions. [2022-11-03 01:53:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-03 01:53:34,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:34,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:53:34,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash 867807089, now seen corresponding path program 1 times [2022-11-03 01:53:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354528883] [2022-11-03 01:53:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:53:34,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:34,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354528883] [2022-11-03 01:53:34,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354528883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:34,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:34,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:53:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101641915] [2022-11-03 01:53:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:34,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:34,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:34,318 INFO L87 Difference]: Start difference. First operand 625 states and 853 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:34,780 INFO L93 Difference]: Finished difference Result 1802 states and 2473 transitions. [2022-11-03 01:53:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2022-11-03 01:53:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:34,796 INFO L225 Difference]: With dead ends: 1802 [2022-11-03 01:53:34,796 INFO L226 Difference]: Without dead ends: 1183 [2022-11-03 01:53:34,799 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 [2022-11-03 01:53:34,811 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 325 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:34,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 324 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2022-11-03 01:53:34,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1023. [2022-11-03 01:53:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 780 states have (on average 1.3576923076923078) internal successors, (1059), 779 states have internal predecessors, (1059), 146 states have call successors, (146), 84 states have call predecessors, (146), 96 states have return successors, (172), 160 states have call predecessors, (172), 146 states have call successors, (172) [2022-11-03 01:53:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1377 transitions. [2022-11-03 01:53:34,963 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1377 transitions. Word has length 54 [2022-11-03 01:53:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:34,966 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1377 transitions. [2022-11-03 01:53:34,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1377 transitions. [2022-11-03 01:53:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-03 01:53:34,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:34,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:34,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:53:34,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 382878795, now seen corresponding path program 1 times [2022-11-03 01:53:34,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:34,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014562269] [2022-11-03 01:53:34,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:53:35,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:35,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014562269] [2022-11-03 01:53:35,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014562269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:35,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:35,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:53:35,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129460165] [2022-11-03 01:53:35,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:35,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:35,242 INFO L87 Difference]: Start difference. First operand 1023 states and 1377 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:35,795 INFO L93 Difference]: Finished difference Result 3361 states and 4536 transitions. [2022-11-03 01:53:35,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:35,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2022-11-03 01:53:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:35,812 INFO L225 Difference]: With dead ends: 3361 [2022-11-03 01:53:35,812 INFO L226 Difference]: Without dead ends: 2344 [2022-11-03 01:53:35,816 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 [2022-11-03 01:53:35,817 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 329 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:35,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 289 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2022-11-03 01:53:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1930. [2022-11-03 01:53:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1477 states have (on average 1.3412322274881516) internal successors, (1981), 1476 states have internal predecessors, (1981), 270 states have call successors, (270), 162 states have call predecessors, (270), 182 states have return successors, (312), 292 states have call predecessors, (312), 270 states have call successors, (312) [2022-11-03 01:53:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2563 transitions. [2022-11-03 01:53:36,085 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2563 transitions. Word has length 56 [2022-11-03 01:53:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:36,085 INFO L495 AbstractCegarLoop]: Abstraction has 1930 states and 2563 transitions. [2022-11-03 01:53:36,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2563 transitions. [2022-11-03 01:53:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 01:53:36,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:36,088 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:36,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:53:36,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:36,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1067192465, now seen corresponding path program 1 times [2022-11-03 01:53:36,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:36,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053605258] [2022-11-03 01:53:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:36,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 01:53:36,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:36,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053605258] [2022-11-03 01:53:36,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053605258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:36,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:36,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:53:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43946558] [2022-11-03 01:53:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:36,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:36,286 INFO L87 Difference]: Start difference. First operand 1930 states and 2563 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:36,928 INFO L93 Difference]: Finished difference Result 5080 states and 6771 transitions. [2022-11-03 01:53:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:36,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-11-03 01:53:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:36,945 INFO L225 Difference]: With dead ends: 5080 [2022-11-03 01:53:36,945 INFO L226 Difference]: Without dead ends: 3156 [2022-11-03 01:53:36,950 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 [2022-11-03 01:53:36,951 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 293 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:36,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 259 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2022-11-03 01:53:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2858. [2022-11-03 01:53:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2185 states have (on average 1.3249427917620138) internal successors, (2895), 2178 states have internal predecessors, (2895), 402 states have call successors, (402), 244 states have call predecessors, (402), 270 states have return successors, (456), 436 states have call predecessors, (456), 402 states have call successors, (456) [2022-11-03 01:53:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 3753 transitions. [2022-11-03 01:53:37,290 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 3753 transitions. Word has length 58 [2022-11-03 01:53:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:37,290 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 3753 transitions. [2022-11-03 01:53:37,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-03 01:53:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3753 transitions. [2022-11-03 01:53:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 01:53:37,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:37,293 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:53:37,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:53:37,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1438822483, now seen corresponding path program 1 times [2022-11-03 01:53:37,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:37,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389945998] [2022-11-03 01:53:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:37,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:37,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389945998] [2022-11-03 01:53:37,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389945998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:37,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:37,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:37,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049543142] [2022-11-03 01:53:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:37,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:37,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:37,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:37,350 INFO L87 Difference]: Start difference. First operand 2858 states and 3753 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:53:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:37,769 INFO L93 Difference]: Finished difference Result 5403 states and 7177 transitions. [2022-11-03 01:53:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:37,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-11-03 01:53:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:37,796 INFO L225 Difference]: With dead ends: 5403 [2022-11-03 01:53:37,796 INFO L226 Difference]: Without dead ends: 3765 [2022-11-03 01:53:37,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:37,803 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 63 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:37,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 261 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-11-03 01:53:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3122. [2022-11-03 01:53:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 2413 states have (on average 1.3323663489432243) internal successors, (3215), 2406 states have internal predecessors, (3215), 420 states have call successors, (420), 262 states have call predecessors, (420), 288 states have return successors, (474), 454 states have call predecessors, (474), 420 states have call successors, (474) [2022-11-03 01:53:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4109 transitions. [2022-11-03 01:53:38,140 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4109 transitions. Word has length 60 [2022-11-03 01:53:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:38,140 INFO L495 AbstractCegarLoop]: Abstraction has 3122 states and 4109 transitions. [2022-11-03 01:53:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-03 01:53:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4109 transitions. [2022-11-03 01:53:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 01:53:38,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:38,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:38,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:53:38,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1972205596, now seen corresponding path program 1 times [2022-11-03 01:53:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:38,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784612407] [2022-11-03 01:53:38,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:53:38,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:38,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784612407] [2022-11-03 01:53:38,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784612407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:38,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:38,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488635311] [2022-11-03 01:53:38,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:38,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:38,198 INFO L87 Difference]: Start difference. First operand 3122 states and 4109 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:53:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:38,640 INFO L93 Difference]: Finished difference Result 5607 states and 7434 transitions. [2022-11-03 01:53:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-11-03 01:53:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:38,663 INFO L225 Difference]: With dead ends: 5607 [2022-11-03 01:53:38,663 INFO L226 Difference]: Without dead ends: 3498 [2022-11-03 01:53:38,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:38,670 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:38,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 199 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-11-03 01:53:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3002. [2022-11-03 01:53:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2329 states have (on average 1.326320309145556) internal successors, (3089), 2324 states have internal predecessors, (3089), 408 states have call successors, (408), 258 states have call predecessors, (408), 264 states have return successors, (420), 420 states have call predecessors, (420), 408 states have call successors, (420) [2022-11-03 01:53:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3917 transitions. [2022-11-03 01:53:39,058 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3917 transitions. Word has length 67 [2022-11-03 01:53:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:39,059 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 3917 transitions. [2022-11-03 01:53:39,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:53:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3917 transitions. [2022-11-03 01:53:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-03 01:53:39,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:39,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:39,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:53:39,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:39,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 732338767, now seen corresponding path program 1 times [2022-11-03 01:53:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:39,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777213270] [2022-11-03 01:53:39,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:53:39,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777213270] [2022-11-03 01:53:39,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777213270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:39,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461619913] [2022-11-03 01:53:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:39,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:39,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:39,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:39,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:53:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:39,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:53:39,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:39,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:53:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461619913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:39,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:53:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:53:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615526695] [2022-11-03 01:53:39,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:39,402 INFO L87 Difference]: Start difference. First operand 3002 states and 3917 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-03 01:53:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:39,918 INFO L93 Difference]: Finished difference Result 5636 states and 7407 transitions. [2022-11-03 01:53:39,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:39,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2022-11-03 01:53:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:39,938 INFO L225 Difference]: With dead ends: 5636 [2022-11-03 01:53:39,939 INFO L226 Difference]: Without dead ends: 3630 [2022-11-03 01:53:39,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:39,949 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 54 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:39,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 253 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2022-11-03 01:53:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3290. [2022-11-03 01:53:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 2581 states have (on average 1.3347539713289422) internal successors, (3445), 2576 states have internal predecessors, (3445), 426 states have call successors, (426), 276 states have call predecessors, (426), 282 states have return successors, (438), 438 states have call predecessors, (438), 426 states have call successors, (438) [2022-11-03 01:53:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 4309 transitions. [2022-11-03 01:53:40,334 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 4309 transitions. Word has length 85 [2022-11-03 01:53:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:40,334 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 4309 transitions. [2022-11-03 01:53:40,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-03 01:53:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 4309 transitions. [2022-11-03 01:53:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-03 01:53:40,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:40,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:40,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:40,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:40,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1739936710, now seen corresponding path program 1 times [2022-11-03 01:53:40,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:40,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857809639] [2022-11-03 01:53:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-03 01:53:40,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:40,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857809639] [2022-11-03 01:53:40,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857809639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:40,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:40,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449811308] [2022-11-03 01:53:40,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:40,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:40,632 INFO L87 Difference]: Start difference. First operand 3290 states and 4309 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:53:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:41,247 INFO L93 Difference]: Finished difference Result 8196 states and 10771 transitions. [2022-11-03 01:53:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:41,248 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), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 82 [2022-11-03 01:53:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:41,275 INFO L225 Difference]: With dead ends: 8196 [2022-11-03 01:53:41,275 INFO L226 Difference]: Without dead ends: 4911 [2022-11-03 01:53:41,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:41,287 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 86 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:41,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 199 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4911 states. [2022-11-03 01:53:41,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4911 to 4867. [2022-11-03 01:53:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 3828 states have (on average 1.3160919540229885) internal successors, (5038), 3821 states have internal predecessors, (5038), 622 states have call successors, (622), 408 states have call predecessors, (622), 416 states have return successors, (638), 638 states have call predecessors, (638), 622 states have call successors, (638) [2022-11-03 01:53:41,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6298 transitions. [2022-11-03 01:53:41,935 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6298 transitions. Word has length 82 [2022-11-03 01:53:41,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:41,935 INFO L495 AbstractCegarLoop]: Abstraction has 4867 states and 6298 transitions. [2022-11-03 01:53:41,936 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), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:53:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6298 transitions. [2022-11-03 01:53:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-03 01:53:41,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:41,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:41,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:53:41,941 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1322823772, now seen corresponding path program 1 times [2022-11-03 01:53:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:41,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945757719] [2022-11-03 01:53:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 01:53:42,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:42,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945757719] [2022-11-03 01:53:42,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945757719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:42,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:42,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528176498] [2022-11-03 01:53:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:42,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:42,060 INFO L87 Difference]: Start difference. First operand 4867 states and 6298 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:53:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:42,741 INFO L93 Difference]: Finished difference Result 9227 states and 12056 transitions. [2022-11-03 01:53:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2022-11-03 01:53:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:42,773 INFO L225 Difference]: With dead ends: 9227 [2022-11-03 01:53:42,774 INFO L226 Difference]: Without dead ends: 6307 [2022-11-03 01:53:42,820 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 [2022-11-03 01:53:42,821 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 114 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:42,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 261 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2022-11-03 01:53:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 6127. [2022-11-03 01:53:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6127 states, 4998 states have (on average 1.3015206082432973) internal successors, (6505), 4997 states have internal predecessors, (6505), 628 states have call successors, (628), 486 states have call predecessors, (628), 500 states have return successors, (686), 644 states have call predecessors, (686), 628 states have call successors, (686) [2022-11-03 01:53:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 7819 transitions. [2022-11-03 01:53:43,401 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 7819 transitions. Word has length 83 [2022-11-03 01:53:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:43,402 INFO L495 AbstractCegarLoop]: Abstraction has 6127 states and 7819 transitions. [2022-11-03 01:53:43,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 01:53:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 7819 transitions. [2022-11-03 01:53:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-03 01:53:43,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:43,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:53:43,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -182472061, now seen corresponding path program 1 times [2022-11-03 01:53:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:43,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620468874] [2022-11-03 01:53:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 01:53:43,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620468874] [2022-11-03 01:53:43,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620468874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:43,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:43,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670791554] [2022-11-03 01:53:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:43,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:53:43,508 INFO L87 Difference]: Start difference. First operand 6127 states and 7819 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:53:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:44,292 INFO L93 Difference]: Finished difference Result 9659 states and 12575 transitions. [2022-11-03 01:53:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-11-03 01:53:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:44,325 INFO L225 Difference]: With dead ends: 9659 [2022-11-03 01:53:44,325 INFO L226 Difference]: Without dead ends: 6067 [2022-11-03 01:53:44,337 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 [2022-11-03 01:53:44,339 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 202 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:44,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 294 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2022-11-03 01:53:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 5995. [2022-11-03 01:53:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5995 states, 4875 states have (on average 1.2771282051282051) internal successors, (6226), 4865 states have internal predecessors, (6226), 628 states have call successors, (628), 486 states have call predecessors, (628), 491 states have return successors, (677), 644 states have call predecessors, (677), 628 states have call successors, (677) [2022-11-03 01:53:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5995 states to 5995 states and 7531 transitions. [2022-11-03 01:53:45,124 INFO L78 Accepts]: Start accepts. Automaton has 5995 states and 7531 transitions. Word has length 83 [2022-11-03 01:53:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:45,124 INFO L495 AbstractCegarLoop]: Abstraction has 5995 states and 7531 transitions. [2022-11-03 01:53:45,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:53:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5995 states and 7531 transitions. [2022-11-03 01:53:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-03 01:53:45,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:45,134 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:45,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:53:45,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1856845159, now seen corresponding path program 1 times [2022-11-03 01:53:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:45,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845713335] [2022-11-03 01:53:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:45,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:45,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845713335] [2022-11-03 01:53:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845713335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:45,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143763586] [2022-11-03 01:53:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:45,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:45,419 INFO L87 Difference]: Start difference. First operand 5995 states and 7531 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-03 01:53:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:46,626 INFO L93 Difference]: Finished difference Result 11621 states and 14668 transitions. [2022-11-03 01:53:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:53:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-03 01:53:46,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:46,658 INFO L225 Difference]: With dead ends: 11621 [2022-11-03 01:53:46,658 INFO L226 Difference]: Without dead ends: 8452 [2022-11-03 01:53:46,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:46,667 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 87 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:46,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 430 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8452 states. [2022-11-03 01:53:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8452 to 8101. [2022-11-03 01:53:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8101 states, 6567 states have (on average 1.2660271052230851) internal successors, (8314), 6530 states have internal predecessors, (8314), 880 states have call successors, (880), 675 states have call predecessors, (880), 653 states have return successors, (962), 896 states have call predecessors, (962), 880 states have call successors, (962) [2022-11-03 01:53:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8101 states to 8101 states and 10156 transitions. [2022-11-03 01:53:47,486 INFO L78 Accepts]: Start accepts. Automaton has 8101 states and 10156 transitions. Word has length 84 [2022-11-03 01:53:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:47,487 INFO L495 AbstractCegarLoop]: Abstraction has 8101 states and 10156 transitions. [2022-11-03 01:53:47,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-03 01:53:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8101 states and 10156 transitions. [2022-11-03 01:53:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-03 01:53:47,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:47,500 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, 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] [2022-11-03 01:53:47,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:53:47,500 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1443062061, now seen corresponding path program 1 times [2022-11-03 01:53:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:47,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636115898] [2022-11-03 01:53:47,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 01:53:48,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636115898] [2022-11-03 01:53:48,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636115898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:48,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061120476] [2022-11-03 01:53:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:48,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:48,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:48,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:48,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:53:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:48,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:53:48,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:53:48,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:53:48,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061120476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:48,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:53:48,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-11-03 01:53:48,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702408206] [2022-11-03 01:53:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:48,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:53:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:53:48,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:53:48,384 INFO L87 Difference]: Start difference. First operand 8101 states and 10156 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-03 01:53:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:49,402 INFO L93 Difference]: Finished difference Result 14455 states and 18447 transitions. [2022-11-03 01:53:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 01:53:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 104 [2022-11-03 01:53:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:49,428 INFO L225 Difference]: With dead ends: 14455 [2022-11-03 01:53:49,428 INFO L226 Difference]: Without dead ends: 6360 [2022-11-03 01:53:49,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-11-03 01:53:49,447 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 261 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:49,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 865 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2022-11-03 01:53:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 4978. [2022-11-03 01:53:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4978 states, 4130 states have (on average 1.2832929782082325) internal successors, (5300), 4118 states have internal predecessors, (5300), 462 states have call successors, (462), 388 states have call predecessors, (462), 385 states have return successors, (496), 472 states have call predecessors, (496), 462 states have call successors, (496) [2022-11-03 01:53:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4978 states to 4978 states and 6258 transitions. [2022-11-03 01:53:50,184 INFO L78 Accepts]: Start accepts. Automaton has 4978 states and 6258 transitions. Word has length 104 [2022-11-03 01:53:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:50,184 INFO L495 AbstractCegarLoop]: Abstraction has 4978 states and 6258 transitions. [2022-11-03 01:53:50,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-03 01:53:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 4978 states and 6258 transitions. [2022-11-03 01:53:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-03 01:53:50,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:50,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:50,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:50,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:53:50,407 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:50,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1044079100, now seen corresponding path program 1 times [2022-11-03 01:53:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:50,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236032178] [2022-11-03 01:53:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 01:53:50,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:50,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236032178] [2022-11-03 01:53:50,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236032178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507425445] [2022-11-03 01:53:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:50,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:50,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:50,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:50,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:53:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:50,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 01:53:50,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 01:53:51,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:53:51,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507425445] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:51,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:53:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 8] total 13 [2022-11-03 01:53:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642525526] [2022-11-03 01:53:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:53:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:53:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:53:51,474 INFO L87 Difference]: Start difference. First operand 4978 states and 6258 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 01:53:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:52,228 INFO L93 Difference]: Finished difference Result 9335 states and 11921 transitions. [2022-11-03 01:53:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:53:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 108 [2022-11-03 01:53:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:52,248 INFO L225 Difference]: With dead ends: 9335 [2022-11-03 01:53:52,249 INFO L226 Difference]: Without dead ends: 5568 [2022-11-03 01:53:52,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:53:52,262 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 96 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:52,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 241 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2022-11-03 01:53:53,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5364. [2022-11-03 01:53:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5364 states, 4489 states have (on average 1.2744486522610827) internal successors, (5721), 4495 states have internal predecessors, (5721), 462 states have call successors, (462), 397 states have call predecessors, (462), 412 states have return successors, (523), 472 states have call predecessors, (523), 462 states have call successors, (523) [2022-11-03 01:53:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 6706 transitions. [2022-11-03 01:53:53,176 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 6706 transitions. Word has length 108 [2022-11-03 01:53:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:53,177 INFO L495 AbstractCegarLoop]: Abstraction has 5364 states and 6706 transitions. [2022-11-03 01:53:53,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-03 01:53:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 6706 transitions. [2022-11-03 01:53:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-03 01:53:53,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:53,192 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:53,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:53,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:53,419 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1818179077, now seen corresponding path program 1 times [2022-11-03 01:53:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:53,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667042314] [2022-11-03 01:53:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-03 01:53:53,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667042314] [2022-11-03 01:53:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667042314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:53:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432713894] [2022-11-03 01:53:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:53,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:53:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:53:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:53,528 INFO L87 Difference]: Start difference. First operand 5364 states and 6706 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:53:54,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:54,352 INFO L93 Difference]: Finished difference Result 9176 states and 11602 transitions. [2022-11-03 01:53:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:53:54,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2022-11-03 01:53:54,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:54,375 INFO L225 Difference]: With dead ends: 9176 [2022-11-03 01:53:54,375 INFO L226 Difference]: Without dead ends: 5264 [2022-11-03 01:53:54,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:53:54,387 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 46 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:54,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2022-11-03 01:53:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4925. [2022-11-03 01:53:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4126 states have (on average 1.2753271934076587) internal successors, (5262), 4132 states have internal predecessors, (5262), 424 states have call successors, (424), 359 states have call predecessors, (424), 374 states have return successors, (485), 434 states have call predecessors, (485), 424 states have call successors, (485) [2022-11-03 01:53:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6171 transitions. [2022-11-03 01:53:55,063 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6171 transitions. Word has length 109 [2022-11-03 01:53:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:55,064 INFO L495 AbstractCegarLoop]: Abstraction has 4925 states and 6171 transitions. [2022-11-03 01:53:55,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:53:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6171 transitions. [2022-11-03 01:53:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-03 01:53:55,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:55,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:55,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:53:55,078 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1676400282, now seen corresponding path program 1 times [2022-11-03 01:53:55,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:55,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367411405] [2022-11-03 01:53:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:55,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:53:55,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:55,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367411405] [2022-11-03 01:53:55,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367411405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:55,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402071837] [2022-11-03 01:53:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:55,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:55,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:55,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:53:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:55,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 01:53:55,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:53:55,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:53:56,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402071837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:56,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [262110223] [2022-11-03 01:53:56,107 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-03 01:53:56,107 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:56,112 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:56,117 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:56,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:54:00,488 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 87 for LOIs [2022-11-03 01:54:00,517 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:54:00,544 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-11-03 01:54:03,229 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 88 for LOIs [2022-11-03 01:54:03,253 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 74 for LOIs [2022-11-03 01:54:03,259 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 28 for LOIs [2022-11-03 01:54:03,270 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 56 for LOIs [2022-11-03 01:54:03,465 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 53 for LOIs [2022-11-03 01:54:04,058 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:54:17,570 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '222447#(and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483648)) (= ~t1_i~0 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483648)) (= ~t3_st~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~t2_pc~0 1) (<= ~m_pc~0 1) (<= 1 ~t2_pc~0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (<= ~t2_st~0 2) (<= ~m_i~0 1) (<= 0 |ULTIMATE.start_eval_~tmp_ndt_2~0#1|) (<= |ULTIMATE.start_eval_~tmp_ndt_2~0#1| 0) (<= 0 ~m_pc~0) (<= 2 ~t2_st~0) (<= 0 |#NULL.offset|) (= ~t3_i~0 1) (= ~t3_pc~0 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:54:17,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:54:17,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:17,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 10 [2022-11-03 01:54:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139562004] [2022-11-03 01:54:17,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:17,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:54:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:17,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:54:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3243, Unknown=0, NotChecked=0, Total=3540 [2022-11-03 01:54:17,575 INFO L87 Difference]: Start difference. First operand 4925 states and 6171 transitions. Second operand has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-03 01:54:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:18,907 INFO L93 Difference]: Finished difference Result 10807 states and 13830 transitions. [2022-11-03 01:54:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 01:54:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 109 [2022-11-03 01:54:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:18,931 INFO L225 Difference]: With dead ends: 10807 [2022-11-03 01:54:18,932 INFO L226 Difference]: Without dead ends: 6988 [2022-11-03 01:54:18,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 267 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=353, Invalid=3937, Unknown=0, NotChecked=0, Total=4290 [2022-11-03 01:54:18,944 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 490 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:18,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 317 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:54:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2022-11-03 01:54:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 6827. [2022-11-03 01:54:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6827 states, 5707 states have (on average 1.266164359558437) internal successors, (7226), 5716 states have internal predecessors, (7226), 598 states have call successors, (598), 505 states have call predecessors, (598), 521 states have return successors, (655), 606 states have call predecessors, (655), 598 states have call successors, (655) [2022-11-03 01:54:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6827 states to 6827 states and 8479 transitions. [2022-11-03 01:54:19,644 INFO L78 Accepts]: Start accepts. Automaton has 6827 states and 8479 transitions. Word has length 109 [2022-11-03 01:54:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:19,644 INFO L495 AbstractCegarLoop]: Abstraction has 6827 states and 8479 transitions. [2022-11-03 01:54:19,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-11-03 01:54:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6827 states and 8479 transitions. [2022-11-03 01:54:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-03 01:54:19,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:19,654 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:19,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:19,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:54:19,883 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:19,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1979526906, now seen corresponding path program 1 times [2022-11-03 01:54:19,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:19,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593410408] [2022-11-03 01:54:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 01:54:19,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:19,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593410408] [2022-11-03 01:54:19,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593410408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:19,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839432763] [2022-11-03 01:54:19,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:19,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:19,960 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:19,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:54:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:20,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:54:20,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:54:20,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:54:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839432763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:20,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:54:20,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-03 01:54:20,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622935979] [2022-11-03 01:54:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:20,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:54:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:54:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:54:20,145 INFO L87 Difference]: Start difference. First operand 6827 states and 8479 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:54:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:21,112 INFO L93 Difference]: Finished difference Result 13118 states and 16551 transitions. [2022-11-03 01:54:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:54:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 109 [2022-11-03 01:54:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:21,138 INFO L225 Difference]: With dead ends: 13118 [2022-11-03 01:54:21,138 INFO L226 Difference]: Without dead ends: 8312 [2022-11-03 01:54:21,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:54:21,149 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 85 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:21,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 261 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:54:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2022-11-03 01:54:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 8242. [2022-11-03 01:54:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8242 states, 6876 states have (on average 1.2478184991273997) internal successors, (8580), 6887 states have internal predecessors, (8580), 732 states have call successors, (732), 615 states have call predecessors, (732), 633 states have return successors, (847), 740 states have call predecessors, (847), 732 states have call successors, (847) [2022-11-03 01:54:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8242 states to 8242 states and 10159 transitions. [2022-11-03 01:54:22,131 INFO L78 Accepts]: Start accepts. Automaton has 8242 states and 10159 transitions. Word has length 109 [2022-11-03 01:54:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 8242 states and 10159 transitions. [2022-11-03 01:54:22,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:54:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8242 states and 10159 transitions. [2022-11-03 01:54:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 01:54:22,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:22,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:22,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:22,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:54:22,367 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -775880118, now seen corresponding path program 1 times [2022-11-03 01:54:22,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:22,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717412658] [2022-11-03 01:54:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:54:22,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:22,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717412658] [2022-11-03 01:54:22,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717412658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:22,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807196779] [2022-11-03 01:54:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:22,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:22,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:22,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:54:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:22,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 01:54:22,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:54:22,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:54:22,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807196779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:22,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:54:22,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 01:54:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675435269] [2022-11-03 01:54:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:22,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:54:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:54:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:54:22,865 INFO L87 Difference]: Start difference. First operand 8242 states and 10159 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-03 01:54:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:24,124 INFO L93 Difference]: Finished difference Result 13046 states and 16009 transitions. [2022-11-03 01:54:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:54:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 111 [2022-11-03 01:54:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:24,148 INFO L225 Difference]: With dead ends: 13046 [2022-11-03 01:54:24,148 INFO L226 Difference]: Without dead ends: 8748 [2022-11-03 01:54:24,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:54:24,158 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 191 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:24,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 334 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:54:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8748 states. [2022-11-03 01:54:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8748 to 8297. [2022-11-03 01:54:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8297 states, 6909 states have (on average 1.2414242292661746) internal successors, (8577), 6922 states have internal predecessors, (8577), 745 states have call successors, (745), 622 states have call predecessors, (745), 642 states have return successors, (865), 753 states have call predecessors, (865), 745 states have call successors, (865) [2022-11-03 01:54:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8297 states to 8297 states and 10187 transitions. [2022-11-03 01:54:25,140 INFO L78 Accepts]: Start accepts. Automaton has 8297 states and 10187 transitions. Word has length 111 [2022-11-03 01:54:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:25,141 INFO L495 AbstractCegarLoop]: Abstraction has 8297 states and 10187 transitions. [2022-11-03 01:54:25,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-11-03 01:54:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8297 states and 10187 transitions. [2022-11-03 01:54:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 01:54:25,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:25,151 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:25,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 01:54:25,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:25,379 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash -499339926, now seen corresponding path program 1 times [2022-11-03 01:54:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846927240] [2022-11-03 01:54:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 01:54:25,450 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:25,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846927240] [2022-11-03 01:54:25,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846927240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:25,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:54:25,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:54:25,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691024585] [2022-11-03 01:54:25,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:25,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:54:25,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:54:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:54:25,453 INFO L87 Difference]: Start difference. First operand 8297 states and 10187 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:54:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:26,407 INFO L93 Difference]: Finished difference Result 17037 states and 21187 transitions. [2022-11-03 01:54:26,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:54:26,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 111 [2022-11-03 01:54:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:26,437 INFO L225 Difference]: With dead ends: 17037 [2022-11-03 01:54:26,437 INFO L226 Difference]: Without dead ends: 10549 [2022-11-03 01:54:26,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:54:26,449 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:26,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 233 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:54:26,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10549 states. [2022-11-03 01:54:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10549 to 8824. [2022-11-03 01:54:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8824 states, 7356 states have (on average 1.2600598151169113) internal successors, (9269), 7369 states have internal predecessors, (9269), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-03 01:54:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8824 states to 8824 states and 10959 transitions. [2022-11-03 01:54:27,244 INFO L78 Accepts]: Start accepts. Automaton has 8824 states and 10959 transitions. Word has length 111 [2022-11-03 01:54:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:27,245 INFO L495 AbstractCegarLoop]: Abstraction has 8824 states and 10959 transitions. [2022-11-03 01:54:27,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 01:54:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8824 states and 10959 transitions. [2022-11-03 01:54:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-03 01:54:27,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:27,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:27,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:54:27,254 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:27,255 INFO L85 PathProgramCache]: Analyzing trace with hash 425714574, now seen corresponding path program 1 times [2022-11-03 01:54:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:27,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080946925] [2022-11-03 01:54:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-03 01:54:27,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:27,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080946925] [2022-11-03 01:54:27,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080946925] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:27,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850909741] [2022-11-03 01:54:27,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:27,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:27,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:27,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:27,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:54:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:27,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:54:27,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-03 01:54:27,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:54:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850909741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:27,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:54:27,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-03 01:54:27,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450795519] [2022-11-03 01:54:27,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:54:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:54:27,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:54:27,528 INFO L87 Difference]: Start difference. First operand 8824 states and 10959 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:54:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:28,358 INFO L93 Difference]: Finished difference Result 16218 states and 20510 transitions. [2022-11-03 01:54:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:54:28,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 137 [2022-11-03 01:54:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:28,382 INFO L225 Difference]: With dead ends: 16218 [2022-11-03 01:54:28,382 INFO L226 Difference]: Without dead ends: 8806 [2022-11-03 01:54:28,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:54:28,396 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 80 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:28,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 249 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:54:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8806 states. [2022-11-03 01:54:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8806 to 8712. [2022-11-03 01:54:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 7244 states have (on average 1.223495306460519) internal successors, (8863), 7257 states have internal predecessors, (8863), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-03 01:54:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 10553 transitions. [2022-11-03 01:54:29,405 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 10553 transitions. Word has length 137 [2022-11-03 01:54:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:29,406 INFO L495 AbstractCegarLoop]: Abstraction has 8712 states and 10553 transitions. [2022-11-03 01:54:29,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:54:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 10553 transitions. [2022-11-03 01:54:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-03 01:54:29,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:29,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:29,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:29,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:29,631 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash -594734031, now seen corresponding path program 1 times [2022-11-03 01:54:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:29,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102783184] [2022-11-03 01:54:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-03 01:54:29,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102783184] [2022-11-03 01:54:29,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102783184] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:29,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134615023] [2022-11-03 01:54:29,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:29,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:29,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:29,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:54:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:29,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:54:29,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:54:29,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:54:29,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134615023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:54:29,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:54:29,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-03 01:54:29,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132798596] [2022-11-03 01:54:29,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:54:29,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:54:29,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:29,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:54:29,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:54:29,929 INFO L87 Difference]: Start difference. First operand 8712 states and 10553 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:54:30,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:30,675 INFO L93 Difference]: Finished difference Result 15471 states and 19058 transitions. [2022-11-03 01:54:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:54:30,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 137 [2022-11-03 01:54:30,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:30,696 INFO L225 Difference]: With dead ends: 15471 [2022-11-03 01:54:30,696 INFO L226 Difference]: Without dead ends: 8712 [2022-11-03 01:54:30,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:54:30,708 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 94 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:30,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 123 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:54:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8712 states. [2022-11-03 01:54:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8712 to 8712. [2022-11-03 01:54:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8712 states, 7244 states have (on average 1.2030646051905025) internal successors, (8715), 7257 states have internal predecessors, (8715), 785 states have call successors, (785), 662 states have call predecessors, (785), 682 states have return successors, (905), 793 states have call predecessors, (905), 785 states have call successors, (905) [2022-11-03 01:54:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8712 states to 8712 states and 10405 transitions. [2022-11-03 01:54:31,548 INFO L78 Accepts]: Start accepts. Automaton has 8712 states and 10405 transitions. Word has length 137 [2022-11-03 01:54:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:31,548 INFO L495 AbstractCegarLoop]: Abstraction has 8712 states and 10405 transitions. [2022-11-03 01:54:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 01:54:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8712 states and 10405 transitions. [2022-11-03 01:54:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-03 01:54:31,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:31,556 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:31,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:31,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 01:54:31,783 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:54:31,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1461594947, now seen corresponding path program 1 times [2022-11-03 01:54:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:31,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620577] [2022-11-03 01:54:31,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:54:31,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 01:54:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 01:54:31,900 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 01:54:31,900 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 01:54:31,901 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:54:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 01:54:31,907 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:31,911 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:54:32,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:54:32 BoogieIcfgContainer [2022-11-03 01:54:32,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:54:32,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:54:32,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:54:32,047 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:54:32,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:53:31" (3/4) ... [2022-11-03 01:54:32,050 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 01:54:32,169 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:54:32,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:54:32,170 INFO L158 Benchmark]: Toolchain (without parser) took 62412.40ms. Allocated memory was 123.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 85.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 233.5MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,170 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 123.7MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:54:32,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.59ms. Allocated memory is still 123.7MB. Free memory was 85.5MB in the beginning and 96.5MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.30ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,171 INFO L158 Benchmark]: Boogie Preprocessor took 34.55ms. Allocated memory is still 123.7MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,171 INFO L158 Benchmark]: RCFGBuilder took 976.38ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 99.0MB in the end (delta: -6.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,172 INFO L158 Benchmark]: TraceAbstraction took 60769.78ms. Allocated memory was 123.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 98.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,172 INFO L158 Benchmark]: Witness Printer took 122.75ms. Allocated memory is still 2.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 01:54:32,173 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 123.7MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.59ms. Allocated memory is still 123.7MB. Free memory was 85.5MB in the beginning and 96.5MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.30ms. Allocated memory is still 123.7MB. Free memory was 96.5MB in the beginning and 94.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.55ms. Allocated memory is still 123.7MB. Free memory was 94.2MB in the beginning and 92.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 976.38ms. Allocated memory is still 123.7MB. Free memory was 92.1MB in the beginning and 99.0MB in the end (delta: -6.9MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 60769.78ms. Allocated memory was 123.7MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 98.4MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. * Witness Printer took 122.75ms. Allocated memory is still 2.3GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) [L423] COND FALSE !(T1_E == 0) [L428] COND FALSE !(T2_E == 0) [L433] COND FALSE !(T3_E == 0) [L438] COND FALSE !(E_1 == 0) [L443] COND FALSE !(E_2 == 0) [L448] COND FALSE !(E_3 == 0) [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) [L466] COND FALSE !(T1_E == 1) [L471] COND FALSE !(T2_E == 1) [L476] COND FALSE !(T3_E == 1) [L481] COND FALSE !(E_1 == 1) [L486] COND FALSE !(E_2 == 1) [L491] COND FALSE !(E_3 == 1) [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4048 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3978 mSDsluCounter, 6788 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4419 mSDsCounter, 866 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3126 IncrementalHoareTripleChecker+Invalid, 3992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 866 mSolverCounterUnsat, 3156 mSDtfsCounter, 3126 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1219 SyntacticMatches, 7 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8824occurred in iteration=20, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 7607 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2909 NumberOfCodeBlocks, 2909 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2955 ConstructedInterpolants, 0 QuantifiedInterpolants, 5418 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4210 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 32 InterpolantComputations, 21 PerfectInterpolantSequences, 1399/1522 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! [2022-11-03 01:54:32,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f1a5c360-1c4f-48c8-89bc-bbe04bd70deb/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE