./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:46:16,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:46:16,341 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:46:16,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:46:16,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:46:16,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:46:16,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:46:16,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:46:16,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:46:16,399 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:46:16,400 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:46:16,401 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:46:16,401 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:46:16,401 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:46:16,401 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:46:16,401 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:46:16,401 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:46:16,402 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:46:16,402 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:46:16,403 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:46:16,403 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:46:16,403 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:46:16,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:46:16,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:46:16,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:46:16,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:46:16,405 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:46:16,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:46:16,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:46:16,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:46:16,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:46:16,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:46:16,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:46:16,409 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:46:16,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:46:16,409 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab [2024-11-14 03:46:16,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:46:16,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:46:16,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:46:16,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:46:16,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:46:16,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i Unable to find full path for "g++" [2024-11-14 03:46:19,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:46:19,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:46:19,558 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-14 03:46:19,574 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/data/b8abe051d/78e41c436eb0406e980415e39e2d8691/FLAG1ad5a7b67 [2024-11-14 03:46:19,783 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/data/b8abe051d/78e41c436eb0406e980415e39e2d8691 [2024-11-14 03:46:19,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:46:19,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:46:19,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:46:19,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:46:19,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:46:19,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:46:19" (1/1) ... [2024-11-14 03:46:19,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f58cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:19, skipping insertion in model container [2024-11-14 03:46:19,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:46:19" (1/1) ... [2024-11-14 03:46:19,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:46:20,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:46:20,447 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:46:20,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:46:20,666 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:46:20,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20 WrapperNode [2024-11-14 03:46:20,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:46:20,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:46:20,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:46:20,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:46:20,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,759 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-11-14 03:46:20,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:46:20,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:46:20,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:46:20,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:46:20,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:46:20,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:46:20,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:46:20,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:46:20,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (1/1) ... [2024-11-14 03:46:20,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:46:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:20,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:46:20,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:46:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:46:20,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-14 03:46:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-14 03:46:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-11-14 03:46:20,923 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-11-14 03:46:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:46:20,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-11-14 03:46:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-11-14 03:46:20,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-11-14 03:46:20,924 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-11-14 03:46:20,925 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-11-14 03:46:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-11-14 03:46:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-11-14 03:46:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:46:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-11-14 03:46:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-11-14 03:46:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:46:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-11-14 03:46:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-11-14 03:46:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:46:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-11-14 03:46:20,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-11-14 03:46:20,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:46:20,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:46:21,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:46:21,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:46:22,583 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-14 03:46:22,583 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:46:22,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:46:22,726 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:46:22,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:46:22 BoogieIcfgContainer [2024-11-14 03:46:22,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:46:22,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:46:22,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:46:22,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:46:22,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:46:19" (1/3) ... [2024-11-14 03:46:22,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec99b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:46:22, skipping insertion in model container [2024-11-14 03:46:22,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:46:20" (2/3) ... [2024-11-14 03:46:22,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec99b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:46:22, skipping insertion in model container [2024-11-14 03:46:22,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:46:22" (3/3) ... [2024-11-14 03:46:22,749 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-11-14 03:46:22,769 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:46:22,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG system-with-recursion.i that has 10 procedures, 352 locations, 1 initial locations, 1 loop locations, and 158 error locations. [2024-11-14 03:46:22,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:46:22,871 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@27841a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:46:22,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-11-14 03:46:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 352 states, 155 states have (on average 2.1806451612903226) internal successors, (338), 313 states have internal predecessors, (338), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-14 03:46:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:46:22,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:22,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:46:22,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:22,896 INFO L85 PathProgramCache]: Analyzing trace with hash 591732502, now seen corresponding path program 1 times [2024-11-14 03:46:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587874065] [2024-11-14 03:46:22,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:23,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587874065] [2024-11-14 03:46:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587874065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054762044] [2024-11-14 03:46:23,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:23,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:23,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:23,457 INFO L87 Difference]: Start difference. First operand has 352 states, 155 states have (on average 2.1806451612903226) internal successors, (338), 313 states have internal predecessors, (338), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:24,209 INFO L93 Difference]: Finished difference Result 376 states and 437 transitions. [2024-11-14 03:46:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2024-11-14 03:46:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:24,232 INFO L225 Difference]: With dead ends: 376 [2024-11-14 03:46:24,233 INFO L226 Difference]: Without dead ends: 375 [2024-11-14 03:46:24,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:24,238 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 350 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:24,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 223 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:24,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-14 03:46:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 346. [2024-11-14 03:46:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 168 states have (on average 1.9880952380952381) internal successors, (334), 302 states have internal predecessors, (334), 32 states have call successors, (32), 11 states have call predecessors, (32), 11 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-14 03:46:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 403 transitions. [2024-11-14 03:46:24,333 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 403 transitions. Word has length 5 [2024-11-14 03:46:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:24,334 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 403 transitions. [2024-11-14 03:46:24,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 403 transitions. [2024-11-14 03:46:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 03:46:24,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:24,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 03:46:24,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:46:24,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:24,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash 591732503, now seen corresponding path program 1 times [2024-11-14 03:46:24,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:24,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471670697] [2024-11-14 03:46:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:24,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471670697] [2024-11-14 03:46:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471670697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:24,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:46:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760854193] [2024-11-14 03:46:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:24,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:24,687 INFO L87 Difference]: Start difference. First operand 346 states and 403 transitions. Second operand has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:25,432 INFO L93 Difference]: Finished difference Result 427 states and 511 transitions. [2024-11-14 03:46:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:46:25,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5 [2024-11-14 03:46:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:25,437 INFO L225 Difference]: With dead ends: 427 [2024-11-14 03:46:25,437 INFO L226 Difference]: Without dead ends: 427 [2024-11-14 03:46:25,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:25,438 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 114 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:25,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 544 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-14 03:46:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 406. [2024-11-14 03:46:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 217 states have (on average 1.8617511520737327) internal successors, (404), 347 states have internal predecessors, (404), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-14 03:46:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 500 transitions. [2024-11-14 03:46:25,511 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 500 transitions. Word has length 5 [2024-11-14 03:46:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:25,512 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 500 transitions. [2024-11-14 03:46:25,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 500 transitions. [2024-11-14 03:46:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:46:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:25,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:46:25,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:25,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1761290575, now seen corresponding path program 1 times [2024-11-14 03:46:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:25,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615394376] [2024-11-14 03:46:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:25,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615394376] [2024-11-14 03:46:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615394376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:46:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622761513] [2024-11-14 03:46:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:46:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:46:25,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:46:25,821 INFO L87 Difference]: Start difference. First operand 406 states and 500 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:26,543 INFO L93 Difference]: Finished difference Result 405 states and 499 transitions. [2024-11-14 03:46:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-14 03:46:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:26,547 INFO L225 Difference]: With dead ends: 405 [2024-11-14 03:46:26,547 INFO L226 Difference]: Without dead ends: 405 [2024-11-14 03:46:26,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:46:26,548 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 2 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:26,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 901 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-14 03:46:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-14 03:46:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 217 states have (on average 1.8571428571428572) internal successors, (403), 346 states have internal predecessors, (403), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-14 03:46:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2024-11-14 03:46:26,573 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 8 [2024-11-14 03:46:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:26,574 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2024-11-14 03:46:26,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2024-11-14 03:46:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 03:46:26,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:26,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:46:26,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:26,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1761290576, now seen corresponding path program 1 times [2024-11-14 03:46:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:26,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877201485] [2024-11-14 03:46:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:26,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:26,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:26,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877201485] [2024-11-14 03:46:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877201485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:26,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:46:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544150978] [2024-11-14 03:46:26,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:26,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:46:26,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:26,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:46:26,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:46:26,914 INFO L87 Difference]: Start difference. First operand 405 states and 499 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:27,693 INFO L93 Difference]: Finished difference Result 404 states and 498 transitions. [2024-11-14 03:46:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:27,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-11-14 03:46:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:27,700 INFO L225 Difference]: With dead ends: 404 [2024-11-14 03:46:27,700 INFO L226 Difference]: Without dead ends: 404 [2024-11-14 03:46:27,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:46:27,702 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:27,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 879 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-14 03:46:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-14 03:46:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 217 states have (on average 1.8525345622119815) internal successors, (402), 345 states have internal predecessors, (402), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-14 03:46:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 498 transitions. [2024-11-14 03:46:27,753 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 498 transitions. Word has length 8 [2024-11-14 03:46:27,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:27,754 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 498 transitions. [2024-11-14 03:46:27,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:27,754 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 498 transitions. [2024-11-14 03:46:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:46:27,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:27,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:27,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:46:27,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:27,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1063779324, now seen corresponding path program 1 times [2024-11-14 03:46:27,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:27,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304451810] [2024-11-14 03:46:27,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:27,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:27,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304451810] [2024-11-14 03:46:27,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304451810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:27,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:27,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:27,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931461589] [2024-11-14 03:46:27,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:27,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:27,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:27,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:27,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:27,889 INFO L87 Difference]: Start difference. First operand 404 states and 498 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:28,238 INFO L93 Difference]: Finished difference Result 403 states and 497 transitions. [2024-11-14 03:46:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 03:46:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:28,242 INFO L225 Difference]: With dead ends: 403 [2024-11-14 03:46:28,243 INFO L226 Difference]: Without dead ends: 403 [2024-11-14 03:46:28,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:28,244 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:28,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:46:28,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-14 03:46:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-14 03:46:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 217 states have (on average 1.847926267281106) internal successors, (401), 344 states have internal predecessors, (401), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-14 03:46:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 497 transitions. [2024-11-14 03:46:28,280 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 497 transitions. Word has length 12 [2024-11-14 03:46:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:28,280 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 497 transitions. [2024-11-14 03:46:28,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 497 transitions. [2024-11-14 03:46:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:46:28,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:28,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:28,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:46:28,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:28,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:28,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1063779323, now seen corresponding path program 1 times [2024-11-14 03:46:28,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:28,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072007120] [2024-11-14 03:46:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:28,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072007120] [2024-11-14 03:46:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072007120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286157564] [2024-11-14 03:46:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:28,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:28,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:28,476 INFO L87 Difference]: Start difference. First operand 403 states and 497 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:28,868 INFO L93 Difference]: Finished difference Result 402 states and 496 transitions. [2024-11-14 03:46:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 03:46:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:28,872 INFO L225 Difference]: With dead ends: 402 [2024-11-14 03:46:28,872 INFO L226 Difference]: Without dead ends: 402 [2024-11-14 03:46:28,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:28,877 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:28,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:46:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-14 03:46:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-14 03:46:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 217 states have (on average 1.8433179723502304) internal successors, (400), 343 states have internal predecessors, (400), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-14 03:46:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2024-11-14 03:46:28,916 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 12 [2024-11-14 03:46:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2024-11-14 03:46:28,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2024-11-14 03:46:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:46:28,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:28,919 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:28,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:46:28,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:28,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1315127787, now seen corresponding path program 1 times [2024-11-14 03:46:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056061438] [2024-11-14 03:46:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:29,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056061438] [2024-11-14 03:46:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056061438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717340265] [2024-11-14 03:46:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:29,447 INFO L87 Difference]: Start difference. First operand 402 states and 496 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:30,662 INFO L93 Difference]: Finished difference Result 430 states and 539 transitions. [2024-11-14 03:46:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-14 03:46:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:30,666 INFO L225 Difference]: With dead ends: 430 [2024-11-14 03:46:30,668 INFO L226 Difference]: Without dead ends: 430 [2024-11-14 03:46:30,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:30,670 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 34 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:30,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1174 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:46:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-14 03:46:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 419. [2024-11-14 03:46:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 357 states have internal predecessors, (421), 43 states have call successors, (43), 20 states have call predecessors, (43), 20 states have return successors, (57), 41 states have call predecessors, (57), 43 states have call successors, (57) [2024-11-14 03:46:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2024-11-14 03:46:30,712 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 20 [2024-11-14 03:46:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2024-11-14 03:46:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2024-11-14 03:46:30,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:46:30,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:30,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:46:30,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:30,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1315127788, now seen corresponding path program 1 times [2024-11-14 03:46:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667918919] [2024-11-14 03:46:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:31,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667918919] [2024-11-14 03:46:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667918919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:31,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4593533] [2024-11-14 03:46:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:31,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:31,005 INFO L87 Difference]: Start difference. First operand 419 states and 521 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:31,889 INFO L93 Difference]: Finished difference Result 429 states and 538 transitions. [2024-11-14 03:46:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-14 03:46:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:31,893 INFO L225 Difference]: With dead ends: 429 [2024-11-14 03:46:31,893 INFO L226 Difference]: Without dead ends: 429 [2024-11-14 03:46:31,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:31,895 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 33 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:31,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1248 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-14 03:46:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 419. [2024-11-14 03:46:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 231 states have (on average 1.8181818181818181) internal successors, (420), 357 states have internal predecessors, (420), 43 states have call successors, (43), 20 states have call predecessors, (43), 20 states have return successors, (57), 41 states have call predecessors, (57), 43 states have call successors, (57) [2024-11-14 03:46:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 520 transitions. [2024-11-14 03:46:31,929 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 520 transitions. Word has length 20 [2024-11-14 03:46:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 520 transitions. [2024-11-14 03:46:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 520 transitions. [2024-11-14 03:46:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:46:31,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:31,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:31,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:46:31,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:31,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2125046597, now seen corresponding path program 1 times [2024-11-14 03:46:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747072130] [2024-11-14 03:46:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:32,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747072130] [2024-11-14 03:46:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747072130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:32,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007156342] [2024-11-14 03:46:32,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:32,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:32,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:32,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:32,187 INFO L87 Difference]: Start difference. First operand 419 states and 520 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:33,086 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2024-11-14 03:46:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-14 03:46:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:33,090 INFO L225 Difference]: With dead ends: 509 [2024-11-14 03:46:33,090 INFO L226 Difference]: Without dead ends: 509 [2024-11-14 03:46:33,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:33,091 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 141 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:33,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1203 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-14 03:46:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 451. [2024-11-14 03:46:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 254 states have (on average 1.7992125984251968) internal successors, (457), 383 states have internal predecessors, (457), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (69), 43 states have call predecessors, (69), 49 states have call successors, (69) [2024-11-14 03:46:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 575 transitions. [2024-11-14 03:46:33,115 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 575 transitions. Word has length 21 [2024-11-14 03:46:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:33,116 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 575 transitions. [2024-11-14 03:46:33,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 575 transitions. [2024-11-14 03:46:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:46:33,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:33,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:33,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:46:33,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:33,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2125046596, now seen corresponding path program 1 times [2024-11-14 03:46:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:33,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645018982] [2024-11-14 03:46:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:33,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:33,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:33,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645018982] [2024-11-14 03:46:33,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645018982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:33,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:33,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:46:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834402426] [2024-11-14 03:46:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:33,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:46:33,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:46:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:33,549 INFO L87 Difference]: Start difference. First operand 451 states and 575 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:34,961 INFO L93 Difference]: Finished difference Result 436 states and 523 transitions. [2024-11-14 03:46:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:34,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-14 03:46:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:34,964 INFO L225 Difference]: With dead ends: 436 [2024-11-14 03:46:34,965 INFO L226 Difference]: Without dead ends: 436 [2024-11-14 03:46:34,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:46:34,966 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 379 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:34,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 952 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:46:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-14 03:46:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 386. [2024-11-14 03:46:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 204 states have (on average 1.8333333333333333) internal successors, (374), 333 states have internal predecessors, (374), 39 states have call successors, (39), 18 states have call predecessors, (39), 18 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2024-11-14 03:46:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 464 transitions. [2024-11-14 03:46:34,987 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 464 transitions. Word has length 21 [2024-11-14 03:46:34,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:34,987 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 464 transitions. [2024-11-14 03:46:34,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:46:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 464 transitions. [2024-11-14 03:46:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:46:34,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:34,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:46:34,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -48239041, now seen corresponding path program 1 times [2024-11-14 03:46:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173279309] [2024-11-14 03:46:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:35,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:35,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173279309] [2024-11-14 03:46:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173279309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:35,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:46:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203949173] [2024-11-14 03:46:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:35,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:35,138 INFO L87 Difference]: Start difference. First operand 386 states and 464 transitions. 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), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:35,316 INFO L93 Difference]: Finished difference Result 397 states and 475 transitions. [2024-11-14 03:46:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:46:35,317 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), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-14 03:46:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:35,320 INFO L225 Difference]: With dead ends: 397 [2024-11-14 03:46:35,320 INFO L226 Difference]: Without dead ends: 395 [2024-11-14 03:46:35,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:46:35,321 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 15 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:35,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 932 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-14 03:46:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-14 03:46:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 210 states have (on average 1.8238095238095238) internal successors, (383), 339 states have internal predecessors, (383), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2024-11-14 03:46:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 473 transitions. [2024-11-14 03:46:35,339 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 473 transitions. Word has length 30 [2024-11-14 03:46:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:35,339 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 473 transitions. [2024-11-14 03:46:35,339 INFO L472 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), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 473 transitions. [2024-11-14 03:46:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:46:35,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:35,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:35,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:46:35,341 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1564778846, now seen corresponding path program 1 times [2024-11-14 03:46:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934119436] [2024-11-14 03:46:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:35,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934119436] [2024-11-14 03:46:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934119436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:35,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:35,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:46:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176240887] [2024-11-14 03:46:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:35,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:46:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:46:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:35,749 INFO L87 Difference]: Start difference. First operand 393 states and 473 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:46:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:36,751 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2024-11-14 03:46:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-11-14 03:46:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:36,753 INFO L225 Difference]: With dead ends: 436 [2024-11-14 03:46:36,754 INFO L226 Difference]: Without dead ends: 430 [2024-11-14 03:46:36,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:46:36,755 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 126 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:36,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1766 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:46:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-14 03:46:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 393. [2024-11-14 03:46:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 210 states have (on average 1.819047619047619) internal successors, (382), 339 states have internal predecessors, (382), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (51), 34 states have call predecessors, (51), 39 states have call successors, (51) [2024-11-14 03:46:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 472 transitions. [2024-11-14 03:46:36,772 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 472 transitions. Word has length 29 [2024-11-14 03:46:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:36,773 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 472 transitions. [2024-11-14 03:46:36,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:46:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 472 transitions. [2024-11-14 03:46:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 03:46:36,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:36,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:36,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:46:36,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:36,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -810644387, now seen corresponding path program 1 times [2024-11-14 03:46:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943623750] [2024-11-14 03:46:36,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:37,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:37,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943623750] [2024-11-14 03:46:37,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943623750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:37,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:46:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222726109] [2024-11-14 03:46:37,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:37,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:46:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:46:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:37,123 INFO L87 Difference]: Start difference. First operand 393 states and 472 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:38,437 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2024-11-14 03:46:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:46:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-14 03:46:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:38,442 INFO L225 Difference]: With dead ends: 579 [2024-11-14 03:46:38,442 INFO L226 Difference]: Without dead ends: 575 [2024-11-14 03:46:38,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:46:38,446 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 435 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:38,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1071 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:46:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-14 03:46:38,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 510. [2024-11-14 03:46:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 295 states have (on average 1.7118644067796611) internal successors, (505), 424 states have internal predecessors, (505), 53 states have call successors, (53), 28 states have call predecessors, (53), 37 states have return successors, (136), 57 states have call predecessors, (136), 53 states have call successors, (136) [2024-11-14 03:46:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 694 transitions. [2024-11-14 03:46:38,485 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 694 transitions. Word has length 32 [2024-11-14 03:46:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:38,485 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 694 transitions. [2024-11-14 03:46:38,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:38,485 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2024-11-14 03:46:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:46:38,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:38,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:38,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:46:38,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:38,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1614096765, now seen corresponding path program 1 times [2024-11-14 03:46:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:38,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963951292] [2024-11-14 03:46:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:38,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:39,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:39,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963951292] [2024-11-14 03:46:39,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963951292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:39,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:39,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:46:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910540382] [2024-11-14 03:46:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:39,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:46:39,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:39,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:46:39,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:39,045 INFO L87 Difference]: Start difference. First operand 510 states and 694 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:40,021 INFO L93 Difference]: Finished difference Result 534 states and 750 transitions. [2024-11-14 03:46:40,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:46:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 03:46:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:40,026 INFO L225 Difference]: With dead ends: 534 [2024-11-14 03:46:40,026 INFO L226 Difference]: Without dead ends: 534 [2024-11-14 03:46:40,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:40,028 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 427 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:40,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 263 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:46:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-14 03:46:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 491. [2024-11-14 03:46:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 295 states have (on average 1.6067796610169491) internal successors, (474), 405 states have internal predecessors, (474), 53 states have call successors, (53), 28 states have call predecessors, (53), 37 states have return successors, (136), 57 states have call predecessors, (136), 53 states have call successors, (136) [2024-11-14 03:46:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 663 transitions. [2024-11-14 03:46:40,059 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 663 transitions. Word has length 33 [2024-11-14 03:46:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:40,060 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 663 transitions. [2024-11-14 03:46:40,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 663 transitions. [2024-11-14 03:46:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:46:40,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:40,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:40,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:46:40,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:40,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1502607751, now seen corresponding path program 1 times [2024-11-14 03:46:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616345827] [2024-11-14 03:46:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:41,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616345827] [2024-11-14 03:46:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616345827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:41,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-14 03:46:41,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34193881] [2024-11-14 03:46:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:41,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:46:41,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:41,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:46:41,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:46:41,263 INFO L87 Difference]: Start difference. First operand 491 states and 663 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:42,578 INFO L93 Difference]: Finished difference Result 548 states and 789 transitions. [2024-11-14 03:46:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:46:42,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-14 03:46:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:42,582 INFO L225 Difference]: With dead ends: 548 [2024-11-14 03:46:42,583 INFO L226 Difference]: Without dead ends: 548 [2024-11-14 03:46:42,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:46:42,584 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 360 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:42,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 963 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:46:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-14 03:46:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 496. [2024-11-14 03:46:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 299 states have (on average 1.6020066889632107) internal successors, (479), 408 states have internal predecessors, (479), 54 states have call successors, (54), 29 states have call predecessors, (54), 37 states have return successors, (138), 58 states have call predecessors, (138), 54 states have call successors, (138) [2024-11-14 03:46:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 671 transitions. [2024-11-14 03:46:42,614 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 671 transitions. Word has length 34 [2024-11-14 03:46:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:42,614 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 671 transitions. [2024-11-14 03:46:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 671 transitions. [2024-11-14 03:46:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:46:42,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:42,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:46:42,616 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1502607750, now seen corresponding path program 1 times [2024-11-14 03:46:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123800299] [2024-11-14 03:46:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:44,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123800299] [2024-11-14 03:46:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123800299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:44,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 03:46:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848623121] [2024-11-14 03:46:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:46:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:46:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:46:44,355 INFO L87 Difference]: Start difference. First operand 496 states and 671 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:46,578 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2024-11-14 03:46:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:46:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-14 03:46:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:46,583 INFO L225 Difference]: With dead ends: 547 [2024-11-14 03:46:46,584 INFO L226 Difference]: Without dead ends: 547 [2024-11-14 03:46:46,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:46:46,585 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 471 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:46,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1208 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 03:46:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-14 03:46:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 496. [2024-11-14 03:46:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 299 states have (on average 1.5986622073578596) internal successors, (478), 408 states have internal predecessors, (478), 54 states have call successors, (54), 29 states have call predecessors, (54), 37 states have return successors, (138), 58 states have call predecessors, (138), 54 states have call successors, (138) [2024-11-14 03:46:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 670 transitions. [2024-11-14 03:46:46,643 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 670 transitions. Word has length 34 [2024-11-14 03:46:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:46,644 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 670 transitions. [2024-11-14 03:46:46,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:46:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 670 transitions. [2024-11-14 03:46:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:46:46,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:46,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:46,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:46:46,648 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:46,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash -897033350, now seen corresponding path program 1 times [2024-11-14 03:46:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189913728] [2024-11-14 03:46:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:46,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189913728] [2024-11-14 03:46:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189913728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384740861] [2024-11-14 03:46:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:46,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:46,785 INFO L87 Difference]: Start difference. First operand 496 states and 670 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:47,150 INFO L93 Difference]: Finished difference Result 494 states and 668 transitions. [2024-11-14 03:46:47,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-14 03:46:47,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:47,155 INFO L225 Difference]: With dead ends: 494 [2024-11-14 03:46:47,156 INFO L226 Difference]: Without dead ends: 494 [2024-11-14 03:46:47,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:47,157 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:47,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 470 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:46:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-14 03:46:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-14 03:46:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 299 states have (on average 1.5919732441471572) internal successors, (476), 406 states have internal predecessors, (476), 54 states have call successors, (54), 29 states have call predecessors, (54), 37 states have return successors, (138), 58 states have call predecessors, (138), 54 states have call successors, (138) [2024-11-14 03:46:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 668 transitions. [2024-11-14 03:46:47,193 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 668 transitions. Word has length 36 [2024-11-14 03:46:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:47,195 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 668 transitions. [2024-11-14 03:46:47,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 668 transitions. [2024-11-14 03:46:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:46:47,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:47,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:47,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:46:47,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:47,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -897033349, now seen corresponding path program 1 times [2024-11-14 03:46:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191466924] [2024-11-14 03:46:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:47,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:47,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191466924] [2024-11-14 03:46:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191466924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:47,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:47,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:46:47,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955592034] [2024-11-14 03:46:47,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:47,375 INFO L87 Difference]: Start difference. First operand 494 states and 668 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:47,697 INFO L93 Difference]: Finished difference Result 492 states and 666 transitions. [2024-11-14 03:46:47,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:47,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-14 03:46:47,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:47,701 INFO L225 Difference]: With dead ends: 492 [2024-11-14 03:46:47,702 INFO L226 Difference]: Without dead ends: 492 [2024-11-14 03:46:47,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:47,702 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:47,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 476 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:46:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-14 03:46:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2024-11-14 03:46:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 299 states have (on average 1.585284280936455) internal successors, (474), 404 states have internal predecessors, (474), 54 states have call successors, (54), 29 states have call predecessors, (54), 37 states have return successors, (138), 58 states have call predecessors, (138), 54 states have call successors, (138) [2024-11-14 03:46:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 666 transitions. [2024-11-14 03:46:47,728 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 666 transitions. Word has length 36 [2024-11-14 03:46:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 666 transitions. [2024-11-14 03:46:47,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 666 transitions. [2024-11-14 03:46:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:46:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:47,730 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:47,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:46:47,730 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:47,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1756079019, now seen corresponding path program 1 times [2024-11-14 03:46:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:47,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691115994] [2024-11-14 03:46:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:48,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:48,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691115994] [2024-11-14 03:46:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691115994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:48,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:48,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304341893] [2024-11-14 03:46:48,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:48,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:48,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:48,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:48,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:48,147 INFO L87 Difference]: Start difference. First operand 492 states and 666 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:49,149 INFO L93 Difference]: Finished difference Result 523 states and 715 transitions. [2024-11-14 03:46:49,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-14 03:46:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:49,155 INFO L225 Difference]: With dead ends: 523 [2024-11-14 03:46:49,155 INFO L226 Difference]: Without dead ends: 523 [2024-11-14 03:46:49,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:49,156 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 38 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:49,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1195 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:46:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-14 03:46:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 512. [2024-11-14 03:46:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 315 states have (on average 1.5777777777777777) internal successors, (497), 421 states have internal predecessors, (497), 55 states have call successors, (55), 31 states have call predecessors, (55), 40 states have return successors, (143), 59 states have call predecessors, (143), 55 states have call successors, (143) [2024-11-14 03:46:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 695 transitions. [2024-11-14 03:46:49,186 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 695 transitions. Word has length 44 [2024-11-14 03:46:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:49,187 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 695 transitions. [2024-11-14 03:46:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 695 transitions. [2024-11-14 03:46:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-14 03:46:49,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:49,188 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:46:49,188 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1756079018, now seen corresponding path program 1 times [2024-11-14 03:46:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419086084] [2024-11-14 03:46:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:49,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419086084] [2024-11-14 03:46:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419086084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:49,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:49,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913989684] [2024-11-14 03:46:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:49,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:49,462 INFO L87 Difference]: Start difference. First operand 512 states and 695 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:50,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:50,299 INFO L93 Difference]: Finished difference Result 522 states and 714 transitions. [2024-11-14 03:46:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:50,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2024-11-14 03:46:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:50,304 INFO L225 Difference]: With dead ends: 522 [2024-11-14 03:46:50,304 INFO L226 Difference]: Without dead ends: 522 [2024-11-14 03:46:50,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:50,305 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 37 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:50,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1169 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:50,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-14 03:46:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 512. [2024-11-14 03:46:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 315 states have (on average 1.5746031746031746) internal successors, (496), 421 states have internal predecessors, (496), 55 states have call successors, (55), 31 states have call predecessors, (55), 40 states have return successors, (143), 59 states have call predecessors, (143), 55 states have call successors, (143) [2024-11-14 03:46:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 694 transitions. [2024-11-14 03:46:50,332 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 694 transitions. Word has length 44 [2024-11-14 03:46:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 694 transitions. [2024-11-14 03:46:50,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 694 transitions. [2024-11-14 03:46:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:46:50,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:50,334 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:50,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 03:46:50,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1406916123, now seen corresponding path program 1 times [2024-11-14 03:46:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165406904] [2024-11-14 03:46:50,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:50,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:50,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165406904] [2024-11-14 03:46:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165406904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125142860] [2024-11-14 03:46:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:50,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:50,557 INFO L87 Difference]: Start difference. First operand 512 states and 694 transitions. Second operand has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:51,529 INFO L93 Difference]: Finished difference Result 581 states and 793 transitions. [2024-11-14 03:46:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-14 03:46:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:51,533 INFO L225 Difference]: With dead ends: 581 [2024-11-14 03:46:51,533 INFO L226 Difference]: Without dead ends: 581 [2024-11-14 03:46:51,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:51,534 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 130 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:51,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1104 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:46:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-14 03:46:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 520. [2024-11-14 03:46:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 321 states have (on average 1.573208722741433) internal successors, (505), 427 states have internal predecessors, (505), 56 states have call successors, (56), 32 states have call predecessors, (56), 41 states have return successors, (145), 60 states have call predecessors, (145), 56 states have call successors, (145) [2024-11-14 03:46:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 706 transitions. [2024-11-14 03:46:51,557 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 706 transitions. Word has length 45 [2024-11-14 03:46:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 706 transitions. [2024-11-14 03:46:51,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 706 transitions. [2024-11-14 03:46:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-14 03:46:51,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:51,559 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:51,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 03:46:51,559 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:51,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1406916122, now seen corresponding path program 1 times [2024-11-14 03:46:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852843993] [2024-11-14 03:46:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:51,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852843993] [2024-11-14 03:46:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852843993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:51,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843782095] [2024-11-14 03:46:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:51,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:51,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:51,895 INFO L87 Difference]: Start difference. First operand 520 states and 706 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:52,750 INFO L93 Difference]: Finished difference Result 529 states and 718 transitions. [2024-11-14 03:46:52,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:52,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-14 03:46:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:52,754 INFO L225 Difference]: With dead ends: 529 [2024-11-14 03:46:52,754 INFO L226 Difference]: Without dead ends: 529 [2024-11-14 03:46:52,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:52,757 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 39 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:52,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1175 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-14 03:46:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 520. [2024-11-14 03:46:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 321 states have (on average 1.5700934579439252) internal successors, (504), 427 states have internal predecessors, (504), 56 states have call successors, (56), 32 states have call predecessors, (56), 41 states have return successors, (145), 60 states have call predecessors, (145), 56 states have call successors, (145) [2024-11-14 03:46:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 705 transitions. [2024-11-14 03:46:52,782 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 705 transitions. Word has length 45 [2024-11-14 03:46:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:52,782 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 705 transitions. [2024-11-14 03:46:52,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 705 transitions. [2024-11-14 03:46:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 03:46:52,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:52,784 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 03:46:52,784 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash -675025369, now seen corresponding path program 1 times [2024-11-14 03:46:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:52,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984904046] [2024-11-14 03:46:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:53,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984904046] [2024-11-14 03:46:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984904046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:53,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:53,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689831418] [2024-11-14 03:46:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:53,023 INFO L87 Difference]: Start difference. First operand 520 states and 705 transitions. Second operand has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:53,955 INFO L93 Difference]: Finished difference Result 594 states and 826 transitions. [2024-11-14 03:46:53,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:53,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-14 03:46:53,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:53,960 INFO L225 Difference]: With dead ends: 594 [2024-11-14 03:46:53,960 INFO L226 Difference]: Without dead ends: 594 [2024-11-14 03:46:53,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:53,961 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 112 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:53,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1086 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:46:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-14 03:46:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 550. [2024-11-14 03:46:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 346 states have (on average 1.569364161849711) internal successors, (543), 454 states have internal predecessors, (543), 57 states have call successors, (57), 34 states have call predecessors, (57), 45 states have return successors, (154), 61 states have call predecessors, (154), 57 states have call successors, (154) [2024-11-14 03:46:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 754 transitions. [2024-11-14 03:46:53,987 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 754 transitions. Word has length 46 [2024-11-14 03:46:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:53,987 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 754 transitions. [2024-11-14 03:46:53,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 754 transitions. [2024-11-14 03:46:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-14 03:46:53,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:53,988 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 03:46:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:46:53,989 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:53,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -675025368, now seen corresponding path program 1 times [2024-11-14 03:46:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502592679] [2024-11-14 03:46:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:54,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502592679] [2024-11-14 03:46:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502592679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022358149] [2024-11-14 03:46:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:54,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:54,344 INFO L87 Difference]: Start difference. First operand 550 states and 754 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:55,239 INFO L93 Difference]: Finished difference Result 607 states and 846 transitions. [2024-11-14 03:46:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-14 03:46:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:55,243 INFO L225 Difference]: With dead ends: 607 [2024-11-14 03:46:55,244 INFO L226 Difference]: Without dead ends: 607 [2024-11-14 03:46:55,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:55,245 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 52 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:55,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1159 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-14 03:46:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 590. [2024-11-14 03:46:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 377 states have (on average 1.557029177718833) internal successors, (587), 486 states have internal predecessors, (587), 61 states have call successors, (61), 37 states have call predecessors, (61), 50 states have return successors, (170), 66 states have call predecessors, (170), 61 states have call successors, (170) [2024-11-14 03:46:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 818 transitions. [2024-11-14 03:46:55,273 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 818 transitions. Word has length 46 [2024-11-14 03:46:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:55,274 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 818 transitions. [2024-11-14 03:46:55,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 818 transitions. [2024-11-14 03:46:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 03:46:55,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:55,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:55,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 03:46:55,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:55,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:55,276 INFO L85 PathProgramCache]: Analyzing trace with hash 538550818, now seen corresponding path program 1 times [2024-11-14 03:46:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350953900] [2024-11-14 03:46:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:55,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:55,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350953900] [2024-11-14 03:46:55,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350953900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:55,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:55,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:55,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442967739] [2024-11-14 03:46:55,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:55,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:55,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:55,501 INFO L87 Difference]: Start difference. First operand 590 states and 818 transitions. Second operand has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:56,237 INFO L93 Difference]: Finished difference Result 652 states and 920 transitions. [2024-11-14 03:46:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-14 03:46:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:56,242 INFO L225 Difference]: With dead ends: 652 [2024-11-14 03:46:56,242 INFO L226 Difference]: Without dead ends: 652 [2024-11-14 03:46:56,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:56,243 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 83 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:56,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1105 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-14 03:46:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 626. [2024-11-14 03:46:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 406 states have (on average 1.5492610837438423) internal successors, (629), 518 states have internal predecessors, (629), 62 states have call successors, (62), 39 states have call predecessors, (62), 56 states have return successors, (180), 68 states have call predecessors, (180), 62 states have call successors, (180) [2024-11-14 03:46:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2024-11-14 03:46:56,270 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 47 [2024-11-14 03:46:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:56,271 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2024-11-14 03:46:56,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2024-11-14 03:46:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-14 03:46:56,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:56,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:56,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 03:46:56,272 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:56,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:56,273 INFO L85 PathProgramCache]: Analyzing trace with hash 538550819, now seen corresponding path program 1 times [2024-11-14 03:46:56,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:56,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569139771] [2024-11-14 03:46:56,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:56,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:56,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569139771] [2024-11-14 03:46:56,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569139771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:56,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:56,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:56,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449031942] [2024-11-14 03:46:56,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:56,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:56,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:56,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:56,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:56,589 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:57,492 INFO L93 Difference]: Finished difference Result 687 states and 964 transitions. [2024-11-14 03:46:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:57,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-14 03:46:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:57,499 INFO L225 Difference]: With dead ends: 687 [2024-11-14 03:46:57,500 INFO L226 Difference]: Without dead ends: 687 [2024-11-14 03:46:57,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:57,501 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 65 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:57,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1166 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 03:46:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-14 03:46:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 666. [2024-11-14 03:46:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 437 states have (on average 1.5377574370709381) internal successors, (672), 551 states have internal predecessors, (672), 65 states have call successors, (65), 41 states have call predecessors, (65), 62 states have return successors, (192), 73 states have call predecessors, (192), 65 states have call successors, (192) [2024-11-14 03:46:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 929 transitions. [2024-11-14 03:46:57,529 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 929 transitions. Word has length 47 [2024-11-14 03:46:57,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:57,529 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 929 transitions. [2024-11-14 03:46:57,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 929 transitions. [2024-11-14 03:46:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:46:57,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:57,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 03:46:57,531 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:57,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1957486514, now seen corresponding path program 1 times [2024-11-14 03:46:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936832861] [2024-11-14 03:46:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:46:57,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936832861] [2024-11-14 03:46:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936832861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:46:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896462243] [2024-11-14 03:46:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:46:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:46:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:57,912 INFO L87 Difference]: Start difference. First operand 666 states and 929 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:46:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:58,554 INFO L93 Difference]: Finished difference Result 754 states and 1084 transitions. [2024-11-14 03:46:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:46:58,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-14 03:46:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:58,559 INFO L225 Difference]: With dead ends: 754 [2024-11-14 03:46:58,560 INFO L226 Difference]: Without dead ends: 754 [2024-11-14 03:46:58,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:46:58,561 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 42 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:58,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1813 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:46:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-14 03:46:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2024-11-14 03:46:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 489 states have (on average 1.525562372188139) internal successors, (746), 604 states have internal predecessors, (746), 69 states have call successors, (69), 49 states have call predecessors, (69), 70 states have return successors, (209), 76 states have call predecessors, (209), 69 states have call successors, (209) [2024-11-14 03:46:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1024 transitions. [2024-11-14 03:46:58,593 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1024 transitions. Word has length 51 [2024-11-14 03:46:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:58,593 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1024 transitions. [2024-11-14 03:46:58,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:46:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1024 transitions. [2024-11-14 03:46:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 03:46:58,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:58,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:58,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 03:46:58,594 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1703136709, now seen corresponding path program 1 times [2024-11-14 03:46:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694712477] [2024-11-14 03:46:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:58,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694712477] [2024-11-14 03:46:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694712477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:46:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818537171] [2024-11-14 03:46:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:46:59,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:59,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:46:59,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:59,001 INFO L87 Difference]: Start difference. First operand 730 states and 1024 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:59,631 INFO L93 Difference]: Finished difference Result 750 states and 1060 transitions. [2024-11-14 03:46:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:46:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-14 03:46:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:59,637 INFO L225 Difference]: With dead ends: 750 [2024-11-14 03:46:59,637 INFO L226 Difference]: Without dead ends: 750 [2024-11-14 03:46:59,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:46:59,638 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 39 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:59,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2112 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:46:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-14 03:46:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 740. [2024-11-14 03:46:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 497 states have (on average 1.5191146881287727) internal successors, (755), 612 states have internal predecessors, (755), 70 states have call successors, (70), 50 states have call predecessors, (70), 71 states have return successors, (213), 77 states have call predecessors, (213), 70 states have call successors, (213) [2024-11-14 03:46:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1038 transitions. [2024-11-14 03:46:59,671 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1038 transitions. Word has length 50 [2024-11-14 03:46:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:59,672 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1038 transitions. [2024-11-14 03:46:59,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:46:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1038 transitions. [2024-11-14 03:46:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 03:46:59,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:59,677 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:59,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 03:46:59,677 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:46:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2018008650, now seen corresponding path program 1 times [2024-11-14 03:46:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:59,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347244462] [2024-11-14 03:46:59,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:46:59,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347244462] [2024-11-14 03:46:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347244462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:46:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846641920] [2024-11-14 03:46:59,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:59,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:59,818 INFO L87 Difference]: Start difference. First operand 740 states and 1038 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:47:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:00,399 INFO L93 Difference]: Finished difference Result 782 states and 1148 transitions. [2024-11-14 03:47:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:47:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2024-11-14 03:47:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:00,404 INFO L225 Difference]: With dead ends: 782 [2024-11-14 03:47:00,404 INFO L226 Difference]: Without dead ends: 782 [2024-11-14 03:47:00,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:47:00,406 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 309 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:00,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 344 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:47:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-14 03:47:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 739. [2024-11-14 03:47:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 497 states have (on average 1.5130784708249496) internal successors, (752), 611 states have internal predecessors, (752), 70 states have call successors, (70), 50 states have call predecessors, (70), 71 states have return successors, (213), 77 states have call predecessors, (213), 70 states have call successors, (213) [2024-11-14 03:47:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1035 transitions. [2024-11-14 03:47:00,442 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1035 transitions. Word has length 50 [2024-11-14 03:47:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:00,442 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1035 transitions. [2024-11-14 03:47:00,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 03:47:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1035 transitions. [2024-11-14 03:47:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:47:00,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:00,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:00,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-14 03:47:00,444 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:47:00,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2038576210, now seen corresponding path program 1 times [2024-11-14 03:47:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363396965] [2024-11-14 03:47:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:47:00,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:00,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363396965] [2024-11-14 03:47:00,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363396965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:00,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:47:00,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:47:00,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279462510] [2024-11-14 03:47:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:47:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:47:00,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:47:00,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:47:00,590 INFO L87 Difference]: Start difference. First operand 739 states and 1035 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:47:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:01,001 INFO L93 Difference]: Finished difference Result 737 states and 1033 transitions. [2024-11-14 03:47:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:47:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-14 03:47:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:01,006 INFO L225 Difference]: With dead ends: 737 [2024-11-14 03:47:01,006 INFO L226 Difference]: Without dead ends: 737 [2024-11-14 03:47:01,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:47:01,007 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:01,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 642 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:47:01,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-14 03:47:01,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-11-14 03:47:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 497 states have (on average 1.5090543259557343) internal successors, (750), 609 states have internal predecessors, (750), 70 states have call successors, (70), 50 states have call predecessors, (70), 71 states have return successors, (213), 77 states have call predecessors, (213), 70 states have call successors, (213) [2024-11-14 03:47:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1033 transitions. [2024-11-14 03:47:01,036 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1033 transitions. Word has length 51 [2024-11-14 03:47:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1033 transitions. [2024-11-14 03:47:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:47:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1033 transitions. [2024-11-14 03:47:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-14 03:47:01,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:01,039 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:01,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-14 03:47:01,039 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:47:01,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2038576209, now seen corresponding path program 1 times [2024-11-14 03:47:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903383703] [2024-11-14 03:47:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:47:02,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903383703] [2024-11-14 03:47:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903383703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:47:02,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978892856] [2024-11-14 03:47:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:02,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:02,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:47:02,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:47:02,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:47:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:03,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-14 03:47:03,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:03,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-14 03:47:03,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:47:03,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-14 03:47:03,492 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:03,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 66 [2024-11-14 03:47:03,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-14 03:47:03,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-14 03:47:03,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-14 03:47:03,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:03,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:47:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-14 03:47:03,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:03,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:47:03,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-14 03:47:03,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:03,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:47:03,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:03,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2024-11-14 03:47:03,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:03,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:03,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:03,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:04,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2024-11-14 03:47:04,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2024-11-14 03:47:04,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-14 03:47:04,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:47:04,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:47:04,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-14 03:47:04,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-14 03:47:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:04,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:47:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978892856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:47:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2024-11-14 03:47:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536679810] [2024-11-14 03:47:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:47:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:47:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:47:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-11-14 03:47:04,336 INFO L87 Difference]: Start difference. First operand 737 states and 1033 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:47:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:06,028 INFO L93 Difference]: Finished difference Result 782 states and 1167 transitions. [2024-11-14 03:47:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:47:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2024-11-14 03:47:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:06,034 INFO L225 Difference]: With dead ends: 782 [2024-11-14 03:47:06,035 INFO L226 Difference]: Without dead ends: 782 [2024-11-14 03:47:06,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2024-11-14 03:47:06,036 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 585 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:06,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1538 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-14 03:47:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-14 03:47:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 740. [2024-11-14 03:47:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 499 states have (on average 1.5070140280561122) internal successors, (752), 612 states have internal predecessors, (752), 70 states have call successors, (70), 50 states have call predecessors, (70), 72 states have return successors, (214), 77 states have call predecessors, (214), 70 states have call successors, (214) [2024-11-14 03:47:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1036 transitions. [2024-11-14 03:47:06,069 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1036 transitions. Word has length 51 [2024-11-14 03:47:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:06,069 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1036 transitions. [2024-11-14 03:47:06,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:47:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1036 transitions. [2024-11-14 03:47:06,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 03:47:06,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:06,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:06,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:47:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:06,272 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:47:06,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -361540588, now seen corresponding path program 1 times [2024-11-14 03:47:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254813336] [2024-11-14 03:47:06,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:47:06,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:06,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254813336] [2024-11-14 03:47:06,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254813336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:06,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:47:06,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:47:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436874542] [2024-11-14 03:47:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:06,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:47:06,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:47:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:47:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:47:06,397 INFO L87 Difference]: Start difference. First operand 740 states and 1036 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:47:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:06,837 INFO L93 Difference]: Finished difference Result 738 states and 1034 transitions. [2024-11-14 03:47:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:47:06,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-14 03:47:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:06,842 INFO L225 Difference]: With dead ends: 738 [2024-11-14 03:47:06,843 INFO L226 Difference]: Without dead ends: 738 [2024-11-14 03:47:06,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:47:06,844 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:06,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:47:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-14 03:47:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-14 03:47:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 499 states have (on average 1.503006012024048) internal successors, (750), 610 states have internal predecessors, (750), 70 states have call successors, (70), 50 states have call predecessors, (70), 72 states have return successors, (214), 77 states have call predecessors, (214), 70 states have call successors, (214) [2024-11-14 03:47:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1034 transitions. [2024-11-14 03:47:06,871 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1034 transitions. Word has length 52 [2024-11-14 03:47:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1034 transitions. [2024-11-14 03:47:06,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:47:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1034 transitions. [2024-11-14 03:47:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 03:47:06,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:06,874 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:06,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-14 03:47:06,874 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-14 03:47:06,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash -361540587, now seen corresponding path program 1 times [2024-11-14 03:47:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160071667] [2024-11-14 03:47:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:47:06,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:47:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:47:07,002 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:47:07,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:47:07,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-11-14 03:47:07,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-11-14 03:47:07,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-11-14 03:47:07,006 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-11-14 03:47:07,007 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-11-14 03:47:07,008 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-11-14 03:47:07,009 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-11-14 03:47:07,010 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-11-14 03:47:07,011 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-11-14 03:47:07,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-11-14 03:47:07,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-11-14 03:47:07,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-11-14 03:47:07,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-11-14 03:47:07,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-11-14 03:47:07,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-11-14 03:47:07,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-11-14 03:47:07,019 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-11-14 03:47:07,020 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-11-14 03:47:07,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-11-14 03:47:07,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-11-14 03:47:07,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-11-14 03:47:07,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-11-14 03:47:07,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-11-14 03:47:07,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-11-14 03:47:07,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-11-14 03:47:07,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-14 03:47:07,030 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:07,091 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:47:07,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:47:07 BoogieIcfgContainer [2024-11-14 03:47:07,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:47:07,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:47:07,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:47:07,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:47:07,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:46:22" (3/4) ... [2024-11-14 03:47:07,103 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 03:47:07,187 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 03:47:07,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:47:07,189 INFO L158 Benchmark]: Toolchain (without parser) took 47402.06ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 90.9MB in the beginning and 192.0MB in the end (delta: -101.0MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2024-11-14 03:47:07,189 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:47:07,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 880.52ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.7MB in the end (delta: 25.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 03:47:07,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.41ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 62.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:47:07,190 INFO L158 Benchmark]: Boogie Preprocessor took 69.12ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:47:07,191 INFO L158 Benchmark]: RCFGBuilder took 1892.65ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 43.0MB in the end (delta: 16.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-14 03:47:07,193 INFO L158 Benchmark]: TraceAbstraction took 44367.04ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 42.4MB in the beginning and 192.0MB in the end (delta: -149.6MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-11-14 03:47:07,193 INFO L158 Benchmark]: Witness Printer took 86.68ms. Allocated memory is still 327.2MB. Free memory was 192.0MB in the beginning and 192.0MB in the end (delta: 43.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:47:07,194 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 880.52ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.7MB in the end (delta: 25.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.41ms. Allocated memory is still 117.4MB. Free memory was 65.7MB in the beginning and 62.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.12ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 59.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1892.65ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 43.0MB in the end (delta: 16.8MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44367.04ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 42.4MB in the beginning and 192.0MB in the end (delta: -149.6MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Witness Printer took 86.68ms. Allocated memory is still 327.2MB. Free memory was 192.0MB in the beginning and 192.0MB in the end (delta: 43.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L779] user_t *user; [L975] user = malloc(sizeof(user_t)) [L976] CALL user_initialize() [L966] EXPR, FCALL calloc(1, sizeof(info_t)) VAL [user={-1:0}] [L966] user->info = calloc(1, sizeof(info_t)) [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 [L976] RET user_initialize() [L977] event_t e = {0}; VAL [e={10:0}, user={-1:0}] [L978] e.primitive = _EVENT_START VAL [e={10:0}, user={-1:0}] [L979] CALL event_precess(&e) VAL [\old(e)={10:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: VAL [\old(e)={10:0}, e={10:0}, rc=-1, status=1, user={-1:0}] [L948] CALL ASNull(e) VAL [\old(e)={10:0}, user={-1:0}] [L838] EXPR e->primitive [L838] e_primitive_t primitive = e->primitive; [L839] COND TRUE primitive == _EVENT_START VAL [\old(e)={10:0}, user={-1:0}] [L840] CALL status_update(AS_START) VAL [\old(status)=2, user={-1:0}] [L814] COND TRUE status < AS_STATE_MAX VAL [\old(status)=2, status=2, user={-1:0}] [L815] EXPR user->status VAL [\old(status)=2, status=2, user={-1:0}] [L815] COND TRUE user->status != status [L816] user->status = status [L817] return 10; VAL [\old(status)=2, \result=10, user={-1:0}] [L840] RET status_update(AS_START) VAL [\old(e)={10:0}, user={-1:0}] [L841] CALL system_initialize() VAL [user={-1:0}] [L829] event_t e = {0}; VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info VAL [e={9:0}, user={-1:0}] [L830] EXPR user->info->is_valid VAL [e={9:0}, user={-1:0}] [L830] COND TRUE !user->info->is_valid [L831] e.primitive = _EVENT_CLOSE VAL [e={9:0}, user={-1:0}] [L835] CALL event_precess(&e) VAL [\old(e)={9:0}, user={-1:0}] [L943] EXPR user->status [L943] sys_state_t status = user->status; [L944] int rc = -1; VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L945] COND TRUE status < AS_STATE_MAX [L947] case AS_NULL: [L950] case AS_START: VAL [\old(e)={9:0}, e={9:0}, rc=-1, status=2, user={-1:0}] [L951] CALL ASStart(e) VAL [\old(e)={9:0}, user={-1:0}] [L881] EXPR e->primitive [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: [L899] message_t *message = &user->message; [L900] EXPR, FCALL calloc(0, sizeof(*message)) VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [L900] message = calloc(0, sizeof(*message)) [L901] message->id = 3 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 973]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 352 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 44.2s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4460 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4433 mSDsluCounter, 31549 SdHoareTripleChecker+Invalid, 20.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22489 mSDsCounter, 804 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20828 IncrementalHoareTripleChecker+Invalid, 21632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 804 mSolverCounterUnsat, 9060 mSDtfsCounter, 20828 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=740occurred in iteration=28, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 747 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1083 ConstructedInterpolants, 0 QuantifiedInterpolants, 5443 SizeOfPredicates, 16 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 33 InterpolantComputations, 32 PerfectInterpolantSequences, 75/76 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 03:47:07,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3057960-7487-4bcf-8a07-56f3f4e2b053/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)