./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- 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:45:55,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:45:55,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:45:55,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:45:55,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:45:55,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:45:55,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:45:55,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:45:55,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:45:55,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:45:55,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:45:55,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:45:55,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:45:55,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:45:55,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:45:55,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:45:55,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:45:55,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:45:55,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:45:55,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:45:55,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:45:55,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:45:55,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:45:55,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:45:55,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:45:55,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:45:55,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:45:55,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:45:55,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:45:55,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:45:55,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:45:55,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:45:55,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:45:55,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:45:55,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:45:55,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:45:55,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:45:55,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:45:55,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:45:55,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:45:55,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:45:55,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:45:55,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:45:55,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:45:55,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:45:55,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:45:55,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:45:55,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:45:55,298 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:45:55,299 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:45:55,299 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:45:55,299 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:45:55,300 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:45:55,300 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:45:55,301 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:45:55,301 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:45:55,301 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:45:55,301 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:45:55,302 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:45:55,302 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:45:55,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:45:55,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:45:55,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:45:55,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:45:55,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:45:55,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:45:55,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:45:55,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:45:55,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:45:55,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:45:55,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:45:55,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:45:55,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:45:55,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:45:55,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:45:55,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:45:55,308 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:45:55,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:45:55,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:45:55,308 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:45:55,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:45:55,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:45:55,309 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:45:55,309 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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2022-11-03 01:45:55,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:45:55,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:45:55,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:45:55,591 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:45:55,592 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:45:55,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-03 01:45:55,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/data/63ffd4247/ad6c7f281ee74ff29777c5407e9af98d/FLAG076cc1b65 [2022-11-03 01:45:56,126 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:45:56,126 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2022-11-03 01:45:56,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/data/63ffd4247/ad6c7f281ee74ff29777c5407e9af98d/FLAG076cc1b65 [2022-11-03 01:45:56,509 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/data/63ffd4247/ad6c7f281ee74ff29777c5407e9af98d [2022-11-03 01:45:56,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:45:56,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:45:56,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:45:56,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:45:56,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:45:56,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56, skipping insertion in model container [2022-11-03 01:45:56,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:45:56,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:45:56,767 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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-03 01:45:56,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:45:56,833 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:45:56,844 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_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2022-11-03 01:45:56,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:45:56,917 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:45:56,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56 WrapperNode [2022-11-03 01:45:56,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:45:56,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:45:56,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:45:56,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:45:56,927 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:45:56" (1/1) ... [2022-11-03 01:45:56,948 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:45:56" (1/1) ... [2022-11-03 01:45:56,968 INFO L138 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2022-11-03 01:45:56,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:45:56,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:45:56,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:45:56,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:45:56,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,993 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:56,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:45:56,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:45:56,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:45:56,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:45:56,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (1/1) ... [2022-11-03 01:45:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:45:57,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:57,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:45:57,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:45:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:45:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-03 01:45:57,073 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-03 01:45:57,073 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-03 01:45:57,073 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-03 01:45:57,074 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 01:45:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 01:45:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-03 01:45:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-03 01:45:57,075 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-03 01:45:57,075 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-03 01:45:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:45:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-03 01:45:57,076 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-03 01:45:57,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:45:57,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:45:57,200 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:45:57,203 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:45:57,572 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:45:57,717 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:45:57,717 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-03 01:45:57,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:45:57 BoogieIcfgContainer [2022-11-03 01:45:57,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:45:57,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:45:57,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:45:57,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:45:57,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:45:56" (1/3) ... [2022-11-03 01:45:57,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57e694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:45:57, skipping insertion in model container [2022-11-03 01:45:57,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:45:56" (2/3) ... [2022-11-03 01:45:57,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57e694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:45:57, skipping insertion in model container [2022-11-03 01:45:57,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:45:57" (3/3) ... [2022-11-03 01:45:57,739 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2022-11-03 01:45:57,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:45:57,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 01:45:57,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:45:57,844 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;@729c791b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:45:57,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 01:45:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 46 states have internal predecessors, (64), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-03 01:45:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 01:45:57,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:57,863 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] [2022-11-03 01:45:57,864 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:45:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash -724754551, now seen corresponding path program 1 times [2022-11-03 01:45:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331013999] [2022-11-03 01:45:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:58,354 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:45:58,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331013999] [2022-11-03 01:45:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331013999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:58,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:58,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:45:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536777761] [2022-11-03 01:45:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:58,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:58,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:58,399 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 46 states have internal predecessors, (64), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (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:45:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:58,760 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2022-11-03 01:45:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:45:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (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 33 [2022-11-03 01:45:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:58,772 INFO L225 Difference]: With dead ends: 185 [2022-11-03 01:45:58,772 INFO L226 Difference]: Without dead ends: 119 [2022-11-03 01:45:58,776 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:45:58,780 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 149 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:58,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 194 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:45:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-03 01:45:58,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-11-03 01:45:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 81 states have internal predecessors, (104), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-03 01:45:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2022-11-03 01:45:58,838 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 33 [2022-11-03 01:45:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:58,838 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2022-11-03 01:45:58,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (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:45:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2022-11-03 01:45:58,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-03 01:45:58,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:58,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:58,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:45:58,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:45:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -27915810, now seen corresponding path program 1 times [2022-11-03 01:45:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:58,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11827902] [2022-11-03 01:45:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:45:59,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11827902] [2022-11-03 01:45:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11827902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:59,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:59,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:45:59,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990362254] [2022-11-03 01:45:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:45:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:45:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:45:59,325 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:45:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:59,607 INFO L93 Difference]: Finished difference Result 342 states and 451 transitions. [2022-11-03 01:45:59,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:45:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 58 [2022-11-03 01:45:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:59,612 INFO L225 Difference]: With dead ends: 342 [2022-11-03 01:45:59,613 INFO L226 Difference]: Without dead ends: 230 [2022-11-03 01:45:59,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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:45:59,615 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 155 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:59,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 192 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:45:59,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-03 01:45:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2022-11-03 01:45:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 145 states have (on average 1.289655172413793) internal successors, (187), 148 states have internal predecessors, (187), 46 states have call successors, (46), 24 states have call predecessors, (46), 24 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-03 01:45:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-11-03 01:45:59,656 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 58 [2022-11-03 01:45:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:59,656 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-11-03 01:45:59,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 01:45:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-11-03 01:45:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 01:45:59,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:59,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:59,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:45:59,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:45:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 497100856, now seen corresponding path program 1 times [2022-11-03 01:45:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:59,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845133184] [2022-11-03 01:45:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:45:59,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:59,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845133184] [2022-11-03 01:45:59,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845133184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:59,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:59,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150474496] [2022-11-03 01:45:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:45:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:59,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:45:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:45:59,782 INFO L87 Difference]: Start difference. First operand 216 states and 279 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:45:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:59,843 INFO L93 Difference]: Finished difference Result 376 states and 487 transitions. [2022-11-03 01:45:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:45:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2022-11-03 01:45:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:59,846 INFO L225 Difference]: With dead ends: 376 [2022-11-03 01:45:59,847 INFO L226 Difference]: Without dead ends: 266 [2022-11-03 01:45:59,848 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:45:59,849 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 28 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:59,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 175 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-03 01:45:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2022-11-03 01:45:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 164 states have internal predecessors, (209), 48 states have call successors, (48), 26 states have call predecessors, (48), 26 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-03 01:45:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 305 transitions. [2022-11-03 01:45:59,906 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 305 transitions. Word has length 59 [2022-11-03 01:45:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:59,908 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 305 transitions. [2022-11-03 01:45:59,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 01:45:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 305 transitions. [2022-11-03 01:45:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 01:45:59,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:59,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:45:59,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:45:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1593943316, now seen corresponding path program 1 times [2022-11-03 01:45:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080778271] [2022-11-03 01:45:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:45:59,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080778271] [2022-11-03 01:45:59,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080778271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:59,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:59,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:59,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293903100] [2022-11-03 01:45:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:59,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:45:59,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:59,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:45:59,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:45:59,991 INFO L87 Difference]: Start difference. First operand 236 states and 305 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:46:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:00,065 INFO L93 Difference]: Finished difference Result 582 states and 755 transitions. [2022-11-03 01:46:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:46:00,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 75 [2022-11-03 01:46:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:00,069 INFO L225 Difference]: With dead ends: 582 [2022-11-03 01:46:00,069 INFO L226 Difference]: Without dead ends: 351 [2022-11-03 01:46:00,070 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:46:00,072 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 57 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:00,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 164 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:46:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-03 01:46:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 346. [2022-11-03 01:46:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 237 states have (on average 1.2742616033755274) internal successors, (302), 241 states have internal predecessors, (302), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-03 01:46:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 440 transitions. [2022-11-03 01:46:00,112 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 440 transitions. Word has length 75 [2022-11-03 01:46:00,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:00,112 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 440 transitions. [2022-11-03 01:46:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:46:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 440 transitions. [2022-11-03 01:46:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 01:46:00,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:00,124 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:46:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:46:00,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1904772125, now seen corresponding path program 1 times [2022-11-03 01:46:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:00,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399436220] [2022-11-03 01:46:00,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:46:00,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:00,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399436220] [2022-11-03 01:46:00,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399436220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:00,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632174075] [2022-11-03 01:46:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:00,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:00,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:00,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:46:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:00,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:46:00,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:46:00,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:46:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632174075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:00,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:46:00,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:46:00,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430090633] [2022-11-03 01:46:00,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:00,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:46:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:46:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:46:00,460 INFO L87 Difference]: Start difference. First operand 346 states and 440 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:46:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:00,526 INFO L93 Difference]: Finished difference Result 650 states and 833 transitions. [2022-11-03 01:46:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:46:00,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 86 [2022-11-03 01:46:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:00,529 INFO L225 Difference]: With dead ends: 650 [2022-11-03 01:46:00,529 INFO L226 Difference]: Without dead ends: 420 [2022-11-03 01:46:00,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 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:46:00,531 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:00,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:46:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-11-03 01:46:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 372. [2022-11-03 01:46:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 257 states have (on average 1.2801556420233462) internal successors, (329), 261 states have internal predecessors, (329), 72 states have call successors, (72), 42 states have call predecessors, (72), 42 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-03 01:46:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 473 transitions. [2022-11-03 01:46:00,586 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 473 transitions. Word has length 86 [2022-11-03 01:46:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:00,588 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 473 transitions. [2022-11-03 01:46:00,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:46:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 473 transitions. [2022-11-03 01:46:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 01:46:00,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:00,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-03 01:46:00,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:00,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1775665929, now seen corresponding path program 2 times [2022-11-03 01:46:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:00,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343561315] [2022-11-03 01:46:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:46:01,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:01,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343561315] [2022-11-03 01:46:01,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343561315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:01,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973039822] [2022-11-03 01:46:01,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:46:01,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:01,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:01,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:46:01,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:46:01,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:46:01,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:46:01,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 01:46:01,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:46:01,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973039822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:01,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:46:01,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:46:01,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448164278] [2022-11-03 01:46:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:01,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:46:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:46:01,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:01,263 INFO L87 Difference]: Start difference. First operand 372 states and 473 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:46:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:01,379 INFO L93 Difference]: Finished difference Result 632 states and 822 transitions. [2022-11-03 01:46:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:46:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-11-03 01:46:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:01,384 INFO L225 Difference]: With dead ends: 632 [2022-11-03 01:46:01,384 INFO L226 Difference]: Without dead ends: 376 [2022-11-03 01:46:01,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:01,390 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:01,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 168 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:46:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-03 01:46:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 370. [2022-11-03 01:46:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 255 states have (on average 1.2431372549019608) internal successors, (317), 259 states have internal predecessors, (317), 72 states have call successors, (72), 42 states have call predecessors, (72), 42 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-11-03 01:46:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 461 transitions. [2022-11-03 01:46:01,445 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 461 transitions. Word has length 86 [2022-11-03 01:46:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:01,445 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 461 transitions. [2022-11-03 01:46:01,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:46:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 461 transitions. [2022-11-03 01:46:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 01:46:01,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:01,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-03 01:46:01,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:01,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash 591011467, now seen corresponding path program 1 times [2022-11-03 01:46:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129793956] [2022-11-03 01:46:01,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:46:01,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:01,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129793956] [2022-11-03 01:46:01,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129793956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:01,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041191484] [2022-11-03 01:46:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:01,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:01,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:46:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:46:01,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:46:02,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:46:02,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041191484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:02,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:46:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:46:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427577591] [2022-11-03 01:46:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:02,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:46:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:46:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:02,036 INFO L87 Difference]: Start difference. First operand 370 states and 461 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:46:02,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:02,106 INFO L93 Difference]: Finished difference Result 676 states and 844 transitions. [2022-11-03 01:46:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:46:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-11-03 01:46:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:02,110 INFO L225 Difference]: With dead ends: 676 [2022-11-03 01:46:02,111 INFO L226 Difference]: Without dead ends: 431 [2022-11-03 01:46:02,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:02,119 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 66 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:02,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 91 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:46:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-03 01:46:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2022-11-03 01:46:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 306 states have (on average 1.2222222222222223) internal successors, (374), 310 states have internal predecessors, (374), 74 states have call successors, (74), 50 states have call predecessors, (74), 50 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2022-11-03 01:46:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 522 transitions. [2022-11-03 01:46:02,172 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 522 transitions. Word has length 86 [2022-11-03 01:46:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:02,173 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 522 transitions. [2022-11-03 01:46:02,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 01:46:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 522 transitions. [2022-11-03 01:46:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 01:46:02,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:02,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:02,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 01:46:02,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash -651298458, now seen corresponding path program 1 times [2022-11-03 01:46:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:02,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073741760] [2022-11-03 01:46:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:46:02,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073741760] [2022-11-03 01:46:02,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073741760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:02,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039186330] [2022-11-03 01:46:02,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:02,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:02,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:02,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:02,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:46:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:02,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:46:02,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:02,730 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:46:02,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:46:02,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039186330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:02,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:46:02,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:46:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656452445] [2022-11-03 01:46:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:02,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:46:02,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:02,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:46:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:02,734 INFO L87 Difference]: Start difference. First operand 431 states and 522 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:46:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:02,831 INFO L93 Difference]: Finished difference Result 1017 states and 1233 transitions. [2022-11-03 01:46:02,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:46:02,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 87 [2022-11-03 01:46:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:02,835 INFO L225 Difference]: With dead ends: 1017 [2022-11-03 01:46:02,836 INFO L226 Difference]: Without dead ends: 592 [2022-11-03 01:46:02,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:46:02,838 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 32 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:02,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 153 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:46:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-03 01:46:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 475. [2022-11-03 01:46:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 338 states have (on average 1.2218934911242603) internal successors, (413), 343 states have internal predecessors, (413), 80 states have call successors, (80), 56 states have call predecessors, (80), 56 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-03 01:46:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 573 transitions. [2022-11-03 01:46:02,892 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 573 transitions. Word has length 87 [2022-11-03 01:46:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:02,893 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 573 transitions. [2022-11-03 01:46:02,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:46:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 573 transitions. [2022-11-03 01:46:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 01:46:02,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:02,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:02,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:03,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 01:46:03,106 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:03,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1483544430, now seen corresponding path program 1 times [2022-11-03 01:46:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:03,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108276823] [2022-11-03 01:46:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 01:46:03,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:03,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108276823] [2022-11-03 01:46:03,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108276823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:03,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:46:03,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:46:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063875491] [2022-11-03 01:46:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:03,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:46:03,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:46:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:46:03,246 INFO L87 Difference]: Start difference. First operand 475 states and 573 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:46:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:03,492 INFO L93 Difference]: Finished difference Result 1230 states and 1499 transitions. [2022-11-03 01:46:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:46:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 88 [2022-11-03 01:46:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:03,498 INFO L225 Difference]: With dead ends: 1230 [2022-11-03 01:46:03,498 INFO L226 Difference]: Without dead ends: 991 [2022-11-03 01:46:03,499 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:46:03,502 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 129 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:03,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 231 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:46:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-11-03 01:46:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 794. [2022-11-03 01:46:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 567 states have (on average 1.2345679012345678) internal successors, (700), 572 states have internal predecessors, (700), 133 states have call successors, (133), 93 states have call predecessors, (133), 93 states have return successors, (133), 129 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-03 01:46:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 966 transitions. [2022-11-03 01:46:03,615 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 966 transitions. Word has length 88 [2022-11-03 01:46:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:03,616 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 966 transitions. [2022-11-03 01:46:03,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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:46:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 966 transitions. [2022-11-03 01:46:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-03 01:46:03,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:03,618 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:03,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 01:46:03,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:03,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 865513056, now seen corresponding path program 1 times [2022-11-03 01:46:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:03,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195727445] [2022-11-03 01:46:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:46:04,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:04,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195727445] [2022-11-03 01:46:04,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195727445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:04,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116105691] [2022-11-03 01:46:04,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:04,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:04,124 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:04,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:46:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:04,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:46:04,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:46:04,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-03 01:46:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116105691] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143316883] [2022-11-03 01:46:04,696 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-03 01:46:04,696 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:04,700 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:04,705 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:04,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:08,035 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 88 for LOIs [2022-11-03 01:46:08,830 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 111 for LOIs [2022-11-03 01:46:09,470 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 95 for LOIs [2022-11-03 01:46:09,492 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 44 for LOIs [2022-11-03 01:46:09,501 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 34 for LOIs [2022-11-03 01:46:09,552 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 44 for LOIs [2022-11-03 01:46:09,610 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:16,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2143316883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:16,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:16,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [13, 8, 6] total 57 [2022-11-03 01:46:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152794000] [2022-11-03 01:46:16,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 01:46:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 01:46:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2811, Unknown=0, NotChecked=0, Total=3192 [2022-11-03 01:46:16,978 INFO L87 Difference]: Start difference. First operand 794 states and 966 transitions. Second operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 11 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 01:46:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:24,123 INFO L93 Difference]: Finished difference Result 1350 states and 1636 transitions. [2022-11-03 01:46:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-03 01:46:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 11 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) Word has length 97 [2022-11-03 01:46:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:24,128 INFO L225 Difference]: With dead ends: 1350 [2022-11-03 01:46:24,128 INFO L226 Difference]: Without dead ends: 843 [2022-11-03 01:46:24,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=895, Invalid=7115, Unknown=0, NotChecked=0, Total=8010 [2022-11-03 01:46:24,133 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 213 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:24,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 649 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-03 01:46:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-11-03 01:46:24,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 804. [2022-11-03 01:46:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 576 states have (on average 1.21875) internal successors, (702), 581 states have internal predecessors, (702), 131 states have call successors, (131), 96 states have call predecessors, (131), 96 states have return successors, (131), 127 states have call predecessors, (131), 131 states have call successors, (131) [2022-11-03 01:46:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 964 transitions. [2022-11-03 01:46:24,238 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 964 transitions. Word has length 97 [2022-11-03 01:46:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:24,239 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 964 transitions. [2022-11-03 01:46:24,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 11 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-11-03 01:46:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 964 transitions. [2022-11-03 01:46:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 01:46:24,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:24,243 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:24,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:46:24,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 01:46:24,466 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1020494713, now seen corresponding path program 1 times [2022-11-03 01:46:24,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:24,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060504931] [2022-11-03 01:46:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 01:46:25,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:25,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060504931] [2022-11-03 01:46:25,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060504931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393656872] [2022-11-03 01:46:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:25,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:25,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:46:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:25,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:46:25,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:46:25,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-03 01:46:26,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393656872] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:26,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1282566100] [2022-11-03 01:46:26,624 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-03 01:46:26,624 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:26,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:26,625 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:26,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:33,711 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 101 for LOIs [2022-11-03 01:46:34,180 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 121 for LOIs [2022-11-03 01:46:34,394 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 105 for LOIs [2022-11-03 01:46:34,409 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 52 for LOIs [2022-11-03 01:46:34,417 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 34 for LOIs [2022-11-03 01:46:34,452 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 48 for LOIs [2022-11-03 01:46:34,537 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:46:41,682 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '19060#(and (= ~t1_pc~0 1) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_i~0 1) (= |ULTIMATE.start_start_simulation_~tmp___0~1#1| 0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (= ~m_pc~0 1) (= ~m_i~0 1) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (= ~m_st~0 1) (= |#NULL.offset| 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (= |#NULL.base| 0))' at error location [2022-11-03 01:46:41,682 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:46:41,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:46:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9, 12] total 36 [2022-11-03 01:46:41,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356271377] [2022-11-03 01:46:41,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:46:41,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 01:46:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 01:46:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=5791, Unknown=0, NotChecked=0, Total=6320 [2022-11-03 01:46:41,687 INFO L87 Difference]: Start difference. First operand 804 states and 964 transitions. Second operand has 36 states, 24 states have (on average 5.625) internal successors, (135), 28 states have internal predecessors, (135), 14 states have call successors, (40), 10 states have call predecessors, (40), 17 states have return successors, (40), 15 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 01:46:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:46,439 INFO L93 Difference]: Finished difference Result 1832 states and 2270 transitions. [2022-11-03 01:46:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-03 01:46:46,440 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 24 states have (on average 5.625) internal successors, (135), 28 states have internal predecessors, (135), 14 states have call successors, (40), 10 states have call predecessors, (40), 17 states have return successors, (40), 15 states have call predecessors, (40), 14 states have call successors, (40) Word has length 100 [2022-11-03 01:46:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:46,444 INFO L225 Difference]: With dead ends: 1832 [2022-11-03 01:46:46,445 INFO L226 Difference]: Without dead ends: 1046 [2022-11-03 01:46:46,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 261 SyntacticMatches, 11 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9483 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2337, Invalid=21533, Unknown=0, NotChecked=0, Total=23870 [2022-11-03 01:46:46,452 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1714 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:46,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 932 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 01:46:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-11-03 01:46:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 675. [2022-11-03 01:46:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 492 states have (on average 1.1666666666666667) internal successors, (574), 494 states have internal predecessors, (574), 101 states have call successors, (101), 81 states have call predecessors, (101), 81 states have return successors, (101), 99 states have call predecessors, (101), 101 states have call successors, (101) [2022-11-03 01:46:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 776 transitions. [2022-11-03 01:46:46,549 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 776 transitions. Word has length 100 [2022-11-03 01:46:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:46,549 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 776 transitions. [2022-11-03 01:46:46,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 24 states have (on average 5.625) internal successors, (135), 28 states have internal predecessors, (135), 14 states have call successors, (40), 10 states have call predecessors, (40), 17 states have return successors, (40), 15 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 01:46:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 776 transitions. [2022-11-03 01:46:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 01:46:46,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:46,552 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:46,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-03 01:46:46,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:46,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:46,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2071943802, now seen corresponding path program 1 times [2022-11-03 01:46:46,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:46,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753767369] [2022-11-03 01:46:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:46:46,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:46,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753767369] [2022-11-03 01:46:46,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753767369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:46,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:46:46,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:46:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714392012] [2022-11-03 01:46:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:46,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:46:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:46:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:46:46,828 INFO L87 Difference]: Start difference. First operand 675 states and 776 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-03 01:46:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:46,995 INFO L93 Difference]: Finished difference Result 1215 states and 1431 transitions. [2022-11-03 01:46:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:46:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 100 [2022-11-03 01:46:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:46,999 INFO L225 Difference]: With dead ends: 1215 [2022-11-03 01:46:46,999 INFO L226 Difference]: Without dead ends: 602 [2022-11-03 01:46:47,000 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:46:47,001 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 99 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:47,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 146 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:46:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-11-03 01:46:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2022-11-03 01:46:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 436 states have (on average 1.1330275229357798) internal successors, (494), 437 states have internal predecessors, (494), 90 states have call successors, (90), 72 states have call predecessors, (90), 72 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2022-11-03 01:46:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 674 transitions. [2022-11-03 01:46:47,076 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 674 transitions. Word has length 100 [2022-11-03 01:46:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:47,077 INFO L495 AbstractCegarLoop]: Abstraction has 599 states and 674 transitions. [2022-11-03 01:46:47,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-03 01:46:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 674 transitions. [2022-11-03 01:46:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:46:47,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:47,079 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:46:47,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:46:47,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1908547995, now seen corresponding path program 1 times [2022-11-03 01:46:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:47,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813745620] [2022-11-03 01:46:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:46:47,275 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:47,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813745620] [2022-11-03 01:46:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813745620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:46:47,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:46:47,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:46:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451360452] [2022-11-03 01:46:47,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:46:47,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:46:47,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:46:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:46:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:46:47,277 INFO L87 Difference]: Start difference. First operand 599 states and 674 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-03 01:46:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:46:47,492 INFO L93 Difference]: Finished difference Result 1067 states and 1207 transitions. [2022-11-03 01:46:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:46:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 101 [2022-11-03 01:46:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:46:47,496 INFO L225 Difference]: With dead ends: 1067 [2022-11-03 01:46:47,496 INFO L226 Difference]: Without dead ends: 560 [2022-11-03 01:46:47,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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:46:47,498 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 47 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:46:47,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:46:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-03 01:46:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 554. [2022-11-03 01:46:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 399 states have (on average 1.1253132832080202) internal successors, (449), 402 states have internal predecessors, (449), 86 states have call successors, (86), 68 states have call predecessors, (86), 68 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-03 01:46:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 621 transitions. [2022-11-03 01:46:47,576 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 621 transitions. Word has length 101 [2022-11-03 01:46:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:46:47,577 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 621 transitions. [2022-11-03 01:46:47,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-03 01:46:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 621 transitions. [2022-11-03 01:46:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-03 01:46:47,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:46:47,580 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:47,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 01:46:47,580 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:46:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:46:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1416939972, now seen corresponding path program 1 times [2022-11-03 01:46:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:46:47,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33789386] [2022-11-03 01:46:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:46:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 56 proven. 58 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-11-03 01:46:48,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:46:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33789386] [2022-11-03 01:46:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33789386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:46:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091160885] [2022-11-03 01:46:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:46:48,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:46:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:46:48,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:46:48,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:46:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:46:48,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:46:48,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:46:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-03 01:46:48,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:46:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-03 01:46:48,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091160885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:46:48,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921006457] [2022-11-03 01:46:48,742 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-03 01:46:48,743 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:46:48,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:46:48,745 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:46:48,745 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:46:55,554 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 31 for LOIs [2022-11-03 01:46:55,562 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 32 for LOIs [2022-11-03 01:46:55,570 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 47 for LOIs [2022-11-03 01:46:55,576 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 17 for LOIs [2022-11-03 01:46:55,578 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 29 for LOIs [2022-11-03 01:46:55,632 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 17 for LOIs [2022-11-03 01:46:55,739 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:47:02,028 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '28848#(and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (<= 1 ~t1_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (= ~m_pc~0 1) (<= 1 ~m_i~0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (<= 0 |#NULL.offset|) (not (= (+ ~local~0 1) ~token~0)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= ~t1_i~0 1) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:47:02,028 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:47:02,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:47:02,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 15 [2022-11-03 01:47:02,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421799055] [2022-11-03 01:47:02,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:47:02,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-03 01:47:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:47:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-03 01:47:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=3432, Unknown=0, NotChecked=0, Total=3782 [2022-11-03 01:47:02,032 INFO L87 Difference]: Start difference. First operand 554 states and 621 transitions. Second operand has 15 states, 14 states have (on average 9.285714285714286) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) [2022-11-03 01:47:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:47:02,568 INFO L93 Difference]: Finished difference Result 726 states and 818 transitions. [2022-11-03 01:47:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 01:47:02,569 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.285714285714286) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) Word has length 154 [2022-11-03 01:47:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:47:02,570 INFO L225 Difference]: With dead ends: 726 [2022-11-03 01:47:02,570 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:47:02,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 410 SyntacticMatches, 13 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2975 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=519, Invalid=5801, Unknown=0, NotChecked=0, Total=6320 [2022-11-03 01:47:02,579 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 229 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:47:02,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 441 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:47:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:47:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:47:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:47:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:47:02,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2022-11-03 01:47:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:47:02,581 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:47:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.285714285714286) internal successors, (130), 13 states have internal predecessors, (130), 4 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (40), 6 states have call predecessors, (40), 4 states have call successors, (40) [2022-11-03 01:47:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:47:02,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:47:02,586 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 01:47:02,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:47:02,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:47:02,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:47:10,798 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2022-11-03 01:47:10,798 INFO L899 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2022-11-03 01:47:10,799 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2022-11-03 01:47:10,799 INFO L899 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2022-11-03 01:47:10,800 INFO L895 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse7 (= ~t1_i~0 1)) (.cse5 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse6 (<= 2 ~E_1~0))) (let ((.cse12 (not (= 2 |old(~m_st~0)|))) (.cse13 (not .cse6)) (.cse3 (not (= ~E_1~0 2))) (.cse1 (not (= ~m_pc~0 1))) (.cse11 (<= 1 ~m_pc~0)) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse16 (not (= |#NULL.offset| 0))) (.cse18 (not (= ~m_pc~0 0))) (.cse19 (not (= ~t1_pc~0 0))) (.cse20 (and .cse9 .cse10 (= ~t1_st~0 0))) (.cse21 (not (= |#NULL.base| 0))) (.cse23 (not (<= 0 |#StackHeapBarrier|))) (.cse17 (not (= ~E_M~0 2))) (.cse22 (= |old(~m_st~0)| 0)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not .cse5)) (.cse4 (not .cse7)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (not (= ~E_1~0 1))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (not (= ~E_M~0 |old(~m_st~0)|)) .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse4 (and .cse5 (= |activate_threads_is_master_triggered_~__retres1~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse11) (not (< ~local~0 ~token~0)) .cse12 .cse13 (not (<= ~token~0 (+ ~local~0 1))) (not (= ~E_M~0 1))) (or .cse15 .cse16 .cse17 .cse18 .cse3 .cse4 .cse19 .cse20 (not (= ~token~0 0)) .cse21 (not .cse22) (= ~T1_E~0 1) .cse23 (= ~M_E~0 0) (= ~M_E~0 1) (not (<= 1 ~m_i~0)) (not (<= ~m_i~0 1)) (= ~T1_E~0 0) .cse14) (or .cse17 .cse22 .cse0 .cse1 .cse2 .cse4 .cse24 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse14) (or (not (<= ~token~0 2147483647)) .cse15 .cse16 .cse17 .cse0 .cse18 .cse4 .cse19 (not (= |old(~m_st~0)| 1)) .cse20 (not (<= 0 (+ ~token~0 2147483648))) .cse21 .cse24 .cse23 .cse14) (or .cse17 .cse22 .cse0 .cse2 (not (<= ~m_pc~0 0)) .cse4 (and .cse8 .cse9 .cse10) .cse24 .cse14)))) [2022-11-03 01:47:10,800 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2022-11-03 01:47:10,801 INFO L895 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse21 (<= 1 ~m_pc~0)) (.cse19 (= ~t1_i~0 1)) (.cse20 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (and .cse19 .cse20 .cse22 .cse23 (= |activate_threads_~tmp~1#1| |activate_threads_is_master_triggered_#res#1|) (= ~t1_st~0 0) (= |activate_threads_is_master_triggered_~__retres1~0#1| |activate_threads_is_master_triggered_#res#1|) (= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse8 (not (= |#NULL.base| 0))) (.cse10 (not (<= 0 |#StackHeapBarrier|))) (.cse5 (not (= ~E_1~0 2))) (.cse16 (and .cse19 .cse20 .cse22 .cse23 .cse21)) (.cse14 (not (= ~m_pc~0 1))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse18 (not (<= 2 ~E_1~0))) (.cse2 (not (= ~E_M~0 2))) (.cse9 (= |old(~m_st~0)| 0)) (.cse12 (not (= ~m_i~0 1))) (.cse15 (not (= ~t1_pc~0 1))) (.cse6 (not .cse19)) (.cse13 (not (= ~E_1~0 1))) (.cse11 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~token~0 0)) .cse8 (not .cse9) (= ~T1_E~0 1) .cse10 (= ~M_E~0 0) (= ~M_E~0 1) (not (<= 1 ~m_i~0)) (not (<= ~m_i~0 1)) (= ~T1_E~0 0) .cse11) (or (not (<= ~token~0 2147483647)) .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse6 .cse7 (not (= |old(~m_st~0)| 1)) (not (<= 0 (+ ~token~0 2147483648))) .cse8 .cse13 .cse10 .cse11) (or .cse12 .cse14 .cse15 .cse5 .cse6 (not (= ~E_M~0 |old(~m_st~0)|)) .cse16 .cse17 .cse18 .cse11) (or .cse2 .cse9 .cse12 .cse14 .cse15 .cse6 .cse13 .cse16 .cse11) (or .cse12 .cse14 .cse15 .cse6 (not (< ~local~0 ~token~0)) .cse17 (and (= |activate_threads_is_master_triggered_~__retres1~0#1| 1) .cse19 .cse20 (= ~m_st~0 0) .cse21) .cse18 (not (<= ~token~0 (+ ~local~0 1))) (not (= ~E_M~0 1))) (or .cse2 .cse9 .cse12 .cse15 (not (<= ~m_pc~0 0)) .cse6 (and .cse20 .cse22 .cse23) .cse13 .cse11)))) [2022-11-03 01:47:10,801 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2022-11-03 01:47:10,801 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse22 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse12 (= ~t1_i~0 1)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse1 (not (= ~m_pc~0 1))) (.cse5 (and .cse22 .cse23 .cse12 .cse13 .cse14)) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse7 (not .cse23)) (.cse0 (not (= ~m_i~0 1))) (.cse2 (not .cse22)) (.cse11 (not (= ~E_1~0 1))) (.cse15 (not (= |old(~t1_st~0)| 0))) (.cse16 (and .cse14 (= ~t1_st~0 0))) (.cse17 (not (= |#NULL.offset| 0))) (.cse9 (not (= ~E_M~0 2))) (.cse18 (not (= ~m_pc~0 0))) (.cse3 (not (= ~E_1~0 2))) (.cse4 (not .cse12)) (.cse19 (not (= ~t1_pc~0 0))) (.cse20 (not (= |#NULL.base| 0))) (.cse10 (= |old(~m_st~0)| 0)) (.cse21 (not (<= 0 |#StackHeapBarrier|))) (.cse8 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_M~0 |old(~m_st~0)|)) .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse0 .cse1 .cse2 .cse4 .cse11 (and .cse12 .cse13 .cse14) .cse8) (or (not (<= ~token~0 2147483647)) .cse15 .cse16 .cse17 .cse9 .cse0 .cse18 .cse4 .cse19 (not (= |old(~m_st~0)| 1)) (not (<= 0 (+ ~token~0 2147483648))) .cse20 .cse11 .cse21 .cse8) (or .cse0 .cse1 .cse2 .cse4 (not (< ~local~0 ~token~0)) .cse5 .cse6 .cse7 (not (<= ~token~0 (+ ~local~0 1))) (not (= ~E_M~0 1))) (or .cse9 .cse10 .cse0 (and .cse13 .cse14) .cse2 (not (<= ~m_pc~0 0)) .cse4 .cse11 .cse8) (or .cse15 .cse16 .cse17 .cse9 .cse18 .cse3 .cse4 .cse19 (not (= ~token~0 0)) .cse20 (not .cse10) (= ~T1_E~0 1) .cse21 (= ~M_E~0 0) (= ~M_E~0 1) (not (<= 1 ~m_i~0)) (not (<= ~m_i~0 1)) (= ~T1_E~0 0) .cse8)))) [2022-11-03 01:47:10,802 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2022-11-03 01:47:10,802 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2022-11-03 01:47:10,802 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse10 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= ~t1_i~0 1))) (let ((.cse0 (not (= ~E_M~0 2))) (.cse1 (= |old(~m_st~0)| 0)) (.cse6 (not (= ~E_1~0 1))) (.cse8 (not (= ~token~0 ~local~0))) (.cse2 (not (= ~m_i~0 1))) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse11)) (.cse7 (and .cse11 .cse10 .cse9))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (<= ~token~0 2147483647)) (not (= |old(~t1_st~0)| 0)) (and .cse9 (= ~t1_st~0 0)) (not (= |#NULL.offset| 0)) .cse0 .cse2 (not (= ~m_pc~0 0)) .cse5 (not (= ~t1_pc~0 0)) (not (= |old(~m_st~0)| 1)) (not (<= 0 (+ ~token~0 2147483648))) (not (= |#NULL.base| 0)) .cse6 (not (<= 0 |#StackHeapBarrier|)) .cse8) (or .cse0 .cse1 .cse2 (and .cse10 .cse9) .cse4 (not (<= ~m_pc~0 0)) .cse5 .cse6 .cse8) (or .cse2 .cse3 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse7 (not (= 2 |old(~m_st~0)|)) (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1))) (not (= ~E_M~0 1)))))) [2022-11-03 01:47:10,803 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2022-11-03 01:47:10,803 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2022-11-03 01:47:10,803 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2022-11-03 01:47:10,803 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse1 (= ~E_M~0 2)) (.cse2 (= ~E_1~0 2)) (.cse0 (not (= 2 |old(~E_1~0)|))) (.cse3 (not (= ~t1_i~0 1))) (.cse4 (not (= ~token~0 ~local~0)))) (and (or (not (= |#NULL.offset| 0)) .cse0 (not (= ~m_pc~0 0)) (not (= 2 |old(~E_M~0)|)) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) .cse1 .cse2) .cse3 (not (= ~t1_pc~0 0)) (= |old(~T1_E~0)| 0) (= |old(~M_E~0)| 1) (not (= ~token~0 0)) (= |old(~T1_E~0)| 1) (not (= |#NULL.base| 0)) (not (= ~m_st~0 0)) (= |old(~M_E~0)| 0) (not (<= 0 |#StackHeapBarrier|)) (not (= ~t1_st~0 0)) (not (<= 1 ~m_i~0)) (not (<= ~m_i~0 1)) .cse4) (or (not (= ~m_st~0 |old(~E_M~0)|)) (and .cse1 .cse2) (not (= ~m_i~0 1)) (not (= ~m_pc~0 1)) (not (= ~t1_pc~0 1)) .cse0 .cse3 (not (= ~m_st~0 2)) .cse4))) [2022-11-03 01:47:10,804 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2022-11-03 01:47:10,804 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2022-11-03 01:47:10,804 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2022-11-03 01:47:10,804 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse2 (not (= ~m_i~0 1))) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse0 (= ~E_M~0 2)) (.cse1 (= ~E_1~0 2)) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~token~0 ~local~0)))) (and (or (not (= ~m_st~0 |old(~E_M~0)|)) (and .cse0 .cse1) .cse2 (not (= ~m_pc~0 1)) (not (= ~t1_pc~0 1)) .cse3 .cse4 (not (= ~m_st~0 2)) .cse5) (or (not (= |#NULL.offset| 0)) .cse2 .cse3 (not (= ~m_pc~0 0)) (not (= 2 |old(~E_M~0)|)) (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) .cse0 .cse1) .cse4 (not (= ~t1_pc~0 0)) (= |old(~T1_E~0)| 0) (not (= ~token~0 0)) (not (= |#NULL.base| 0)) (not (= ~m_st~0 0)) (= |old(~M_E~0)| 0) (not (<= 0 |#StackHeapBarrier|)) (not (= ~t1_st~0 0)) .cse5))) [2022-11-03 01:47:10,804 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2022-11-03 01:47:10,805 INFO L895 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse14 (<= 2 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse6 (<= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 0)) (.cse3 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse15 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (= ~t1_st~0 0)) (.cse7 (= |#NULL.offset| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (= |#NULL.base| 0)) (.cse13 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse16 (= ~m_pc~0 1)) (.cse5 (= ~m_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~token~0 ~local~0)) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~local~0 0) (<= 0 ~token~0) .cse6 .cse7 (<= 0 ~m_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 (<= 2 ~E_1~0) .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse15 .cse16 .cse5 .cse8 (< ~local~0 ~token~0)) (and .cse13 .cse14 .cse1 .cse2 .cse5 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~m_st~0 ~E_M~0) .cse3 (<= 1 ~m_pc~0) .cse15 .cse4 .cse5 (<= ~m_pc~0 1) .cse7 (<= ~token~0 2147483647) .cse8 .cse9 .cse10 (<= 0 (+ ~token~0 2147483648)) .cse11 .cse12) (and .cse13 (= ~m_st~0 2) .cse1 .cse16 .cse5 .cse8 .cse9 .cse10))) [2022-11-03 01:47:10,805 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (not (= ~m_st~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_i~0 1)) (.cse3 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse5 (<= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= 2 ~E_1~0) .cse1 (= ~m_pc~0 1) .cse2 .cse3 .cse4 .cse6) (and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_pc~0 0) .cse1 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (= ~t1_st~0 0) .cse2 (<= ~local~0 0) .cse3 (<= 0 ~token~0) .cse5 (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (= ~m_st~0 1) (<= 0 ~m_pc~0) .cse6 (= ~token~0 ~local~0) (<= 0 |#NULL.offset|) .cse7 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)))) [2022-11-03 01:47:10,805 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 01:47:10,806 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: false [2022-11-03 01:47:10,806 INFO L902 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2022-11-03 01:47:10,806 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,806 INFO L895 garLoopResultBuilder]: At program point L400-1(line 400) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,806 INFO L895 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,807 INFO L895 garLoopResultBuilder]: At program point L451-1(line 451) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,807 INFO L899 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2022-11-03 01:47:10,807 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2022-11-03 01:47:10,807 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2022-11-03 01:47:10,807 INFO L895 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,807 INFO L899 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2022-11-03 01:47:10,808 INFO L895 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= 22 (select |#length| 2)) (= ~T1_E~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~m_st~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~t1_st~0 0) (= ~m_i~0 1) (= (select |#valid| 1) 1) (= ~token~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~E_M~0 2) (= (select .cse0 0) 48) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 01:47:10,808 INFO L895 garLoopResultBuilder]: At program point L421-1(line 421) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= 22 (select |#length| 2)) (= ~T1_E~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~m_st~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~t1_st~0 0) (= ~m_i~0 1) (= (select |#valid| 1) 1) (= ~token~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~E_M~0 2) (= (select .cse0 0) 48) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 01:47:10,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:47:10,809 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2022-11-03 01:47:10,809 INFO L895 garLoopResultBuilder]: At program point L91(lines 91 95) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,809 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~m_st~0 2) (= ~t1_i~0 1) (<= ~token~0 (+ ~local~0 1)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (= ~m_i~0 1) (< ~local~0 ~token~0) (= ~E_M~0 1)) [2022-11-03 01:47:10,809 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2022-11-03 01:47:10,809 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= 22 (select |#length| 2)) (= ~T1_E~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~m_st~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~t1_st~0 0) (= ~m_i~0 1) (= (select |#valid| 1) 1) (= ~token~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~E_M~0 2) (= (select .cse0 0) 48) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 01:47:10,810 INFO L895 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= 22 (select |#length| 2)) (= ~T1_E~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~m_st~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~t1_st~0 0) (= ~m_i~0 1) (= (select |#valid| 1) 1) (= ~token~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~E_M~0 2) (= (select .cse0 0) 48) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 01:47:10,810 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,810 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,811 INFO L895 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_st~0 ~E_M~0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ~m_i~0 1)) (.cse4 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~token~0 ~local~0)) (.cse7 (= ~E_1~0 2))) (or (and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_pc~0 0) .cse0 .cse1 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (= ~t1_st~0 0) .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~token~0 2147483647) .cse5 .cse6 (<= 0 |#NULL.offset|) .cse7 (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-03 01:47:10,811 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-11-03 01:47:10,811 INFO L895 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (not (= ~T1_E~0 0)) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= 22 (select |#length| 2)) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~m_st~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~t1_st~0 0) (= ~m_i~0 1) (not (= ~M_E~0 0)) (= (select |#valid| 1) 1) (= ~token~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~E_M~0 2) (= (select .cse0 0) 48) (= ~token~0 ~local~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-03 01:47:10,811 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1)) (.cse0 (= ~t1_i~0 1)) (.cse1 (= ~E_1~0 1)) (.cse2 (= ~m_i~0 1)) (.cse3 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse7 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~token~0 ~local~0))) (or (and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_pc~0 0) .cse0 .cse1 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (= ~t1_st~0 0) .cse2 .cse3 (= ~m_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (= ~m_st~0 1) (<= ~token~0 2147483647) .cse4 .cse5 (<= 0 |#NULL.offset|) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse6 .cse0 .cse1 (= ~m_pc~0 1) .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse7 (<= ~m_pc~0 0) .cse4 .cse5))) [2022-11-03 01:47:10,812 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2022-11-03 01:47:10,812 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,812 INFO L895 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,812 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse14 (<= 2 ~t1_st~0)) (.cse2 (= ~m_st~0 0)) (.cse6 (<= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 0)) (.cse3 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse15 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (= ~t1_st~0 0)) (.cse7 (= |#NULL.offset| 0)) (.cse11 (<= 0 |#StackHeapBarrier|)) (.cse12 (= |#NULL.base| 0)) (.cse13 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse16 (= ~m_pc~0 1)) (.cse5 (= ~m_i~0 1)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~token~0 ~local~0)) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~local~0 0) (<= 0 ~token~0) .cse6 .cse7 (<= 0 ~m_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 (<= 2 ~E_1~0) .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse15 .cse16 .cse5 .cse8 (< ~local~0 ~token~0)) (and .cse13 .cse14 .cse1 .cse2 .cse5 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 (= ~m_st~0 ~E_M~0) .cse3 (<= 1 ~m_pc~0) .cse15 .cse4 .cse5 (<= ~m_pc~0 1) .cse7 (<= ~token~0 2147483647) .cse8 .cse9 .cse10 (<= 0 (+ ~token~0 2147483648)) .cse11 .cse12) (and .cse13 (= ~m_st~0 2) .cse1 .cse16 .cse5 .cse8 .cse9 .cse10))) [2022-11-03 01:47:10,813 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2022-11-03 01:47:10,813 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2022-11-03 01:47:10,813 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2022-11-03 01:47:10,813 INFO L895 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ ~local~0 1)) (= ~m_pc~0 1) (= ~m_i~0 1) (= |ULTIMATE.start_eval_~tmp~0#1| 1) (not (= ~m_st~0 0)) (= ~E_M~0 2) (< ~local~0 ~token~0)) [2022-11-03 01:47:10,813 INFO L895 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_i~0 1)) (.cse2 (= ~E_M~0 2)) (.cse3 (= ~token~0 ~local~0)) (.cse4 (= ~E_1~0 2))) (or (and (<= 0 |#NULL.base|) (= ~t1_pc~0 0) .cse0 (= ~m_st~0 0) (<= |#NULL.offset| 0) (= ~t1_st~0 0) .cse1 (<= ~local~0 0) (<= 0 ~token~0) (<= |#NULL.base| 0) (<= ~m_pc~0 0) (<= 0 ~m_pc~0) .cse2 .cse3 (<= 0 |#NULL.offset|) .cse4 (<= 0 |#StackHeapBarrier|)) (and (= ~t1_pc~0 1) (= ~m_st~0 2) .cse0 (= ~m_pc~0 1) .cse1 .cse2 .cse3 .cse4))) [2022-11-03 01:47:10,813 INFO L899 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2022-11-03 01:47:10,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-03 01:47:10,814 INFO L895 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 0)) (.cse0 (= ~t1_i~0 1)) (.cse6 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse2 (<= 1 ~m_pc~0)) (.cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse4 (= ~m_i~0 1)) (.cse5 (= ~E_M~0 2)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse9 (<= 0 |#StackHeapBarrier|)) (.cse10 (= |#NULL.base| 0))) (or (and (<= 2 ~E_1~0) .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse5 (< ~local~0 ~token~0)) (and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) .cse0 .cse1 .cse6 (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) .cse4 (<= ~local~0 0) (= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 ~token~0) (<= ~m_pc~0 0) (<= 0 ~m_pc~0) .cse5 .cse7 (<= 0 |#NULL.offset|) .cse8 .cse9 (<= 0 ~t1_pc~0) .cse10) (and (= ~t1_pc~0 0) .cse0 (= ~m_st~0 ~E_M~0) .cse6 .cse2 .cse3 .cse4 (<= ~m_pc~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) .cse5 .cse7 .cse8 (<= 0 (+ ~token~0 2147483648)) .cse9 .cse10))) [2022-11-03 01:47:10,814 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-11-03 01:47:10,814 INFO L899 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2022-11-03 01:47:10,815 INFO L895 garLoopResultBuilder]: At program point L447(lines 447 456) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,815 INFO L899 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2022-11-03 01:47:10,815 INFO L895 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~m_st~0 2) (= ~t1_i~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:47:10,818 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:47:10,820 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:47:10,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:47:10 BoogieIcfgContainer [2022-11-03 01:47:10,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:47:10,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:47:10,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:47:10,859 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:47:10,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:45:57" (3/4) ... [2022-11-03 01:47:10,863 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-03 01:47:10,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-03 01:47:10,875 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2022-11-03 01:47:10,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-03 01:47:10,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 01:47:10,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 01:47:10,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(E_M == \old(m_st))) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token == local)) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || ((((((t1_pc == 1 && __retres1 == 1) && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 1 <= m_pc)) || !(local < token)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((((((!(\old(t1_st) == 0) || !(#NULL == 0)) || !(E_M == 2)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || ((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0)) || !(token == 0)) || !(#NULL == 0)) || !(\old(m_st) == 0)) || T1_E == 1) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || M_E == 1) || !(1 <= m_i)) || !(m_i <= 1)) || T1_E == 0) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_1 == 1)) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(token == local))) && ((((((((((((((!(token <= 2147483647) || !(\old(t1_st) == 0)) || !(#NULL == 0)) || !(E_M == 2)) || !(m_i == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || ((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0)) || !(0 <= token + 2147483648)) || !(#NULL == 0)) || !(E_1 == 1)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0)) || !(E_1 == 1)) || !(token == local)) [2022-11-03 01:47:10,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(#NULL == 0)) || !(E_M == 2)) || !(m_pc == 0)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && tmp == \result) && t1_st == 0) && __retres1 == \result) && __retres1 == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(token == 0)) || !(#NULL == 0)) || !(\old(m_st) == 0)) || T1_E == 1) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || M_E == 1) || !(1 <= m_i)) || !(m_i <= 1)) || T1_E == 0) || !(token == local)) && ((((((((((((((!(token <= 2147483647) || !(\old(t1_st) == 0)) || !(#NULL == 0)) || !(E_M == 2)) || !(m_i == 1)) || !(m_pc == 0)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && tmp == \result) && t1_st == 0) && __retres1 == \result) && __retres1 == 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(#NULL == 0)) || !(E_1 == 1)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(token == local))) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == \old(m_st))) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_1 == 1)) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(token == local))) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(local < token)) || !(2 == \old(m_st))) || ((((__retres1 == 1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && 1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0)) || !(E_1 == 1)) || !(token == local)) [2022-11-03 01:47:10,947 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:47:10,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:47:10,948 INFO L158 Benchmark]: Toolchain (without parser) took 74432.92ms. Allocated memory was 125.8MB in the beginning and 780.1MB in the end (delta: 654.3MB). Free memory was 83.9MB in the beginning and 344.9MB in the end (delta: -261.1MB). Peak memory consumption was 391.5MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,948 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:47:10,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.94ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 96.6MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.12ms. Allocated memory is still 125.8MB. Free memory was 96.6MB in the beginning and 94.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,949 INFO L158 Benchmark]: Boogie Preprocessor took 27.10ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:47:10,950 INFO L158 Benchmark]: RCFGBuilder took 730.84ms. Allocated memory is still 125.8MB. Free memory was 93.1MB in the beginning and 63.8MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,950 INFO L158 Benchmark]: TraceAbstraction took 73127.94ms. Allocated memory was 125.8MB in the beginning and 780.1MB in the end (delta: 654.3MB). Free memory was 63.1MB in the beginning and 350.2MB in the end (delta: -287.0MB). Peak memory consumption was 444.3MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,951 INFO L158 Benchmark]: Witness Printer took 88.80ms. Allocated memory is still 780.1MB. Free memory was 350.2MB in the beginning and 344.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:47:10,952 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 125.8MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.94ms. Allocated memory is still 125.8MB. Free memory was 83.7MB in the beginning and 96.6MB in the end (delta: -12.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.12ms. Allocated memory is still 125.8MB. Free memory was 96.6MB in the beginning and 94.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.10ms. Allocated memory is still 125.8MB. Free memory was 94.6MB in the beginning and 93.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 730.84ms. Allocated memory is still 125.8MB. Free memory was 93.1MB in the beginning and 63.8MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 73127.94ms. Allocated memory was 125.8MB in the beginning and 780.1MB in the end (delta: 654.3MB). Free memory was 63.1MB in the beginning and 350.2MB in the end (delta: -287.0MB). Peak memory consumption was 444.3MB. Max. memory is 16.1GB. * Witness Printer took 88.80ms. Allocated memory is still 780.1MB. Free memory was 350.2MB in the beginning and 344.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.0s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3050 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3021 mSDsluCounter, 3902 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2961 mSDsCounter, 1412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5540 IncrementalHoareTripleChecker+Invalid, 6952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1412 mSolverCounterUnsat, 1362 mSDtfsCounter, 5540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1684 GetRequests, 1299 SyntacticMatches, 25 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14900 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=10, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 837 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 1286 PreInvPairs, 1386 NumberOfFragments, 3334 HoareAnnotationTreeSize, 1286 FomulaSimplifications, 2528 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 37 FomulaSimplificationsInter, 26269 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1906 NumberOfCodeBlocks, 1871 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2233 ConstructedInterpolants, 0 QuantifiedInterpolants, 4441 SizeOfPredicates, 12 NumberOfNonLiveVariables, 2623 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 1446/1650 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 4.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 7, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 83, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 81, TOOLS_POST_TIME: 2.4s, TOOLS_POST_CALL_APPLICATIONS: 63, TOOLS_POST_CALL_TIME: 1.0s, TOOLS_POST_RETURN_APPLICATIONS: 50, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 192, TOOLS_QUANTIFIERELIM_TIME: 3.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 225, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 72, DOMAIN_JOIN_TIME: 0.7s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 4, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 83, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 1.3s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.3s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 4, CALL_SUMMARIZER_APPLICATIONS: 50, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 2763, DAG_COMPRESSION_RETAINED_NODES: 220, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == 0) && kernel_st == 1) && t1_st == 0) && m_i == 1) && local <= 0) && 0 <= token) && m_pc <= 0) && #NULL == 0) && 0 <= m_pc) && E_M == 2) && token == local) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && m_st == 0) && token <= local + 1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_M == 2) && local < token)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t1_i == 1) && m_st == 0) && m_i == 1) && tmp == 1) && m_pc <= 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && kernel_st == 1) && 1 <= m_pc) && !(tmp == 0)) && t1_st == 0) && m_i == 1) && m_pc <= 1) && #NULL == 0) && token <= 2147483647) && E_M == 2) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(t1_st) == 0) || !(#NULL == 0)) || !(E_M == 2)) || !(m_pc == 0)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && tmp == \result) && t1_st == 0) && __retres1 == \result) && __retres1 == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(token == 0)) || !(#NULL == 0)) || !(\old(m_st) == 0)) || T1_E == 1) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || M_E == 1) || !(1 <= m_i)) || !(m_i <= 1)) || T1_E == 0) || !(token == local)) && ((((((((((((((!(token <= 2147483647) || !(\old(t1_st) == 0)) || !(#NULL == 0)) || !(E_M == 2)) || !(m_i == 1)) || !(m_pc == 0)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && tmp == \result) && t1_st == 0) && __retres1 == \result) && __retres1 == 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || !(0 <= token + 2147483648)) || !(#NULL == 0)) || !(E_1 == 1)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(token == local))) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == \old(m_st))) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_1 == 1)) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(token == local))) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(local < token)) || !(2 == \old(m_st))) || ((((__retres1 == 1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && 1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0)) || !(E_1 == 1)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= #NULL && t1_pc == 0) && t1_i == 1) && m_st == 0) && #NULL <= 0) && t1_st == 0) && m_i == 1) && local <= 0) && 0 <= token) && #NULL <= 0) && m_pc <= 0) && 0 <= m_pc) && E_M == 2) && token == local) && 0 <= #NULL) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) || (((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((unknown-#length-unknown[3] == 12 && t1_pc == 0) && t1_i == 1) && 22 == unknown-#length-unknown[2]) && T1_E == 2) && kernel_st == 0) && m_st == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && t1_st == 0) && m_i == 1) && \valid[1] == 1) && token == 0) && m_pc == 0) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && E_M == 2) && unknown-#memory_int-unknown[1][0] == 48) && token == local) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp_ndt_1 <= 2147483647 && t1_pc == 0) && t1_i == 1) && m_st == E_M) && kernel_st == 1) && 0 <= tmp_ndt_1 + 2147483648) && #NULL <= 0) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && !(tmp_ndt_1 == 0)) && token <= 2147483647) && E_M == 2) && token == local) && 0 <= #NULL) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && m_pc == 1) && m_i == 1) && tmp == 1) && E_M == 2) && token == local) && E_1 == 2) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && t1_i == 1) && m_i == 1) && tmp == 1) && !(m_st == 0)) && m_pc <= 0) && E_M == 2) && E_1 == 2) || (((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && !(m_st == 0)) && E_M == 2)) || ((((((((((((((((((((tmp_ndt_1 <= 2147483647 && t1_pc == 0) && t1_i == 1) && kernel_st == 1) && 0 <= tmp_ndt_1 + 2147483648) && #NULL <= 0) && t1_st == 0) && m_i == 1) && local <= 0) && tmp == 1) && 0 <= token) && m_pc <= 0) && !(tmp_ndt_1 == 0)) && m_st == 1) && 0 <= m_pc) && E_M == 2) && token == local) && 0 <= #NULL) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && m_pc == 1) && m_i == 1) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((2 <= E_1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_M == 2) && local < token) || (((((((((((((((((((tmp_ndt_1 <= 2147483647 && t1_i == 1) && m_st == 0) && kernel_st == 1) && 0 <= tmp_ndt_1 + 2147483648) && t1_pc <= 0) && #NULL <= 0) && m_i == 1) && local <= 0) && tmp == 1) && 0 <= token) && m_pc <= 0) && 0 <= m_pc) && E_M == 2) && token == local) && 0 <= #NULL) && E_1 == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= t1_pc) && #NULL == 0)) || (((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && kernel_st == 1) && 1 <= m_pc) && !(tmp == 0)) && m_i == 1) && m_pc <= 1) && #NULL == 0) && token <= 2147483647) && E_M == 2) && token == local) && E_1 == 2) && 0 <= token + 2147483648) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(E_M == \old(m_st))) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token == local)) && (((((((((!(m_i == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || ((((((t1_pc == 1 && __retres1 == 1) && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 1 <= m_pc)) || !(local < token)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && ((((((((((((((((((!(\old(t1_st) == 0) || !(#NULL == 0)) || !(E_M == 2)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || ((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0)) || !(token == 0)) || !(#NULL == 0)) || !(\old(m_st) == 0)) || T1_E == 1) || !(0 <= unknown-#StackHeapBarrier-unknown)) || M_E == 0) || M_E == 1) || !(1 <= m_i)) || !(m_i <= 1)) || T1_E == 0) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_1 == 1)) || ((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc)) || !(token == local))) && ((((((((((((((!(token <= 2147483647) || !(\old(t1_st) == 0)) || !(#NULL == 0)) || !(E_M == 2)) || !(m_i == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(\old(m_st) == 1)) || ((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0)) || !(0 <= token + 2147483648)) || !(#NULL == 0)) || !(E_1 == 1)) || !(0 <= unknown-#StackHeapBarrier-unknown)) || !(token == local))) && ((((((((!(E_M == 2) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0)) || !(E_1 == 1)) || !(token == local)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= local + 1) && m_pc == 1) && m_i == 1) && tmp == 1) && !(m_st == 0)) && E_M == 2) && local < token RESULT: Ultimate proved your program to be correct! [2022-11-03 01:47:11,028 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1e0efd03-84e9-4d09-8cc6-1bf8369080c1/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 Result: TRUE