./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/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_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje --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.2.5-dev-a016563 [2024-11-09 04:44:46,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:44:46,256 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:44:46,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:44:46,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:44:46,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:44:46,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:44:46,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:44:46,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:44:46,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:44:46,310 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:44:46,310 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:44:46,311 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:44:46,315 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:44:46,316 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:44:46,316 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:44:46,316 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:44:46,317 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:44:46,317 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:44:46,317 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:44:46,318 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:44:46,318 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:44:46,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:44:46,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:44:46,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:44:46,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:44:46,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:44:46,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:44:46,323 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:44:46,323 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:44:46,323 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:44:46,323 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:44:46,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:44:46,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:44:46,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:44:46,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:44:46,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:44:46,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:44:46,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:44:46,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:44:46,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:44:46,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:46,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:44:46,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:44:46,329 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:44:46,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:44:46,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:44:46,330 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:44:46,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:44:46,331 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje 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-09 04:44:46,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:44:46,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:44:46,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:44:46,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:44:46,618 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:44:46,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i Unable to find full path for "g++" [2024-11-09 04:44:48,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:44:48,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:44:48,877 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-09 04:44:48,901 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/data/523699604/6fde1a7758eb44c0b1aabb01b09ecf05/FLAG40234a1a7 [2024-11-09 04:44:49,160 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/data/523699604/6fde1a7758eb44c0b1aabb01b09ecf05 [2024-11-09 04:44:49,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:44:49,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:44:49,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:49,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:44:49,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:44:49,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f8f292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49, skipping insertion in model container [2024-11-09 04:44:49,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:44:49,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:49,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:44:49,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:44:49,903 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:44:49,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49 WrapperNode [2024-11-09 04:44:49,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:44:49,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:49,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:44:49,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:44:49,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,971 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-11-09 04:44:49,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:44:49,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:44:49,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:44:49,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:44:49,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:49,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:44:50,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:44:50,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:44:50,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:44:50,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (1/1) ... [2024-11-09 04:44:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:44:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:44:50,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:44:50,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:44:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:44:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 04:44:50,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 04:44:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-11-09 04:44:50,113 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-11-09 04:44:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:44:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:44:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-11-09 04:44:50,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-11-09 04:44:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:44:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:44:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 04:44:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-11-09 04:44:50,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-11-09 04:44:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-11-09 04:44:50,115 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-11-09 04:44:50,115 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-11-09 04:44:50,116 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-11-09 04:44:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:44:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-11-09 04:44:50,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-11-09 04:44:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 04:44:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-11-09 04:44:50,133 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-11-09 04:44:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:44:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-11-09 04:44:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-11-09 04:44:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:44:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:44:50,327 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:44:50,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:44:51,281 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-09 04:44:51,281 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:44:51,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:44:51,419 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:44:51,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:51 BoogieIcfgContainer [2024-11-09 04:44:51,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:44:51,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:44:51,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:44:51,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:44:51,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:49" (1/3) ... [2024-11-09 04:44:51,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6091e150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:51, skipping insertion in model container [2024-11-09 04:44:51,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:49" (2/3) ... [2024-11-09 04:44:51,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6091e150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:51, skipping insertion in model container [2024-11-09 04:44:51,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:51" (3/3) ... [2024-11-09 04:44:51,431 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-11-09 04:44:51,445 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:44:51,445 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 158 error locations. [2024-11-09 04:44:51,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:44:51,513 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;@5ea013c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:44:51,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-11-09 04:44:51,519 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-09 04:44:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:44:51,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:51,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:44:51,528 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-09 04:44:51,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 591732502, now seen corresponding path program 1 times [2024-11-09 04:44:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648198648] [2024-11-09 04:44:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:51,913 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-09 04:44:51,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:51,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648198648] [2024-11-09 04:44:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648198648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:51,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891169759] [2024-11-09 04:44:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:51,969 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-09 04:44:52,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:52,526 INFO L93 Difference]: Finished difference Result 376 states and 437 transitions. [2024-11-09 04:44:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:52,531 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-09 04:44:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:52,553 INFO L225 Difference]: With dead ends: 376 [2024-11-09 04:44:52,553 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 04:44:52,556 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-09 04:44:52,561 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 350 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:52,563 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.5s Time] [2024-11-09 04:44:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 04:44:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 346. [2024-11-09 04:44:52,641 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-09 04:44:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 403 transitions. [2024-11-09 04:44:52,646 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 403 transitions. Word has length 5 [2024-11-09 04:44:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:52,647 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 403 transitions. [2024-11-09 04:44:52,647 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-09 04:44:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 403 transitions. [2024-11-09 04:44:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:44:52,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:52,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:44:52,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:44:52,649 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-09 04:44:52,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash 591732503, now seen corresponding path program 1 times [2024-11-09 04:44:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887268611] [2024-11-09 04:44:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:52,881 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-09 04:44:52,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887268611] [2024-11-09 04:44:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887268611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:52,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:52,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:44:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001220682] [2024-11-09 04:44:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:44:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:44:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:44:52,887 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-09 04:44:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:53,433 INFO L93 Difference]: Finished difference Result 427 states and 511 transitions. [2024-11-09 04:44:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:44:53,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-09 04:44:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:53,436 INFO L225 Difference]: With dead ends: 427 [2024-11-09 04:44:53,436 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 04:44:53,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-09 04:44:53,438 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 114 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:53,438 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.5s Time] [2024-11-09 04:44:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 04:44:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 406. [2024-11-09 04:44:53,461 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-09 04:44:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 500 transitions. [2024-11-09 04:44:53,464 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 500 transitions. Word has length 5 [2024-11-09 04:44:53,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:53,465 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 500 transitions. [2024-11-09 04:44:53,465 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-09 04:44:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 500 transitions. [2024-11-09 04:44:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 04:44:53,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:53,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:53,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 04:44:53,466 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-09 04:44:53,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:53,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1761290575, now seen corresponding path program 1 times [2024-11-09 04:44:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:53,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465364796] [2024-11-09 04:44:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:53,660 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-09 04:44:53,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465364796] [2024-11-09 04:44:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465364796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:53,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:53,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:44:53,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891052865] [2024-11-09 04:44:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:44:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:44:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:44:53,664 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-09 04:44:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:54,191 INFO L93 Difference]: Finished difference Result 405 states and 499 transitions. [2024-11-09 04:44:54,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:44:54,191 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-09 04:44:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:54,194 INFO L225 Difference]: With dead ends: 405 [2024-11-09 04:44:54,194 INFO L226 Difference]: Without dead ends: 405 [2024-11-09 04:44:54,195 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-09 04:44:54,196 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 2 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:54,196 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.5s Time] [2024-11-09 04:44:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-09 04:44:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-09 04:44:54,213 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-09 04:44:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 499 transitions. [2024-11-09 04:44:54,216 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 499 transitions. Word has length 8 [2024-11-09 04:44:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:54,216 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 499 transitions. [2024-11-09 04:44:54,217 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-09 04:44:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 499 transitions. [2024-11-09 04:44:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 04:44:54,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:54,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 04:44:54,220 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-09 04:44:54,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1761290576, now seen corresponding path program 1 times [2024-11-09 04:44:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:54,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870195286] [2024-11-09 04:44:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:54,540 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-09 04:44:54,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870195286] [2024-11-09 04:44:54,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870195286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:54,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:44:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875051022] [2024-11-09 04:44:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:54,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:44:54,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:44:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:44:54,544 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-09 04:44:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:55,154 INFO L93 Difference]: Finished difference Result 404 states and 498 transitions. [2024-11-09 04:44:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:44:55,157 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-09 04:44:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:55,160 INFO L225 Difference]: With dead ends: 404 [2024-11-09 04:44:55,161 INFO L226 Difference]: Without dead ends: 404 [2024-11-09 04:44:55,161 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-09 04:44:55,165 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:55,167 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.6s Time] [2024-11-09 04:44:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-09 04:44:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-09 04:44:55,186 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-09 04:44:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 498 transitions. [2024-11-09 04:44:55,190 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 498 transitions. Word has length 8 [2024-11-09 04:44:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:55,190 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 498 transitions. [2024-11-09 04:44:55,191 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-09 04:44:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 498 transitions. [2024-11-09 04:44:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:44:55,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:55,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:44:55,192 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-09 04:44:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1063779324, now seen corresponding path program 1 times [2024-11-09 04:44:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345668688] [2024-11-09 04:44:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:55,265 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-09 04:44:55,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345668688] [2024-11-09 04:44:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345668688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:55,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126483700] [2024-11-09 04:44:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:55,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:55,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:55,268 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-09 04:44:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:55,534 INFO L93 Difference]: Finished difference Result 403 states and 497 transitions. [2024-11-09 04:44:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:55,535 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-09 04:44:55,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:55,537 INFO L225 Difference]: With dead ends: 403 [2024-11-09 04:44:55,537 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 04:44:55,538 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-09 04:44:55,539 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:55,539 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.2s Time] [2024-11-09 04:44:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 04:44:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-09 04:44:55,552 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-09 04:44:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 497 transitions. [2024-11-09 04:44:55,555 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 497 transitions. Word has length 12 [2024-11-09 04:44:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:55,555 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 497 transitions. [2024-11-09 04:44:55,555 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-09 04:44:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 497 transitions. [2024-11-09 04:44:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:44:55,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:55,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:44:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:44:55,557 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-09 04:44:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1063779323, now seen corresponding path program 1 times [2024-11-09 04:44:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163676528] [2024-11-09 04:44:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:55,727 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-09 04:44:55,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163676528] [2024-11-09 04:44:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163676528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:55,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:44:55,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545791323] [2024-11-09 04:44:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:44:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:55,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:44:55,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:44:55,730 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-09 04:44:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:56,002 INFO L93 Difference]: Finished difference Result 402 states and 496 transitions. [2024-11-09 04:44:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:44:56,005 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-09 04:44:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:56,007 INFO L225 Difference]: With dead ends: 402 [2024-11-09 04:44:56,007 INFO L226 Difference]: Without dead ends: 402 [2024-11-09 04:44:56,007 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-09 04:44:56,010 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:56,011 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.3s Time] [2024-11-09 04:44:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-09 04:44:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2024-11-09 04:44:56,035 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-09 04:44:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2024-11-09 04:44:56,039 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 12 [2024-11-09 04:44:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2024-11-09 04:44:56,039 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-09 04:44:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2024-11-09 04:44:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:44:56,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:56,040 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-09 04:44:56,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 04:44:56,041 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-09 04:44:56,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1315127787, now seen corresponding path program 1 times [2024-11-09 04:44:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768541784] [2024-11-09 04:44:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:56,462 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-09 04:44:56,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768541784] [2024-11-09 04:44:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768541784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:56,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:56,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:44:56,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252628511] [2024-11-09 04:44:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:56,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:44:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:56,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:44:56,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:44:56,464 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-09 04:44:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:57,309 INFO L93 Difference]: Finished difference Result 430 states and 539 transitions. [2024-11-09 04:44:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:44:57,310 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-09 04:44:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:57,312 INFO L225 Difference]: With dead ends: 430 [2024-11-09 04:44:57,312 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 04:44:57,312 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-09 04:44:57,313 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 34 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:57,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1174 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 04:44:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 04:44:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 419. [2024-11-09 04:44:57,326 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-09 04:44:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 521 transitions. [2024-11-09 04:44:57,329 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 521 transitions. Word has length 20 [2024-11-09 04:44:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:57,329 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 521 transitions. [2024-11-09 04:44:57,330 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-09 04:44:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 521 transitions. [2024-11-09 04:44:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 04:44:57,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:57,330 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-09 04:44:57,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:44:57,331 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-09 04:44:57,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1315127788, now seen corresponding path program 1 times [2024-11-09 04:44:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398682723] [2024-11-09 04:44:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:57,512 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-09 04:44:57,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398682723] [2024-11-09 04:44:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398682723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:57,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:44:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207248232] [2024-11-09 04:44:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:57,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:44:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:44:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:44:57,514 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-09 04:44:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:58,191 INFO L93 Difference]: Finished difference Result 429 states and 538 transitions. [2024-11-09 04:44:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:44:58,192 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-09 04:44:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:58,194 INFO L225 Difference]: With dead ends: 429 [2024-11-09 04:44:58,194 INFO L226 Difference]: Without dead ends: 429 [2024-11-09 04:44:58,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-09 04:44:58,197 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 33 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:58,197 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.6s Time] [2024-11-09 04:44:58,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-09 04:44:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 419. [2024-11-09 04:44:58,217 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-09 04:44:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 520 transitions. [2024-11-09 04:44:58,220 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 520 transitions. Word has length 20 [2024-11-09 04:44:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:58,220 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 520 transitions. [2024-11-09 04:44:58,220 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-09 04:44:58,221 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 520 transitions. [2024-11-09 04:44:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:44:58,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:58,221 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-09 04:44:58,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:44:58,222 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-09 04:44:58,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2125046597, now seen corresponding path program 1 times [2024-11-09 04:44:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:58,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075756946] [2024-11-09 04:44:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:58,467 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-09 04:44:58,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:58,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075756946] [2024-11-09 04:44:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075756946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:58,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:58,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:44:58,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551946093] [2024-11-09 04:44:58,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:58,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:44:58,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:58,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:44:58,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:44:58,469 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-09 04:44:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:44:59,237 INFO L93 Difference]: Finished difference Result 509 states and 649 transitions. [2024-11-09 04:44:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:44:59,238 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-09 04:44:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:44:59,240 INFO L225 Difference]: With dead ends: 509 [2024-11-09 04:44:59,241 INFO L226 Difference]: Without dead ends: 509 [2024-11-09 04:44:59,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-09 04:44:59,242 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 141 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:44:59,242 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.7s Time] [2024-11-09 04:44:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-09 04:44:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 451. [2024-11-09 04:44:59,256 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-09 04:44:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 575 transitions. [2024-11-09 04:44:59,259 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 575 transitions. Word has length 21 [2024-11-09 04:44:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:44:59,260 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 575 transitions. [2024-11-09 04:44:59,260 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-09 04:44:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 575 transitions. [2024-11-09 04:44:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 04:44:59,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:44:59,261 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-09 04:44:59,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:44:59,261 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-09 04:44:59,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:44:59,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2125046596, now seen corresponding path program 1 times [2024-11-09 04:44:59,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:44:59,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106213995] [2024-11-09 04:44:59,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:44:59,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:44:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:44:59,612 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-09 04:44:59,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:44:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106213995] [2024-11-09 04:44:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106213995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:44:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:44:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:44:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417758088] [2024-11-09 04:44:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:44:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:44:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:44:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:44:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:44:59,615 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-09 04:45:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:00,671 INFO L93 Difference]: Finished difference Result 436 states and 523 transitions. [2024-11-09 04:45:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:45:00,672 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-09 04:45:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:00,674 INFO L225 Difference]: With dead ends: 436 [2024-11-09 04:45:00,674 INFO L226 Difference]: Without dead ends: 436 [2024-11-09 04:45:00,674 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-09 04:45:00,675 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 379 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:00,675 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.0s Time] [2024-11-09 04:45:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-09 04:45:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 386. [2024-11-09 04:45:00,687 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-09 04:45:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 464 transitions. [2024-11-09 04:45:00,690 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 464 transitions. Word has length 21 [2024-11-09 04:45:00,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:00,690 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 464 transitions. [2024-11-09 04:45:00,691 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-09 04:45:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 464 transitions. [2024-11-09 04:45:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:45:00,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:00,692 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-09 04:45:00,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:45:00,692 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-09 04:45:00,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash -48239041, now seen corresponding path program 1 times [2024-11-09 04:45:00,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:00,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838559865] [2024-11-09 04:45:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:00,809 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-09 04:45:00,809 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:00,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838559865] [2024-11-09 04:45:00,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838559865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:00,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:00,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:45:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159601434] [2024-11-09 04:45:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:00,812 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-09 04:45:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:00,958 INFO L93 Difference]: Finished difference Result 397 states and 475 transitions. [2024-11-09 04:45:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:45:00,959 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-09 04:45:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:00,961 INFO L225 Difference]: With dead ends: 397 [2024-11-09 04:45:00,961 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 04:45:00,961 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-09 04:45:00,962 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:00,962 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.1s Time] [2024-11-09 04:45:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 04:45:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2024-11-09 04:45:00,972 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-09 04:45:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 473 transitions. [2024-11-09 04:45:00,974 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 473 transitions. Word has length 30 [2024-11-09 04:45:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 473 transitions. [2024-11-09 04:45:00,975 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-09 04:45:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 473 transitions. [2024-11-09 04:45:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 04:45:00,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:00,976 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-09 04:45:00,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:45:00,977 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-09 04:45:00,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1564778846, now seen corresponding path program 1 times [2024-11-09 04:45:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090197073] [2024-11-09 04:45:00,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:00,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:01,311 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-09 04:45:01,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:01,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090197073] [2024-11-09 04:45:01,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090197073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:01,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:01,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:45:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001937721] [2024-11-09 04:45:01,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:01,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:45:01,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:01,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:45:01,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:45:01,314 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-09 04:45:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:02,082 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2024-11-09 04:45:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:02,082 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-09 04:45:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:02,085 INFO L225 Difference]: With dead ends: 436 [2024-11-09 04:45:02,085 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 04:45:02,085 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-09 04:45:02,086 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 126 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:02,086 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.7s Time] [2024-11-09 04:45:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 04:45:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 393. [2024-11-09 04:45:02,103 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-09 04:45:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 472 transitions. [2024-11-09 04:45:02,105 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 472 transitions. Word has length 29 [2024-11-09 04:45:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 472 transitions. [2024-11-09 04:45:02,106 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-09 04:45:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 472 transitions. [2024-11-09 04:45:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:45:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:02,108 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-09 04:45:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:45:02,109 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-09 04:45:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -810644387, now seen corresponding path program 1 times [2024-11-09 04:45:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112954909] [2024-11-09 04:45:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:02,386 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-09 04:45:02,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112954909] [2024-11-09 04:45:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112954909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:02,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:02,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:45:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012040360] [2024-11-09 04:45:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:02,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:45:02,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:45:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:45:02,389 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-09 04:45:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:03,449 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2024-11-09 04:45:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 04:45:03,450 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-09 04:45:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:03,453 INFO L225 Difference]: With dead ends: 579 [2024-11-09 04:45:03,454 INFO L226 Difference]: Without dead ends: 575 [2024-11-09 04:45:03,454 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-09 04:45:03,455 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 435 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:03,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1065 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 04:45:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-09 04:45:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 510. [2024-11-09 04:45:03,476 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-09 04:45:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 694 transitions. [2024-11-09 04:45:03,480 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 694 transitions. Word has length 32 [2024-11-09 04:45:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:03,480 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 694 transitions. [2024-11-09 04:45:03,480 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-09 04:45:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2024-11-09 04:45:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 04:45:03,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:03,481 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-09 04:45:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 04:45:03,481 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-09 04:45:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1614096765, now seen corresponding path program 1 times [2024-11-09 04:45:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222483865] [2024-11-09 04:45:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:03,870 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-09 04:45:03,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222483865] [2024-11-09 04:45:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222483865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:45:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728608459] [2024-11-09 04:45:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:45:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:45:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:45:03,874 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-09 04:45:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:04,566 INFO L93 Difference]: Finished difference Result 534 states and 750 transitions. [2024-11-09 04:45:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:45:04,567 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-09 04:45:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:04,570 INFO L225 Difference]: With dead ends: 534 [2024-11-09 04:45:04,572 INFO L226 Difference]: Without dead ends: 534 [2024-11-09 04:45:04,572 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-09 04:45:04,573 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 427 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:04,573 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.6s Time] [2024-11-09 04:45:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-09 04:45:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 491. [2024-11-09 04:45:04,592 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-09 04:45:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 663 transitions. [2024-11-09 04:45:04,596 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 663 transitions. Word has length 33 [2024-11-09 04:45:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:04,597 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 663 transitions. [2024-11-09 04:45:04,597 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-09 04:45:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 663 transitions. [2024-11-09 04:45:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:45:04,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:04,599 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-09 04:45:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 04:45:04,600 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-09 04:45:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1502607751, now seen corresponding path program 1 times [2024-11-09 04:45:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264062064] [2024-11-09 04:45:04,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:05,520 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-09 04:45:05,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264062064] [2024-11-09 04:45:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264062064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 04:45:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045640573] [2024-11-09 04:45:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:45:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:45:05,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:45:05,522 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-09 04:45:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:06,452 INFO L93 Difference]: Finished difference Result 548 states and 789 transitions. [2024-11-09 04:45:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:45:06,453 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-09 04:45:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:06,458 INFO L225 Difference]: With dead ends: 548 [2024-11-09 04:45:06,458 INFO L226 Difference]: Without dead ends: 548 [2024-11-09 04:45:06,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-09 04:45:06,460 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 360 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:06,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 963 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 04:45:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-09 04:45:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 496. [2024-11-09 04:45:06,480 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-09 04:45:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 671 transitions. [2024-11-09 04:45:06,483 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 671 transitions. Word has length 34 [2024-11-09 04:45:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:06,484 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 671 transitions. [2024-11-09 04:45:06,484 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-09 04:45:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 671 transitions. [2024-11-09 04:45:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 04:45:06,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:06,489 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-09 04:45:06,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 04:45:06,489 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-09 04:45:06,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1502607750, now seen corresponding path program 1 times [2024-11-09 04:45:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599533468] [2024-11-09 04:45:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:07,947 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-09 04:45:07,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599533468] [2024-11-09 04:45:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599533468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:07,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:07,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 04:45:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733200651] [2024-11-09 04:45:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:07,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:45:07,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:07,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:45:07,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:45:07,953 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-09 04:45:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:09,423 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2024-11-09 04:45:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:45:09,424 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-09 04:45:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:09,427 INFO L225 Difference]: With dead ends: 547 [2024-11-09 04:45:09,427 INFO L226 Difference]: Without dead ends: 547 [2024-11-09 04:45:09,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-09 04:45:09,428 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 471 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:09,429 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.3s Time] [2024-11-09 04:45:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-09 04:45:09,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 496. [2024-11-09 04:45:09,446 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-09 04:45:09,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 670 transitions. [2024-11-09 04:45:09,450 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 670 transitions. Word has length 34 [2024-11-09 04:45:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 670 transitions. [2024-11-09 04:45:09,450 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-09 04:45:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 670 transitions. [2024-11-09 04:45:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:45:09,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:09,451 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-09 04:45:09,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:45:09,452 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-09 04:45:09,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:09,452 INFO L85 PathProgramCache]: Analyzing trace with hash -897033350, now seen corresponding path program 1 times [2024-11-09 04:45:09,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:09,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003120483] [2024-11-09 04:45:09,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:09,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:09,535 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-09 04:45:09,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003120483] [2024-11-09 04:45:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003120483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:09,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:45:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362126657] [2024-11-09 04:45:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:45:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:45:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:45:09,538 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-09 04:45:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:09,783 INFO L93 Difference]: Finished difference Result 494 states and 668 transitions. [2024-11-09 04:45:09,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:45:09,783 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-09 04:45:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:09,786 INFO L225 Difference]: With dead ends: 494 [2024-11-09 04:45:09,786 INFO L226 Difference]: Without dead ends: 494 [2024-11-09 04:45:09,787 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-09 04:45:09,787 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:09,787 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.2s Time] [2024-11-09 04:45:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-09 04:45:09,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-09 04:45:09,802 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-09 04:45:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 668 transitions. [2024-11-09 04:45:09,805 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 668 transitions. Word has length 36 [2024-11-09 04:45:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 668 transitions. [2024-11-09 04:45:09,806 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-09 04:45:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 668 transitions. [2024-11-09 04:45:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 04:45:09,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:09,806 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-09 04:45:09,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:45:09,807 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-09 04:45:09,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:09,807 INFO L85 PathProgramCache]: Analyzing trace with hash -897033349, now seen corresponding path program 1 times [2024-11-09 04:45:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:09,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652402272] [2024-11-09 04:45:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:09,989 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-09 04:45:09,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652402272] [2024-11-09 04:45:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652402272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:09,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:45:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990202216] [2024-11-09 04:45:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:45:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:45:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:45:09,992 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-09 04:45:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:10,247 INFO L93 Difference]: Finished difference Result 492 states and 666 transitions. [2024-11-09 04:45:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:45:10,247 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-09 04:45:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:10,251 INFO L225 Difference]: With dead ends: 492 [2024-11-09 04:45:10,251 INFO L226 Difference]: Without dead ends: 492 [2024-11-09 04:45:10,252 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-09 04:45:10,252 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:10,253 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.2s Time] [2024-11-09 04:45:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-09 04:45:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2024-11-09 04:45:10,273 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-09 04:45:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 666 transitions. [2024-11-09 04:45:10,277 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 666 transitions. Word has length 36 [2024-11-09 04:45:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:10,278 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 666 transitions. [2024-11-09 04:45:10,278 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-09 04:45:10,278 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 666 transitions. [2024-11-09 04:45:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 04:45:10,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:10,280 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-09 04:45:10,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 04:45:10,280 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-09 04:45:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1756079019, now seen corresponding path program 1 times [2024-11-09 04:45:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675405740] [2024-11-09 04:45:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:10,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:10,639 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-09 04:45:10,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675405740] [2024-11-09 04:45:10,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675405740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518069009] [2024-11-09 04:45:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:10,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:10,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:10,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:10,641 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-09 04:45:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:11,309 INFO L93 Difference]: Finished difference Result 523 states and 715 transitions. [2024-11-09 04:45:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:45:11,309 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-09 04:45:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:11,312 INFO L225 Difference]: With dead ends: 523 [2024-11-09 04:45:11,313 INFO L226 Difference]: Without dead ends: 523 [2024-11-09 04:45:11,313 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-09 04:45:11,314 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 38 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:11,314 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.6s Time] [2024-11-09 04:45:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-09 04:45:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 512. [2024-11-09 04:45:11,331 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-09 04:45:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 695 transitions. [2024-11-09 04:45:11,334 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 695 transitions. Word has length 44 [2024-11-09 04:45:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:11,335 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 695 transitions. [2024-11-09 04:45:11,335 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-09 04:45:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 695 transitions. [2024-11-09 04:45:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 04:45:11,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:11,336 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-09 04:45:11,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 04:45:11,336 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-09 04:45:11,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1756079018, now seen corresponding path program 1 times [2024-11-09 04:45:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944671514] [2024-11-09 04:45:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:11,564 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-09 04:45:11,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:11,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944671514] [2024-11-09 04:45:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944671514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:11,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100773919] [2024-11-09 04:45:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:11,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:11,567 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-09 04:45:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:12,233 INFO L93 Difference]: Finished difference Result 522 states and 714 transitions. [2024-11-09 04:45:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:45:12,233 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-09 04:45:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:12,236 INFO L225 Difference]: With dead ends: 522 [2024-11-09 04:45:12,236 INFO L226 Difference]: Without dead ends: 522 [2024-11-09 04:45:12,237 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-09 04:45:12,237 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 37 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:12,238 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.6s Time] [2024-11-09 04:45:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-09 04:45:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 512. [2024-11-09 04:45:12,253 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-09 04:45:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 694 transitions. [2024-11-09 04:45:12,256 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 694 transitions. Word has length 44 [2024-11-09 04:45:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:12,256 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 694 transitions. [2024-11-09 04:45:12,257 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-09 04:45:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 694 transitions. [2024-11-09 04:45:12,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:45:12,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:12,257 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-09 04:45:12,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 04:45:12,258 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-09 04:45:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1406916123, now seen corresponding path program 1 times [2024-11-09 04:45:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:12,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167230617] [2024-11-09 04:45:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:12,428 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-09 04:45:12,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167230617] [2024-11-09 04:45:12,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167230617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:12,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:12,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:12,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010801428] [2024-11-09 04:45:12,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:12,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:12,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:12,431 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-09 04:45:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:13,176 INFO L93 Difference]: Finished difference Result 581 states and 793 transitions. [2024-11-09 04:45:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:13,177 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-09 04:45:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:13,180 INFO L225 Difference]: With dead ends: 581 [2024-11-09 04:45:13,181 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 04:45:13,181 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-09 04:45:13,181 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 130 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:13,182 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.7s Time] [2024-11-09 04:45:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 04:45:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 520. [2024-11-09 04:45:13,198 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-09 04:45:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 706 transitions. [2024-11-09 04:45:13,201 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 706 transitions. Word has length 45 [2024-11-09 04:45:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:13,202 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 706 transitions. [2024-11-09 04:45:13,202 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-09 04:45:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 706 transitions. [2024-11-09 04:45:13,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:45:13,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:13,202 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-09 04:45:13,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 04:45:13,203 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-09 04:45:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1406916122, now seen corresponding path program 1 times [2024-11-09 04:45:13,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:13,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960180276] [2024-11-09 04:45:13,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:13,570 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-09 04:45:13,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:13,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960180276] [2024-11-09 04:45:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960180276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:13,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:13,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:13,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770202879] [2024-11-09 04:45:13,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:13,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:13,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:13,573 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-09 04:45:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:14,252 INFO L93 Difference]: Finished difference Result 529 states and 718 transitions. [2024-11-09 04:45:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:45:14,255 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-09 04:45:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:14,257 INFO L225 Difference]: With dead ends: 529 [2024-11-09 04:45:14,258 INFO L226 Difference]: Without dead ends: 529 [2024-11-09 04:45:14,258 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-09 04:45:14,258 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 39 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:14,259 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.6s Time] [2024-11-09 04:45:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-09 04:45:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 520. [2024-11-09 04:45:14,273 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-09 04:45:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 705 transitions. [2024-11-09 04:45:14,275 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 705 transitions. Word has length 45 [2024-11-09 04:45:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:14,275 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 705 transitions. [2024-11-09 04:45:14,276 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-09 04:45:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 705 transitions. [2024-11-09 04:45:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:45:14,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:14,276 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-09 04:45:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 04:45:14,277 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-09 04:45:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash -675025369, now seen corresponding path program 1 times [2024-11-09 04:45:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146941512] [2024-11-09 04:45:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:14,471 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-09 04:45:14,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:14,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146941512] [2024-11-09 04:45:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146941512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129418731] [2024-11-09 04:45:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:14,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:14,473 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-09 04:45:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:15,153 INFO L93 Difference]: Finished difference Result 594 states and 826 transitions. [2024-11-09 04:45:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:15,154 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-09 04:45:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:15,157 INFO L225 Difference]: With dead ends: 594 [2024-11-09 04:45:15,158 INFO L226 Difference]: Without dead ends: 594 [2024-11-09 04:45:15,158 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-09 04:45:15,158 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 112 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:15,159 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.6s Time] [2024-11-09 04:45:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-09 04:45:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 550. [2024-11-09 04:45:15,174 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-09 04:45:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 754 transitions. [2024-11-09 04:45:15,177 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 754 transitions. Word has length 46 [2024-11-09 04:45:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:15,177 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 754 transitions. [2024-11-09 04:45:15,178 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-09 04:45:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 754 transitions. [2024-11-09 04:45:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 04:45:15,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:15,179 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-09 04:45:15,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 04:45:15,179 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-09 04:45:15,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash -675025368, now seen corresponding path program 1 times [2024-11-09 04:45:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626196498] [2024-11-09 04:45:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:15,489 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-09 04:45:15,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:15,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626196498] [2024-11-09 04:45:15,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626196498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:15,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:15,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062131722] [2024-11-09 04:45:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:15,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:15,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:15,493 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-09 04:45:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:16,192 INFO L93 Difference]: Finished difference Result 607 states and 846 transitions. [2024-11-09 04:45:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:16,193 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-09 04:45:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:16,196 INFO L225 Difference]: With dead ends: 607 [2024-11-09 04:45:16,196 INFO L226 Difference]: Without dead ends: 607 [2024-11-09 04:45:16,197 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-09 04:45:16,197 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 52 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:16,198 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.6s Time] [2024-11-09 04:45:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-09 04:45:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 590. [2024-11-09 04:45:16,215 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-09 04:45:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 818 transitions. [2024-11-09 04:45:16,218 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 818 transitions. Word has length 46 [2024-11-09 04:45:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 818 transitions. [2024-11-09 04:45:16,218 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-09 04:45:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 818 transitions. [2024-11-09 04:45:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:45:16,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:16,219 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-09 04:45:16,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 04:45:16,219 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-09 04:45:16,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 538550818, now seen corresponding path program 1 times [2024-11-09 04:45:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741795807] [2024-11-09 04:45:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:16,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:16,395 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-09 04:45:16,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741795807] [2024-11-09 04:45:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741795807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182172745] [2024-11-09 04:45:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:16,397 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-09 04:45:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:17,055 INFO L93 Difference]: Finished difference Result 652 states and 920 transitions. [2024-11-09 04:45:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:17,056 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-09 04:45:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:17,060 INFO L225 Difference]: With dead ends: 652 [2024-11-09 04:45:17,060 INFO L226 Difference]: Without dead ends: 652 [2024-11-09 04:45:17,061 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-09 04:45:17,061 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 83 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:17,062 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.6s Time] [2024-11-09 04:45:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-09 04:45:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 626. [2024-11-09 04:45:17,080 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-09 04:45:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2024-11-09 04:45:17,083 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 47 [2024-11-09 04:45:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:17,083 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2024-11-09 04:45:17,084 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-09 04:45:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2024-11-09 04:45:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:45:17,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:17,085 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-09 04:45:17,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 04:45:17,085 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-09 04:45:17,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 538550819, now seen corresponding path program 1 times [2024-11-09 04:45:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:17,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287918005] [2024-11-09 04:45:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:17,387 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-09 04:45:17,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287918005] [2024-11-09 04:45:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287918005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 04:45:17,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711793175] [2024-11-09 04:45:17,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:17,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:45:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:45:17,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:45:17,391 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-09 04:45:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:18,017 INFO L93 Difference]: Finished difference Result 687 states and 964 transitions. [2024-11-09 04:45:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:18,017 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-09 04:45:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:18,022 INFO L225 Difference]: With dead ends: 687 [2024-11-09 04:45:18,022 INFO L226 Difference]: Without dead ends: 687 [2024-11-09 04:45:18,023 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-09 04:45:18,024 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 65 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:18,024 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.6s Time] [2024-11-09 04:45:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-09 04:45:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 666. [2024-11-09 04:45:18,045 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-09 04:45:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 929 transitions. [2024-11-09 04:45:18,048 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 929 transitions. Word has length 47 [2024-11-09 04:45:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:18,048 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 929 transitions. [2024-11-09 04:45:18,048 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-09 04:45:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 929 transitions. [2024-11-09 04:45:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:45:18,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:18,049 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-09 04:45:18,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 04:45:18,050 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-09 04:45:18,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1957486514, now seen corresponding path program 1 times [2024-11-09 04:45:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:18,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62969146] [2024-11-09 04:45:18,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:18,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:18,417 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-09 04:45:18,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62969146] [2024-11-09 04:45:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62969146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:45:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312390858] [2024-11-09 04:45:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:45:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:45:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:45:18,420 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-09 04:45:18,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:18,931 INFO L93 Difference]: Finished difference Result 754 states and 1084 transitions. [2024-11-09 04:45:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 04:45:18,932 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-09 04:45:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:18,937 INFO L225 Difference]: With dead ends: 754 [2024-11-09 04:45:18,937 INFO L226 Difference]: Without dead ends: 754 [2024-11-09 04:45:18,938 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-09 04:45:18,939 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 42 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:18,940 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.5s Time] [2024-11-09 04:45:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-11-09 04:45:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2024-11-09 04:45:18,965 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-09 04:45:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1024 transitions. [2024-11-09 04:45:18,968 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1024 transitions. Word has length 51 [2024-11-09 04:45:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1024 transitions. [2024-11-09 04:45:18,969 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-09 04:45:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1024 transitions. [2024-11-09 04:45:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 04:45:18,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:18,970 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-09 04:45:18,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 04:45:18,971 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-09 04:45:18,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1703136709, now seen corresponding path program 1 times [2024-11-09 04:45:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186695056] [2024-11-09 04:45:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:19,333 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-09 04:45:19,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:19,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186695056] [2024-11-09 04:45:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186695056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 04:45:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679195216] [2024-11-09 04:45:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:19,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 04:45:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 04:45:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:45:19,336 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-09 04:45:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:19,883 INFO L93 Difference]: Finished difference Result 750 states and 1060 transitions. [2024-11-09 04:45:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 04:45:19,883 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-09 04:45:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:19,888 INFO L225 Difference]: With dead ends: 750 [2024-11-09 04:45:19,888 INFO L226 Difference]: Without dead ends: 750 [2024-11-09 04:45:19,888 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-09 04:45:19,889 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 39 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:19,889 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.5s Time] [2024-11-09 04:45:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-09 04:45:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 740. [2024-11-09 04:45:19,910 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-09 04:45:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1038 transitions. [2024-11-09 04:45:19,914 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1038 transitions. Word has length 50 [2024-11-09 04:45:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:19,914 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1038 transitions. [2024-11-09 04:45:19,915 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-09 04:45:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1038 transitions. [2024-11-09 04:45:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 04:45:19,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:19,916 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-09 04:45:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 04:45:19,916 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-09 04:45:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2018008650, now seen corresponding path program 1 times [2024-11-09 04:45:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435296356] [2024-11-09 04:45:19,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:20,074 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-09 04:45:20,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435296356] [2024-11-09 04:45:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435296356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:45:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711679800] [2024-11-09 04:45:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:20,077 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-09 04:45:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:20,487 INFO L93 Difference]: Finished difference Result 782 states and 1148 transitions. [2024-11-09 04:45:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:20,488 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-09 04:45:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:20,493 INFO L225 Difference]: With dead ends: 782 [2024-11-09 04:45:20,493 INFO L226 Difference]: Without dead ends: 782 [2024-11-09 04:45:20,494 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-09 04:45:20,498 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 309 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:20,498 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.4s Time] [2024-11-09 04:45:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-09 04:45:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 739. [2024-11-09 04:45:20,521 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-09 04:45:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1035 transitions. [2024-11-09 04:45:20,524 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1035 transitions. Word has length 50 [2024-11-09 04:45:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:20,525 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1035 transitions. [2024-11-09 04:45:20,525 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-09 04:45:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1035 transitions. [2024-11-09 04:45:20,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:45:20,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:20,526 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-09 04:45:20,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 04:45:20,526 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-09 04:45:20,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2038576210, now seen corresponding path program 1 times [2024-11-09 04:45:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:20,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699361975] [2024-11-09 04:45:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:20,633 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-09 04:45:20,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699361975] [2024-11-09 04:45:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699361975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:45:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381879505] [2024-11-09 04:45:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:20,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:20,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:20,635 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-09 04:45:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:20,906 INFO L93 Difference]: Finished difference Result 737 states and 1033 transitions. [2024-11-09 04:45:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:20,907 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-09 04:45:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:20,911 INFO L225 Difference]: With dead ends: 737 [2024-11-09 04:45:20,911 INFO L226 Difference]: Without dead ends: 737 [2024-11-09 04:45:20,911 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-09 04:45:20,912 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:20,912 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.3s Time] [2024-11-09 04:45:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-11-09 04:45:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-11-09 04:45:20,932 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-09 04:45:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1033 transitions. [2024-11-09 04:45:20,936 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1033 transitions. Word has length 51 [2024-11-09 04:45:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:20,936 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1033 transitions. [2024-11-09 04:45:20,936 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-09 04:45:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1033 transitions. [2024-11-09 04:45:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 04:45:20,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:20,937 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-09 04:45:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 04:45:20,938 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-09 04:45:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2038576209, now seen corresponding path program 1 times [2024-11-09 04:45:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687725536] [2024-11-09 04:45:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:22,326 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-09 04:45:22,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687725536] [2024-11-09 04:45:22,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687725536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:45:22,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212991078] [2024-11-09 04:45:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:22,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:22,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:45:22,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:45:22,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:45:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:22,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-09 04:45:22,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:45:22,681 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-09 04:45:22,787 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-09 04:45:22,847 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-09 04:45:22,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 04:45:22,958 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-09 04:45:22,967 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-09 04:45:22,974 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-09 04:45:23,054 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-09 04:45:23,065 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-09 04:45:23,071 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-09 04:45:23,105 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-09 04:45:23,119 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-09 04:45:23,125 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-09 04:45:23,165 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-09 04:45:23,185 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-09 04:45:23,192 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-09 04:45:23,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:45:23,261 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-09 04:45:23,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:45:23,272 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-09 04:45:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 04:45:23,281 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-09 04:45:23,427 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-09 04:45:23,433 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-09 04:45:23,594 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-09 04:45:23,603 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-09 04:45:23,611 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-09 04:45:23,656 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-09 04:45:23,661 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-09 04:45:23,671 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-09 04:45:23,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:45:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212991078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:45:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [16] total 25 [2024-11-09 04:45:23,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265828206] [2024-11-09 04:45:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:45:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:45:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2024-11-09 04:45:23,675 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-09 04:45:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:24,968 INFO L93 Difference]: Finished difference Result 782 states and 1167 transitions. [2024-11-09 04:45:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 04:45:24,969 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-09 04:45:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:24,974 INFO L225 Difference]: With dead ends: 782 [2024-11-09 04:45:24,974 INFO L226 Difference]: Without dead ends: 782 [2024-11-09 04:45:24,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2024-11-09 04:45:24,975 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 585 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:24,975 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.0s Time] [2024-11-09 04:45:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-09 04:45:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 740. [2024-11-09 04:45:24,998 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-09 04:45:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1036 transitions. [2024-11-09 04:45:25,002 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1036 transitions. Word has length 51 [2024-11-09 04:45:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:25,002 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1036 transitions. [2024-11-09 04:45:25,002 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-09 04:45:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1036 transitions. [2024-11-09 04:45:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 04:45:25,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:25,003 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-09 04:45:25,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:45:25,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:45:25,208 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-09 04:45:25,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash -361540588, now seen corresponding path program 1 times [2024-11-09 04:45:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404697164] [2024-11-09 04:45:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:45:25,348 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-09 04:45:25,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:45:25,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404697164] [2024-11-09 04:45:25,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404697164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:45:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:45:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:45:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658234312] [2024-11-09 04:45:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:45:25,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 04:45:25,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:45:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 04:45:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 04:45:25,351 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-09 04:45:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:45:25,633 INFO L93 Difference]: Finished difference Result 738 states and 1034 transitions. [2024-11-09 04:45:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 04:45:25,633 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-09 04:45:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:45:25,637 INFO L225 Difference]: With dead ends: 738 [2024-11-09 04:45:25,637 INFO L226 Difference]: Without dead ends: 738 [2024-11-09 04:45:25,638 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-09 04:45:25,638 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:45:25,639 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.3s Time] [2024-11-09 04:45:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-09 04:45:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2024-11-09 04:45:25,658 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-09 04:45:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1034 transitions. [2024-11-09 04:45:25,662 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1034 transitions. Word has length 52 [2024-11-09 04:45:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:45:25,662 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1034 transitions. [2024-11-09 04:45:25,662 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-09 04:45:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1034 transitions. [2024-11-09 04:45:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 04:45:25,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:45:25,663 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-09 04:45:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 04:45:25,664 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-09 04:45:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:45:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash -361540587, now seen corresponding path program 1 times [2024-11-09 04:45:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:45:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535124867] [2024-11-09 04:45:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:45:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:45:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:45:25,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:45:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:45:25,780 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:45:25,781 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:45:25,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-11-09 04:45:25,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-11-09 04:45:25,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-11-09 04:45:25,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-11-09 04:45:25,784 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-11-09 04:45:25,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-11-09 04:45:25,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-11-09 04:45:25,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-11-09 04:45:25,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-11-09 04:45:25,785 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-11-09 04:45:25,786 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-11-09 04:45:25,787 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-11-09 04:45:25,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-11-09 04:45:25,789 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-11-09 04:45:25,790 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-11-09 04:45:25,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-11-09 04:45:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-11-09 04:45:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-11-09 04:45:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-11-09 04:45:25,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-11-09 04:45:25,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-11-09 04:45:25,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-11-09 04:45:25,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-11-09 04:45:25,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-11-09 04:45:25,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-11-09 04:45:25,798 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-11-09 04:45:25,799 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-11-09 04:45:25,800 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-11-09 04:45:25,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-11-09 04:45:25,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-11-09 04:45:25,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-11-09 04:45:25,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-11-09 04:45:25,804 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-11-09 04:45:25,805 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-11-09 04:45:25,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-11-09 04:45:25,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-11-09 04:45:25,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-11-09 04:45:25,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-11-09 04:45:25,807 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-11-09 04:45:25,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 04:45:25,811 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-09 04:45:25,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:45:25,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:45:25 BoogieIcfgContainer [2024-11-09 04:45:25,871 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:45:25,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:45:25,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:45:25,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:45:25,872 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:51" (3/4) ... [2024-11-09 04:45:25,873 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 04:45:25,940 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 04:45:25,940 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:45:25,941 INFO L158 Benchmark]: Toolchain (without parser) took 36777.72ms. Allocated memory was 155.2MB in the beginning and 497.0MB in the end (delta: 341.8MB). Free memory was 114.1MB in the beginning and 365.9MB in the end (delta: -251.8MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,941 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 155.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:45:25,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.63ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 85.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.24ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,943 INFO L158 Benchmark]: Boogie Preprocessor took 51.25ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 79.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,943 INFO L158 Benchmark]: RCFGBuilder took 1395.99ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 157.1MB in the end (delta: -77.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,944 INFO L158 Benchmark]: TraceAbstraction took 34448.92ms. Allocated memory was 197.1MB in the beginning and 497.0MB in the end (delta: 299.9MB). Free memory was 156.1MB in the beginning and 369.0MB in the end (delta: -213.0MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,945 INFO L158 Benchmark]: Witness Printer took 69.26ms. Allocated memory is still 497.0MB. Free memory was 369.0MB in the beginning and 365.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:45:25,946 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.31ms. Allocated memory is still 155.2MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.63ms. Allocated memory is still 155.2MB. Free memory was 114.1MB in the beginning and 85.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.24ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 82.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.25ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 79.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1395.99ms. Allocated memory was 155.2MB in the beginning and 197.1MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 157.1MB in the end (delta: -77.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34448.92ms. Allocated memory was 197.1MB in the beginning and 497.0MB in the end (delta: 299.9MB). Free memory was 156.1MB in the beginning and 369.0MB in the end (delta: -213.0MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Witness Printer took 69.26ms. Allocated memory is still 497.0MB. Free memory was 369.0MB in the beginning and 365.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 34.3s, OverallIterations: 33, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4460 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4433 mSDsluCounter, 31543 SdHoareTripleChecker+Invalid, 15.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22485 mSDsCounter, 804 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20828 IncrementalHoareTripleChecker+Invalid, 21632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 804 mSolverCounterUnsat, 9058 mSDtfsCounter, 20828 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.4s 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: 0.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 747 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.8s 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-09 04:45:26,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50df94f6-e2d9-4a1f-9ff9-f7a7b1e58638/bin/utaipan-verify-YMUCfTKeje/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)