./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74e63e86abbcab22438f70ee6d7d7ef12eaada509b0f0a56fb5cf815aaf53aab --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 15:03:48,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 15:03:48,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 15:03:48,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 15:03:48,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 15:03:48,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 15:03:48,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 15:03:48,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 15:03:48,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 15:03:48,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 15:03:48,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 15:03:48,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 15:03:48,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 15:03:48,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 15:03:48,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 15:03:48,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 15:03:48,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 15:03:48,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 15:03:48,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 15:03:48,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 15:03:48,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 15:03:48,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 15:03:48,958 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 15:03:48,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 15:03:48,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 15:03:48,959 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 15:03:48,959 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 15:03:48,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 15:03:48,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 15:03:48,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 15:03:48,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 15:03:48,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 15:03:48,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 15:03:48,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:03:48,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 15:03:48,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 15:03:48,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 15:03:48,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 15:03:48,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 15:03:48,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 15:03:48,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 15:03:48,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 15:03:48,963 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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-20 15:03:49,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 15:03:49,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 15:03:49,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 15:03:49,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 15:03:49,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 15:03:49,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-20 15:03:50,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 15:03:50,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 15:03:50,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2024-11-20 15:03:50,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bdd2bec/f62383580882462e927bd3ea1ccc1573/FLAGeeaf43fab [2024-11-20 15:03:50,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bdd2bec/f62383580882462e927bd3ea1ccc1573 [2024-11-20 15:03:50,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 15:03:50,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 15:03:50,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 15:03:50,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 15:03:51,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 15:03:51,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:03:50" (1/1) ... [2024-11-20 15:03:51,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b94a28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51, skipping insertion in model container [2024-11-20 15:03:51,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:03:50" (1/1) ... [2024-11-20 15:03:51,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 15:03:51,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:03:51,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 15:03:51,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 15:03:51,597 INFO L204 MainTranslator]: Completed translation [2024-11-20 15:03:51,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51 WrapperNode [2024-11-20 15:03:51,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 15:03:51,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 15:03:51,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 15:03:51,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 15:03:51,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,657 INFO L138 Inliner]: procedures = 184, calls = 145, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 236 [2024-11-20 15:03:51,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 15:03:51,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 15:03:51,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 15:03:51,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 15:03:51,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,718 INFO L175 MemorySlicer]: Split 91 memory accesses to 3 slices as follows [2, 19, 70]. 77 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9, 0]. The 44 writes are split as follows [0, 6, 38]. [2024-11-20 15:03:51,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 15:03:51,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 15:03:51,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 15:03:51,761 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 15:03:51,762 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (1/1) ... [2024-11-20 15:03:51,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 15:03:51,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:03:51,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 15:03:51,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 15:03:51,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 15:03:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 15:03:51,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-20 15:03:51,872 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2024-11-20 15:03:51,872 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2024-11-20 15:03:51,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2024-11-20 15:03:51,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2024-11-20 15:03:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure status_update [2024-11-20 15:03:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure status_update [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2024-11-20 15:03:51,873 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2024-11-20 15:03:51,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2024-11-20 15:03:51,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2024-11-20 15:03:51,874 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 15:03:51,874 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2024-11-20 15:03:51,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2024-11-20 15:03:51,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 15:03:51,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 15:03:52,103 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 15:03:52,106 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 15:03:52,924 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2024-11-20 15:03:52,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 15:03:52,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 15:03:52,984 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 15:03:52,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:52 BoogieIcfgContainer [2024-11-20 15:03:52,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 15:03:52,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 15:03:52,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 15:03:52,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 15:03:52,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:03:50" (1/3) ... [2024-11-20 15:03:52,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231ee0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:03:52, skipping insertion in model container [2024-11-20 15:03:52,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:03:51" (2/3) ... [2024-11-20 15:03:53,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@231ee0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:03:53, skipping insertion in model container [2024-11-20 15:03:53,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:52" (3/3) ... [2024-11-20 15:03:53,004 INFO L112 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2024-11-20 15:03:53,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 15:03:53,040 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 158 error locations. [2024-11-20 15:03:53,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 15:03:53,149 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=PETRI_NET, 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;@63d693eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 15:03:53,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 158 error locations. [2024-11-20 15:03:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 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-20 15:03:53,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 15:03:53,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:53,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:53,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:53,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451593, now seen corresponding path program 1 times [2024-11-20 15:03:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:53,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162687811] [2024-11-20 15:03:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:53,544 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-20 15:03:53,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:53,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162687811] [2024-11-20 15:03:53,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162687811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:53,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:53,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:03:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132582241] [2024-11-20 15:03:53,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:53,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 15:03:53,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:53,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 15:03:53,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 15:03:53,582 INFO L87 Difference]: Start difference. First operand has 387 states, 190 states have (on average 1.9842105263157894) internal successors, (377), 348 states have internal predecessors, (377), 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 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 15:03:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:54,310 INFO L93 Difference]: Finished difference Result 473 states and 579 transitions. [2024-11-20 15:03:54,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 15:03:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-20 15:03:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:54,334 INFO L225 Difference]: With dead ends: 473 [2024-11-20 15:03:54,335 INFO L226 Difference]: Without dead ends: 471 [2024-11-20 15:03:54,337 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-20 15:03:54,340 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 582 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:54,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 389 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:03:54,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-20 15:03:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 380. [2024-11-20 15:03:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 202 states have (on average 1.8415841584158417) internal successors, (372), 336 states have internal predecessors, (372), 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-20 15:03:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 441 transitions. [2024-11-20 15:03:54,409 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 441 transitions. Word has length 7 [2024-11-20 15:03:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:54,410 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 441 transitions. [2024-11-20 15:03:54,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 15:03:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 441 transitions. [2024-11-20 15:03:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 15:03:54,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:54,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:54,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 15:03:54,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:54,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1798451592, now seen corresponding path program 1 times [2024-11-20 15:03:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3698881] [2024-11-20 15:03:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:54,598 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-20 15:03:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3698881] [2024-11-20 15:03:54,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3698881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:54,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:03:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159558915] [2024-11-20 15:03:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:54,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:03:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:03:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:03:54,601 INFO L87 Difference]: Start difference. First operand 380 states and 441 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 15:03:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:55,038 INFO L93 Difference]: Finished difference Result 422 states and 509 transitions. [2024-11-20 15:03:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:03:55,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-11-20 15:03:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:55,044 INFO L225 Difference]: With dead ends: 422 [2024-11-20 15:03:55,045 INFO L226 Difference]: Without dead ends: 422 [2024-11-20 15:03:55,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:03:55,046 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 169 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:55,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 747 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 15:03:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-20 15:03:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 377. [2024-11-20 15:03:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 204 states have (on average 1.803921568627451) internal successors, (368), 332 states have internal predecessors, (368), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 437 transitions. [2024-11-20 15:03:55,083 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 437 transitions. Word has length 7 [2024-11-20 15:03:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:55,083 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 437 transitions. [2024-11-20 15:03:55,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-20 15:03:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 437 transitions. [2024-11-20 15:03:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 15:03:55,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:55,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 15:03:55,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -996852037, now seen corresponding path program 1 times [2024-11-20 15:03:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636147079] [2024-11-20 15:03:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:55,267 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-20 15:03:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636147079] [2024-11-20 15:03:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636147079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:03:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290969316] [2024-11-20 15:03:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:55,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:03:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:03:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:03:55,270 INFO L87 Difference]: Start difference. First operand 377 states and 437 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 15:03:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:55,797 INFO L93 Difference]: Finished difference Result 421 states and 508 transitions. [2024-11-20 15:03:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:03:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-20 15:03:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:55,801 INFO L225 Difference]: With dead ends: 421 [2024-11-20 15:03:55,801 INFO L226 Difference]: Without dead ends: 421 [2024-11-20 15:03:55,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:03:55,803 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 158 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:55,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1217 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:03:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-20 15:03:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 376. [2024-11-20 15:03:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 204 states have (on average 1.7990196078431373) internal successors, (367), 331 states have internal predecessors, (367), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 436 transitions. [2024-11-20 15:03:55,833 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 436 transitions. Word has length 11 [2024-11-20 15:03:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:55,834 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 436 transitions. [2024-11-20 15:03:55,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 15:03:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 436 transitions. [2024-11-20 15:03:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 15:03:55,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:55,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:55,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 15:03:55,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:55,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -996852036, now seen corresponding path program 1 times [2024-11-20 15:03:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600122722] [2024-11-20 15:03:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:56,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:56,074 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-20 15:03:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600122722] [2024-11-20 15:03:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600122722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:03:56,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199794203] [2024-11-20 15:03:56,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:56,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:03:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:56,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:03:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:03:56,077 INFO L87 Difference]: Start difference. First operand 376 states and 436 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 15:03:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:56,646 INFO L93 Difference]: Finished difference Result 420 states and 507 transitions. [2024-11-20 15:03:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:03:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-20 15:03:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:56,649 INFO L225 Difference]: With dead ends: 420 [2024-11-20 15:03:56,649 INFO L226 Difference]: Without dead ends: 420 [2024-11-20 15:03:56,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:03:56,650 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 157 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:56,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1190 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:03:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-20 15:03:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 375. [2024-11-20 15:03:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 204 states have (on average 1.7941176470588236) internal successors, (366), 330 states have internal predecessors, (366), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:56,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 435 transitions. [2024-11-20 15:03:56,672 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 435 transitions. Word has length 11 [2024-11-20 15:03:56,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:56,672 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 435 transitions. [2024-11-20 15:03:56,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 15:03:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 435 transitions. [2024-11-20 15:03:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:03:56,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:56,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:56,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 15:03:56,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash -880937440, now seen corresponding path program 1 times [2024-11-20 15:03:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548478182] [2024-11-20 15:03:56,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:56,765 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-20 15:03:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548478182] [2024-11-20 15:03:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548478182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:56,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:03:56,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54610404] [2024-11-20 15:03:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:56,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 15:03:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 15:03:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 15:03:56,769 INFO L87 Difference]: Start difference. First operand 375 states and 435 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 15:03:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:57,090 INFO L93 Difference]: Finished difference Result 419 states and 506 transitions. [2024-11-20 15:03:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 15:03:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-20 15:03:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:57,095 INFO L225 Difference]: With dead ends: 419 [2024-11-20 15:03:57,095 INFO L226 Difference]: Without dead ends: 419 [2024-11-20 15:03:57,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 15:03:57,096 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 157 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:57,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 769 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:03:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-20 15:03:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 374. [2024-11-20 15:03:57,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 204 states have (on average 1.7892156862745099) internal successors, (365), 329 states have internal predecessors, (365), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 434 transitions. [2024-11-20 15:03:57,117 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 434 transitions. Word has length 17 [2024-11-20 15:03:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 434 transitions. [2024-11-20 15:03:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 15:03:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 434 transitions. [2024-11-20 15:03:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 15:03:57,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:57,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:03:57,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 15:03:57,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash -880937439, now seen corresponding path program 1 times [2024-11-20 15:03:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791263734] [2024-11-20 15:03:57,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:57,240 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-20 15:03:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791263734] [2024-11-20 15:03:57,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791263734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:57,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:57,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 15:03:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888210850] [2024-11-20 15:03:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:57,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 15:03:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 15:03:57,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 15:03:57,245 INFO L87 Difference]: Start difference. First operand 374 states and 434 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 15:03:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:57,617 INFO L93 Difference]: Finished difference Result 418 states and 505 transitions. [2024-11-20 15:03:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 15:03:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-20 15:03:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:57,619 INFO L225 Difference]: With dead ends: 418 [2024-11-20 15:03:57,620 INFO L226 Difference]: Without dead ends: 418 [2024-11-20 15:03:57,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 15:03:57,621 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 157 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:57,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 752 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:03:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-20 15:03:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 373. [2024-11-20 15:03:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 204 states have (on average 1.7843137254901962) internal successors, (364), 328 states have internal predecessors, (364), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 433 transitions. [2024-11-20 15:03:57,632 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 433 transitions. Word has length 17 [2024-11-20 15:03:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:57,632 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 433 transitions. [2024-11-20 15:03:57,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-20 15:03:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 433 transitions. [2024-11-20 15:03:57,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 15:03:57,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:57,633 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-20 15:03:57,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 15:03:57,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:57,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1756576041, now seen corresponding path program 1 times [2024-11-20 15:03:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:57,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101554692] [2024-11-20 15:03:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:57,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:57,841 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-20 15:03:57,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101554692] [2024-11-20 15:03:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101554692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 15:03:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563548256] [2024-11-20 15:03:57,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:57,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 15:03:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 15:03:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 15:03:57,844 INFO L87 Difference]: Start difference. First operand 373 states and 433 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 15:03:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:58,714 INFO L93 Difference]: Finished difference Result 443 states and 547 transitions. [2024-11-20 15:03:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 15:03:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-20 15:03:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:58,717 INFO L225 Difference]: With dead ends: 443 [2024-11-20 15:03:58,717 INFO L226 Difference]: Without dead ends: 443 [2024-11-20 15:03:58,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:03:58,719 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 934 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:58,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 398 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 15:03:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-20 15:03:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 354. [2024-11-20 15:03:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 309 states have internal predecessors, (343), 32 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (37), 32 states have call predecessors, (37), 32 states have call successors, (37) [2024-11-20 15:03:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 412 transitions. [2024-11-20 15:03:58,741 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 412 transitions. Word has length 20 [2024-11-20 15:03:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:58,742 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 412 transitions. [2024-11-20 15:03:58,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 15:03:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 412 transitions. [2024-11-20 15:03:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 15:03:58,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:58,743 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] [2024-11-20 15:03:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 15:03:58,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash 83868256, now seen corresponding path program 1 times [2024-11-20 15:03:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784750367] [2024-11-20 15:03:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:58,936 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-20 15:03:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:58,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784750367] [2024-11-20 15:03:58,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784750367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 15:03:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498225649] [2024-11-20 15:03:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 15:03:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 15:03:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 15:03:58,938 INFO L87 Difference]: Start difference. First operand 354 states and 412 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-20 15:03:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:03:59,650 INFO L93 Difference]: Finished difference Result 432 states and 538 transitions. [2024-11-20 15:03:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 15:03:59,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-20 15:03:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:03:59,653 INFO L225 Difference]: With dead ends: 432 [2024-11-20 15:03:59,653 INFO L226 Difference]: Without dead ends: 432 [2024-11-20 15:03:59,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 15:03:59,654 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 221 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:03:59,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1497 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:03:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-20 15:03:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 375. [2024-11-20 15:03:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.662162162162162) internal successors, (369), 327 states have internal predecessors, (369), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-20 15:03:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 442 transitions. [2024-11-20 15:03:59,665 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 442 transitions. Word has length 26 [2024-11-20 15:03:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:03:59,666 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 442 transitions. [2024-11-20 15:03:59,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-20 15:03:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 442 transitions. [2024-11-20 15:03:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 15:03:59,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:03:59,667 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] [2024-11-20 15:03:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 15:03:59,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:03:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:03:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash 83868257, now seen corresponding path program 1 times [2024-11-20 15:03:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:03:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401823966] [2024-11-20 15:03:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:03:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:03:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:03:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:03:59,962 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-20 15:03:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:03:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401823966] [2024-11-20 15:03:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401823966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:03:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:03:59,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 15:03:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891242510] [2024-11-20 15:03:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:03:59,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 15:03:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:03:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 15:03:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 15:03:59,964 INFO L87 Difference]: Start difference. First operand 375 states and 442 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-20 15:04:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:00,689 INFO L93 Difference]: Finished difference Result 431 states and 537 transitions. [2024-11-20 15:04:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 15:04:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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 26 [2024-11-20 15:04:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:00,692 INFO L225 Difference]: With dead ends: 431 [2024-11-20 15:04:00,692 INFO L226 Difference]: Without dead ends: 431 [2024-11-20 15:04:00,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 15:04:00,693 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 219 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:00,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1531 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:04:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-20 15:04:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 375. [2024-11-20 15:04:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 222 states have (on average 1.6576576576576576) internal successors, (368), 327 states have internal predecessors, (368), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (40), 33 states have call predecessors, (40), 33 states have call successors, (40) [2024-11-20 15:04:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 441 transitions. [2024-11-20 15:04:00,703 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 441 transitions. Word has length 26 [2024-11-20 15:04:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:00,703 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 441 transitions. [2024-11-20 15:04:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 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-20 15:04:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 441 transitions. [2024-11-20 15:04:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 15:04:00,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:00,705 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] [2024-11-20 15:04:00,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 15:04:00,705 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1697872296, now seen corresponding path program 1 times [2024-11-20 15:04:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158763689] [2024-11-20 15:04:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:00,938 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-20 15:04:00,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:00,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158763689] [2024-11-20 15:04:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158763689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 15:04:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367519123] [2024-11-20 15:04:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:00,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 15:04:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 15:04:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:04:00,941 INFO L87 Difference]: Start difference. First operand 375 states and 441 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-20 15:04:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:01,341 INFO L93 Difference]: Finished difference Result 468 states and 561 transitions. [2024-11-20 15:04:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 15:04:01,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 27 [2024-11-20 15:04:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:01,343 INFO L225 Difference]: With dead ends: 468 [2024-11-20 15:04:01,344 INFO L226 Difference]: Without dead ends: 468 [2024-11-20 15:04:01,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 15:04:01,345 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 237 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:01,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1774 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-20 15:04:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 452. [2024-11-20 15:04:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 279 states have (on average 1.5448028673835126) internal successors, (431), 382 states have internal predecessors, (431), 41 states have call successors, (41), 18 states have call predecessors, (41), 26 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-20 15:04:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 554 transitions. [2024-11-20 15:04:01,358 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 554 transitions. Word has length 27 [2024-11-20 15:04:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:01,358 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 554 transitions. [2024-11-20 15:04:01,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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-20 15:04:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 554 transitions. [2024-11-20 15:04:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-20 15:04:01,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:01,360 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, 1, 1] [2024-11-20 15:04:01,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 15:04:01,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1466731203, now seen corresponding path program 1 times [2024-11-20 15:04:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71283726] [2024-11-20 15:04:01,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:01,485 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-20 15:04:01,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:01,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71283726] [2024-11-20 15:04:01,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71283726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:01,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:01,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 15:04:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964334578] [2024-11-20 15:04:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:01,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:04:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:04:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:04:01,486 INFO L87 Difference]: Start difference. First operand 452 states and 554 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 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-20 15:04:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:01,851 INFO L93 Difference]: Finished difference Result 468 states and 569 transitions. [2024-11-20 15:04:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 15:04:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 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 38 [2024-11-20 15:04:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:01,854 INFO L225 Difference]: With dead ends: 468 [2024-11-20 15:04:01,854 INFO L226 Difference]: Without dead ends: 466 [2024-11-20 15:04:01,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 15:04:01,854 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 159 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:01,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1318 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-20 15:04:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2024-11-20 15:04:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 287 states have (on average 1.5331010452961673) internal successors, (440), 391 states have internal predecessors, (440), 41 states have call successors, (41), 19 states have call predecessors, (41), 28 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-20 15:04:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 563 transitions. [2024-11-20 15:04:01,869 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 563 transitions. Word has length 38 [2024-11-20 15:04:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:01,869 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 563 transitions. [2024-11-20 15:04:01,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 4 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-20 15:04:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 563 transitions. [2024-11-20 15:04:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 15:04:01,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:01,872 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, 1] [2024-11-20 15:04:01,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 15:04:01,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:01,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:01,872 INFO L85 PathProgramCache]: Analyzing trace with hash -850465204, now seen corresponding path program 1 times [2024-11-20 15:04:01,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:01,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118412014] [2024-11-20 15:04:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:01,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 15:04:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 15:04:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:02,247 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-20 15:04:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118412014] [2024-11-20 15:04:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118412014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 15:04:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800393598] [2024-11-20 15:04:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:02,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 15:04:02,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 15:04:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:04:02,249 INFO L87 Difference]: Start difference. First operand 462 states and 563 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-20 15:04:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:03,382 INFO L93 Difference]: Finished difference Result 493 states and 615 transitions. [2024-11-20 15:04:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 15:04:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 37 [2024-11-20 15:04:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:03,386 INFO L225 Difference]: With dead ends: 493 [2024-11-20 15:04:03,386 INFO L226 Difference]: Without dead ends: 486 [2024-11-20 15:04:03,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-20 15:04:03,387 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 181 mSDsluCounter, 2073 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:03,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 2370 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 15:04:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-20 15:04:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 462. [2024-11-20 15:04:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 287 states have (on average 1.529616724738676) internal successors, (439), 391 states have internal predecessors, (439), 41 states have call successors, (41), 19 states have call predecessors, (41), 28 states have return successors, (82), 51 states have call predecessors, (82), 41 states have call successors, (82) [2024-11-20 15:04:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 562 transitions. [2024-11-20 15:04:03,406 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 562 transitions. Word has length 37 [2024-11-20 15:04:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:03,407 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 562 transitions. [2024-11-20 15:04:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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-20 15:04:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 562 transitions. [2024-11-20 15:04:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-20 15:04:03,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:03,409 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, 1, 1, 1, 1] [2024-11-20 15:04:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 15:04:03,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:03,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1140093467, now seen corresponding path program 1 times [2024-11-20 15:04:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:03,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273708592] [2024-11-20 15:04:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:03,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:03,706 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-20 15:04:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273708592] [2024-11-20 15:04:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273708592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 15:04:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120511923] [2024-11-20 15:04:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:03,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 15:04:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 15:04:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:04:03,708 INFO L87 Difference]: Start difference. First operand 462 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 5 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-20 15:04:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:05,165 INFO L93 Difference]: Finished difference Result 621 states and 847 transitions. [2024-11-20 15:04:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 15:04:05,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 5 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 40 [2024-11-20 15:04:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:05,170 INFO L225 Difference]: With dead ends: 621 [2024-11-20 15:04:05,170 INFO L226 Difference]: Without dead ends: 617 [2024-11-20 15:04:05,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2024-11-20 15:04:05,172 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 652 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:05,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 2672 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 15:04:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-20 15:04:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 541. [2024-11-20 15:04:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 349 states have (on average 1.518624641833811) internal successors, (530), 448 states have internal predecessors, (530), 51 states have call successors, (51), 24 states have call predecessors, (51), 35 states have return successors, (123), 68 states have call predecessors, (123), 51 states have call successors, (123) [2024-11-20 15:04:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 704 transitions. [2024-11-20 15:04:05,193 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 704 transitions. Word has length 40 [2024-11-20 15:04:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:05,193 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 704 transitions. [2024-11-20 15:04:05,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (5), 5 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-20 15:04:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 704 transitions. [2024-11-20 15:04:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 15:04:05,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:05,195 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, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:05,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 15:04:05,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:05,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 884069767, now seen corresponding path program 1 times [2024-11-20 15:04:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661692148] [2024-11-20 15:04:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:05,939 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-20 15:04:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661692148] [2024-11-20 15:04:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661692148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 15:04:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838821192] [2024-11-20 15:04:05,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:05,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 15:04:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:05,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 15:04:05,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:04:05,943 INFO L87 Difference]: Start difference. First operand 541 states and 704 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 2 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-20 15:04:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:07,007 INFO L93 Difference]: Finished difference Result 834 states and 1187 transitions. [2024-11-20 15:04:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 15:04:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 2 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 42 [2024-11-20 15:04:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:07,013 INFO L225 Difference]: With dead ends: 834 [2024-11-20 15:04:07,013 INFO L226 Difference]: Without dead ends: 832 [2024-11-20 15:04:07,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-20 15:04:07,014 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1052 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:07,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1470 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 15:04:07,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-11-20 15:04:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 676. [2024-11-20 15:04:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 454 states have (on average 1.4823788546255507) internal successors, (673), 554 states have internal predecessors, (673), 66 states have call successors, (66), 32 states have call predecessors, (66), 50 states have return successors, (188), 89 states have call predecessors, (188), 66 states have call successors, (188) [2024-11-20 15:04:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 927 transitions. [2024-11-20 15:04:07,044 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 927 transitions. Word has length 42 [2024-11-20 15:04:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:07,044 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 927 transitions. [2024-11-20 15:04:07,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 2 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-20 15:04:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 927 transitions. [2024-11-20 15:04:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-20 15:04:07,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:07,045 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, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:07,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 15:04:07,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:07,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash 884069768, now seen corresponding path program 1 times [2024-11-20 15:04:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:07,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789447706] [2024-11-20 15:04:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:07,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:08,277 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-20 15:04:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:08,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789447706] [2024-11-20 15:04:08,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789447706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 15:04:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487066122] [2024-11-20 15:04:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:08,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 15:04:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:08,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 15:04:08,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 15:04:08,280 INFO L87 Difference]: Start difference. First operand 676 states and 927 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 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-20 15:04:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:09,724 INFO L93 Difference]: Finished difference Result 909 states and 1240 transitions. [2024-11-20 15:04:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 15:04:09,724 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 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 42 [2024-11-20 15:04:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:09,730 INFO L225 Difference]: With dead ends: 909 [2024-11-20 15:04:09,730 INFO L226 Difference]: Without dead ends: 909 [2024-11-20 15:04:09,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2024-11-20 15:04:09,732 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 870 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:09,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1562 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 15:04:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-20 15:04:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 702. [2024-11-20 15:04:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 475 states have (on average 1.4589473684210525) internal successors, (693), 565 states have internal predecessors, (693), 65 states have call successors, (65), 32 states have call predecessors, (65), 56 states have return successors, (218), 104 states have call predecessors, (218), 65 states have call successors, (218) [2024-11-20 15:04:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 976 transitions. [2024-11-20 15:04:09,761 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 976 transitions. Word has length 42 [2024-11-20 15:04:09,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:09,763 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 976 transitions. [2024-11-20 15:04:09,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 2 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-20 15:04:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 976 transitions. [2024-11-20 15:04:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 15:04:09,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:09,764 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:09,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 15:04:09,765 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:09,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -812476152, now seen corresponding path program 1 times [2024-11-20 15:04:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55769695] [2024-11-20 15:04:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:09,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:09,856 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-20 15:04:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:09,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55769695] [2024-11-20 15:04:09,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55769695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:09,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:09,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:04:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355814585] [2024-11-20 15:04:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:09,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:04:09,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:04:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:04:09,863 INFO L87 Difference]: Start difference. First operand 702 states and 976 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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-20 15:04:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:10,204 INFO L93 Difference]: Finished difference Result 746 states and 1047 transitions. [2024-11-20 15:04:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 15:04:10,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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 44 [2024-11-20 15:04:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:10,210 INFO L225 Difference]: With dead ends: 746 [2024-11-20 15:04:10,210 INFO L226 Difference]: Without dead ends: 746 [2024-11-20 15:04:10,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:04:10,211 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 289 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:10,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 711 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-11-20 15:04:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 700. [2024-11-20 15:04:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 475 states have (on average 1.4505263157894737) internal successors, (689), 563 states have internal predecessors, (689), 65 states have call successors, (65), 32 states have call predecessors, (65), 56 states have return successors, (218), 104 states have call predecessors, (218), 65 states have call successors, (218) [2024-11-20 15:04:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 972 transitions. [2024-11-20 15:04:10,236 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 972 transitions. Word has length 44 [2024-11-20 15:04:10,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:10,236 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 972 transitions. [2024-11-20 15:04:10,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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-20 15:04:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 972 transitions. [2024-11-20 15:04:10,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 15:04:10,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:10,238 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 15:04:10,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:10,239 INFO L85 PathProgramCache]: Analyzing trace with hash -812476151, now seen corresponding path program 1 times [2024-11-20 15:04:10,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746029119] [2024-11-20 15:04:10,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:10,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:10,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-20 15:04:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746029119] [2024-11-20 15:04:10,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746029119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:10,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:10,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 15:04:10,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361815784] [2024-11-20 15:04:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:10,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 15:04:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 15:04:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 15:04:10,389 INFO L87 Difference]: Start difference. First operand 700 states and 972 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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-20 15:04:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:10,749 INFO L93 Difference]: Finished difference Result 744 states and 1043 transitions. [2024-11-20 15:04:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 15:04:10,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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 44 [2024-11-20 15:04:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:10,754 INFO L225 Difference]: With dead ends: 744 [2024-11-20 15:04:10,754 INFO L226 Difference]: Without dead ends: 744 [2024-11-20 15:04:10,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:04:10,755 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 145 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:10,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 871 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-11-20 15:04:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 698. [2024-11-20 15:04:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 475 states have (on average 1.4421052631578948) internal successors, (685), 561 states have internal predecessors, (685), 65 states have call successors, (65), 32 states have call predecessors, (65), 56 states have return successors, (218), 104 states have call predecessors, (218), 65 states have call successors, (218) [2024-11-20 15:04:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 968 transitions. [2024-11-20 15:04:10,781 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 968 transitions. Word has length 44 [2024-11-20 15:04:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:10,781 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 968 transitions. [2024-11-20 15:04:10,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (5), 3 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-20 15:04:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 968 transitions. [2024-11-20 15:04:10,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 15:04:10,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:10,782 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:10,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 15:04:10,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:10,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash 148800592, now seen corresponding path program 1 times [2024-11-20 15:04:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016083021] [2024-11-20 15:04:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:11,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016083021] [2024-11-20 15:04:11,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016083021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:04:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911811674] [2024-11-20 15:04:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:11,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:04:11,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:04:11,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:04:11,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 15:04:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:11,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 15:04:11,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:04:11,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-20 15:04:11,554 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 15 treesize of output 7 [2024-11-20 15:04:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:11,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 15:04:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911811674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 15:04:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 20 [2024-11-20 15:04:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208645801] [2024-11-20 15:04:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 15:04:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 15:04:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2024-11-20 15:04:11,596 INFO L87 Difference]: Start difference. First operand 698 states and 968 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 15:04:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:12,058 INFO L93 Difference]: Finished difference Result 906 states and 1354 transitions. [2024-11-20 15:04:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 15:04:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-20 15:04:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:12,065 INFO L225 Difference]: With dead ends: 906 [2024-11-20 15:04:12,065 INFO L226 Difference]: Without dead ends: 902 [2024-11-20 15:04:12,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2024-11-20 15:04:12,066 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 193 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:12,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 2512 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 15:04:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-20 15:04:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 857. [2024-11-20 15:04:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 600 states have (on average 1.4133333333333333) internal successors, (848), 677 states have internal predecessors, (848), 81 states have call successors, (81), 40 states have call predecessors, (81), 74 states have return successors, (379), 139 states have call predecessors, (379), 81 states have call successors, (379) [2024-11-20 15:04:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1308 transitions. [2024-11-20 15:04:12,108 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1308 transitions. Word has length 53 [2024-11-20 15:04:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:12,108 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1308 transitions. [2024-11-20 15:04:12,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 15:04:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1308 transitions. [2024-11-20 15:04:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 15:04:12,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:12,109 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, 1, 1] [2024-11-20 15:04:12,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 15:04:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 15:04:12,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 315030120, now seen corresponding path program 1 times [2024-11-20 15:04:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34791718] [2024-11-20 15:04:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:12,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34791718] [2024-11-20 15:04:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34791718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 15:04:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193033782] [2024-11-20 15:04:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 15:04:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 15:04:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 15:04:12,497 INFO L87 Difference]: Start difference. First operand 857 states and 1308 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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-20 15:04:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:13,327 INFO L93 Difference]: Finished difference Result 1079 states and 1752 transitions. [2024-11-20 15:04:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 15:04:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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 54 [2024-11-20 15:04:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:13,335 INFO L225 Difference]: With dead ends: 1079 [2024-11-20 15:04:13,335 INFO L226 Difference]: Without dead ends: 1079 [2024-11-20 15:04:13,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-20 15:04:13,336 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 334 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1676 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 15:04:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-20 15:04:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 967. [2024-11-20 15:04:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 690 states have (on average 1.4115942028985506) internal successors, (974), 772 states have internal predecessors, (974), 93 states have call successors, (93), 51 states have call predecessors, (93), 82 states have return successors, (462), 143 states have call predecessors, (462), 93 states have call successors, (462) [2024-11-20 15:04:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1529 transitions. [2024-11-20 15:04:13,371 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1529 transitions. Word has length 54 [2024-11-20 15:04:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:13,372 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1529 transitions. [2024-11-20 15:04:13,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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-20 15:04:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1529 transitions. [2024-11-20 15:04:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 15:04:13,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:13,373 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, 1, 1] [2024-11-20 15:04:13,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 15:04:13,373 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:13,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 315030121, now seen corresponding path program 1 times [2024-11-20 15:04:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829691104] [2024-11-20 15:04:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829691104] [2024-11-20 15:04:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829691104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:13,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:13,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 15:04:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932928263] [2024-11-20 15:04:13,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:13,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 15:04:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:13,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 15:04:13,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 15:04:13,665 INFO L87 Difference]: Start difference. First operand 967 states and 1529 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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-20 15:04:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:14,347 INFO L93 Difference]: Finished difference Result 1062 states and 1703 transitions. [2024-11-20 15:04:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 15:04:14,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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 54 [2024-11-20 15:04:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:14,354 INFO L225 Difference]: With dead ends: 1062 [2024-11-20 15:04:14,354 INFO L226 Difference]: Without dead ends: 1062 [2024-11-20 15:04:14,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-20 15:04:14,356 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 389 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:14,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1581 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:04:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2024-11-20 15:04:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1015. [2024-11-20 15:04:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 732 states have (on average 1.407103825136612) internal successors, (1030), 814 states have internal predecessors, (1030), 95 states have call successors, (95), 55 states have call predecessors, (95), 86 states have return successors, (470), 145 states have call predecessors, (470), 95 states have call successors, (470) [2024-11-20 15:04:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1595 transitions. [2024-11-20 15:04:14,394 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1595 transitions. Word has length 54 [2024-11-20 15:04:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:14,395 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1595 transitions. [2024-11-20 15:04:14,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (7), 5 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-20 15:04:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1595 transitions. [2024-11-20 15:04:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-20 15:04:14,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:14,396 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, 1, 1, 1] [2024-11-20 15:04:14,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 15:04:14,396 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:14,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1173721710, now seen corresponding path program 1 times [2024-11-20 15:04:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678082144] [2024-11-20 15:04:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:14,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:14,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678082144] [2024-11-20 15:04:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678082144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 15:04:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759395303] [2024-11-20 15:04:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:14,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 15:04:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 15:04:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-20 15:04:14,660 INFO L87 Difference]: Start difference. First operand 1015 states and 1595 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 15:04:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:15,238 INFO L93 Difference]: Finished difference Result 1145 states and 1819 transitions. [2024-11-20 15:04:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 15:04:15,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2024-11-20 15:04:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:15,245 INFO L225 Difference]: With dead ends: 1145 [2024-11-20 15:04:15,245 INFO L226 Difference]: Without dead ends: 1145 [2024-11-20 15:04:15,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-20 15:04:15,246 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 455 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:15,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 2644 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:04:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-20 15:04:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1119. [2024-11-20 15:04:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 813 states have (on average 1.3653136531365313) internal successors, (1110), 886 states have internal predecessors, (1110), 97 states have call successors, (97), 59 states have call predecessors, (97), 107 states have return successors, (595), 173 states have call predecessors, (595), 97 states have call successors, (595) [2024-11-20 15:04:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1802 transitions. [2024-11-20 15:04:15,285 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1802 transitions. Word has length 55 [2024-11-20 15:04:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:15,285 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1802 transitions. [2024-11-20 15:04:15,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 15:04:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1802 transitions. [2024-11-20 15:04:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 15:04:15,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:15,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 15:04:15,287 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -337077908, now seen corresponding path program 1 times [2024-11-20 15:04:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745462902] [2024-11-20 15:04:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:15,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 15:04:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 15:04:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745462902] [2024-11-20 15:04:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745462902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:04:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670075329] [2024-11-20 15:04:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:04:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:15,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:04:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:04:15,398 INFO L87 Difference]: Start difference. First operand 1119 states and 1802 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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-20 15:04:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:15,749 INFO L93 Difference]: Finished difference Result 1121 states and 1804 transitions. [2024-11-20 15:04:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:04:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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 62 [2024-11-20 15:04:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:15,755 INFO L225 Difference]: With dead ends: 1121 [2024-11-20 15:04:15,755 INFO L226 Difference]: Without dead ends: 1121 [2024-11-20 15:04:15,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:04:15,756 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 142 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:15,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1047 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 15:04:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2024-11-20 15:04:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1117. [2024-11-20 15:04:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 813 states have (on average 1.3628536285362853) internal successors, (1108), 884 states have internal predecessors, (1108), 97 states have call successors, (97), 59 states have call predecessors, (97), 107 states have return successors, (595), 173 states have call predecessors, (595), 97 states have call successors, (595) [2024-11-20 15:04:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1800 transitions. [2024-11-20 15:04:15,791 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1800 transitions. Word has length 62 [2024-11-20 15:04:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:15,791 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1800 transitions. [2024-11-20 15:04:15,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 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-20 15:04:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1800 transitions. [2024-11-20 15:04:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 15:04:15,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:15,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 15:04:15,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash -337077907, now seen corresponding path program 1 times [2024-11-20 15:04:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459556403] [2024-11-20 15:04:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 15:04:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-20 15:04:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459556403] [2024-11-20 15:04:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459556403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 15:04:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387230671] [2024-11-20 15:04:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 15:04:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:16,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 15:04:16,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 15:04:16,125 INFO L87 Difference]: Start difference. First operand 1117 states and 1800 transitions. Second operand has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 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-20 15:04:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:16,850 INFO L93 Difference]: Finished difference Result 1380 states and 2289 transitions. [2024-11-20 15:04:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 15:04:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 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 62 [2024-11-20 15:04:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:16,858 INFO L225 Difference]: With dead ends: 1380 [2024-11-20 15:04:16,858 INFO L226 Difference]: Without dead ends: 1380 [2024-11-20 15:04:16,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-20 15:04:16,859 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 404 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:16,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2824 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 15:04:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-20 15:04:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1312. [2024-11-20 15:04:16,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 980 states have (on average 1.3479591836734695) internal successors, (1321), 1051 states have internal predecessors, (1321), 109 states have call successors, (109), 79 states have call predecessors, (109), 123 states have return successors, (668), 181 states have call predecessors, (668), 109 states have call successors, (668) [2024-11-20 15:04:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2098 transitions. [2024-11-20 15:04:16,907 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2098 transitions. Word has length 62 [2024-11-20 15:04:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:16,907 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 2098 transitions. [2024-11-20 15:04:16,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 5 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-20 15:04:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2098 transitions. [2024-11-20 15:04:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 15:04:16,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:16,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:16,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 15:04:16,908 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:16,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:16,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1986376205, now seen corresponding path program 1 times [2024-11-20 15:04:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957807115] [2024-11-20 15:04:16,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 15:04:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 15:04:17,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957807115] [2024-11-20 15:04:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957807115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 15:04:17,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148853499] [2024-11-20 15:04:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:17,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 15:04:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 15:04:17,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 15:04:17,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 15:04:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:18,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-20 15:04:18,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 15:04:18,095 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-20 15:04:18,112 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 19 treesize of output 1 [2024-11-20 15:04:18,133 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-20 15:04:18,186 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 15:04:18,186 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 82 treesize of output 75 [2024-11-20 15:04:18,193 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 31 treesize of output 21 [2024-11-20 15:04:18,197 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 42 treesize of output 25 [2024-11-20 15:04:18,236 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 47 treesize of output 29 [2024-11-20 15:04:18,243 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 30 treesize of output 25 [2024-11-20 15:04:18,249 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 37 treesize of output 25 [2024-11-20 15:04:18,265 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 51 treesize of output 29 [2024-11-20 15:04:18,270 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 30 treesize of output 25 [2024-11-20 15:04:18,275 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-20 15:04:18,293 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 51 treesize of output 29 [2024-11-20 15:04:18,303 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 30 treesize of output 25 [2024-11-20 15:04:18,307 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-20 15:04:18,385 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 32 treesize of output 20 [2024-11-20 15:04:18,389 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 15 treesize of output 9 [2024-11-20 15:04:18,394 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 9 treesize of output 3 [2024-11-20 15:04:18,483 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 47 treesize of output 29 [2024-11-20 15:04:18,491 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 30 treesize of output 25 [2024-11-20 15:04:18,495 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 37 treesize of output 25 [2024-11-20 15:04:18,523 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 41 treesize of output 23 [2024-11-20 15:04:18,527 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 25 treesize of output 13 [2024-11-20 15:04:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 15:04:18,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 15:04:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148853499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 15:04:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 18 [2024-11-20 15:04:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431610655] [2024-11-20 15:04:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 15:04:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 15:04:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-20 15:04:18,540 INFO L87 Difference]: Start difference. First operand 1312 states and 2098 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-20 15:04:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:19,155 INFO L93 Difference]: Finished difference Result 1309 states and 2082 transitions. [2024-11-20 15:04:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 15:04:19,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 62 [2024-11-20 15:04:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:19,162 INFO L225 Difference]: With dead ends: 1309 [2024-11-20 15:04:19,162 INFO L226 Difference]: Without dead ends: 1309 [2024-11-20 15:04:19,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-20 15:04:19,163 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 277 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:19,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1794 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 15:04:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-20 15:04:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1293. [2024-11-20 15:04:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 963 states have (on average 1.3499480789200415) internal successors, (1300), 1034 states have internal predecessors, (1300), 108 states have call successors, (108), 78 states have call predecessors, (108), 122 states have return successors, (659), 180 states have call predecessors, (659), 108 states have call successors, (659) [2024-11-20 15:04:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 2067 transitions. [2024-11-20 15:04:19,204 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 2067 transitions. Word has length 62 [2024-11-20 15:04:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:19,205 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 2067 transitions. [2024-11-20 15:04:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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-20 15:04:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 2067 transitions. [2024-11-20 15:04:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 15:04:19,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:19,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:19,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 15:04:19,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 15:04:19,411 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:19,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772222, now seen corresponding path program 1 times [2024-11-20 15:04:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:19,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884979241] [2024-11-20 15:04:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 15:04:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 15:04:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 15:04:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 15:04:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 15:04:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 15:04:19,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884979241] [2024-11-20 15:04:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884979241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 15:04:19,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 15:04:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 15:04:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885455702] [2024-11-20 15:04:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 15:04:19,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 15:04:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 15:04:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 15:04:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 15:04:19,533 INFO L87 Difference]: Start difference. First operand 1293 states and 2067 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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-20 15:04:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 15:04:19,967 INFO L93 Difference]: Finished difference Result 1295 states and 2069 transitions. [2024-11-20 15:04:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 15:04:19,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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 63 [2024-11-20 15:04:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 15:04:19,975 INFO L225 Difference]: With dead ends: 1295 [2024-11-20 15:04:19,975 INFO L226 Difference]: Without dead ends: 1295 [2024-11-20 15:04:19,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 15:04:19,976 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 142 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 15:04:19,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1041 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 15:04:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-20 15:04:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1291. [2024-11-20 15:04:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 963 states have (on average 1.347871235721703) internal successors, (1298), 1032 states have internal predecessors, (1298), 108 states have call successors, (108), 78 states have call predecessors, (108), 122 states have return successors, (659), 180 states have call predecessors, (659), 108 states have call successors, (659) [2024-11-20 15:04:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2065 transitions. [2024-11-20 15:04:20,034 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2065 transitions. Word has length 63 [2024-11-20 15:04:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 15:04:20,035 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 2065 transitions. [2024-11-20 15:04:20,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 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-20 15:04:20,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2065 transitions. [2024-11-20 15:04:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 15:04:20,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 15:04:20,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 15:04:20,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 15:04:20,037 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 155 more)] === [2024-11-20 15:04:20,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 15:04:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1411772221, now seen corresponding path program 1 times [2024-11-20 15:04:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 15:04:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805625720] [2024-11-20 15:04:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 15:04:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 15:04:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 15:04:20,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 15:04:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 15:04:20,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 15:04:20,163 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 15:04:20,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ASStartErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 158 remaining) [2024-11-20 15:04:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 158 remaining) [2024-11-20 15:04:20,166 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 158 remaining) [2024-11-20 15:04:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 158 remaining) [2024-11-20 15:04:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 158 remaining) [2024-11-20 15:04:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 158 remaining) [2024-11-20 15:04:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 158 remaining) [2024-11-20 15:04:20,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 158 remaining) [2024-11-20 15:04:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 158 remaining) [2024-11-20 15:04:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 158 remaining) [2024-11-20 15:04:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 158 remaining) [2024-11-20 15:04:20,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 158 remaining) [2024-11-20 15:04:20,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 158 remaining) [2024-11-20 15:04:20,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 158 remaining) [2024-11-20 15:04:20,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 158 remaining) [2024-11-20 15:04:20,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 158 remaining) [2024-11-20 15:04:20,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 158 remaining) [2024-11-20 15:04:20,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 158 remaining) [2024-11-20 15:04:20,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 158 remaining) [2024-11-20 15:04:20,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 158 remaining) [2024-11-20 15:04:20,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 158 remaining) [2024-11-20 15:04:20,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStartErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 158 remaining) [2024-11-20 15:04:20,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 158 remaining) [2024-11-20 15:04:20,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location system_initializeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 158 remaining) [2024-11-20 15:04:20,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 158 remaining) [2024-11-20 15:04:20,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 158 remaining) [2024-11-20 15:04:20,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 158 remaining) [2024-11-20 15:04:20,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location status_updateErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 158 remaining) [2024-11-20 15:04:20,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 158 remaining) [2024-11-20 15:04:20,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 158 remaining) [2024-11-20 15:04:20,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 158 remaining) [2024-11-20 15:04:20,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 158 remaining) [2024-11-20 15:04:20,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 158 remaining) [2024-11-20 15:04:20,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 158 remaining) [2024-11-20 15:04:20,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 158 remaining) [2024-11-20 15:04:20,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 158 remaining) [2024-11-20 15:04:20,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 158 remaining) [2024-11-20 15:04:20,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 158 remaining) [2024-11-20 15:04:20,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 158 remaining) [2024-11-20 15:04:20,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 158 remaining) [2024-11-20 15:04:20,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 158 remaining) [2024-11-20 15:04:20,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 158 remaining) [2024-11-20 15:04:20,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 158 remaining) [2024-11-20 15:04:20,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 158 remaining) [2024-11-20 15:04:20,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 158 remaining) [2024-11-20 15:04:20,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 158 remaining) [2024-11-20 15:04:20,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 158 remaining) [2024-11-20 15:04:20,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 158 remaining) [2024-11-20 15:04:20,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 158 remaining) [2024-11-20 15:04:20,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 158 remaining) [2024-11-20 15:04:20,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 158 remaining) [2024-11-20 15:04:20,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 158 remaining) [2024-11-20 15:04:20,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 158 remaining) [2024-11-20 15:04:20,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 158 remaining) [2024-11-20 15:04:20,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 158 remaining) [2024-11-20 15:04:20,185 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 158 remaining) [2024-11-20 15:04:20,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 158 remaining) [2024-11-20 15:04:20,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 158 remaining) [2024-11-20 15:04:20,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 158 remaining) [2024-11-20 15:04:20,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 158 remaining) [2024-11-20 15:04:20,186 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 158 remaining) [2024-11-20 15:04:20,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 158 remaining) [2024-11-20 15:04:20,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 158 remaining) [2024-11-20 15:04:20,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 158 remaining) [2024-11-20 15:04:20,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 158 remaining) [2024-11-20 15:04:20,187 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location message_sendErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 158 remaining) [2024-11-20 15:04:20,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 158 remaining) [2024-11-20 15:04:20,188 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location event_precessErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 158 remaining) [2024-11-20 15:04:20,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 158 remaining) [2024-11-20 15:04:20,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 158 remaining) [2024-11-20 15:04:20,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (33 of 158 remaining) [2024-11-20 15:04:20,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASStopErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (32 of 158 remaining) [2024-11-20 15:04:20,189 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 158 remaining) [2024-11-20 15:04:20,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASNullErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 158 remaining) [2024-11-20 15:04:20,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 158 remaining) [2024-11-20 15:04:20,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 158 remaining) [2024-11-20 15:04:20,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 158 remaining) [2024-11-20 15:04:20,191 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 158 remaining) [2024-11-20 15:04:20,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 158 remaining) [2024-11-20 15:04:20,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 158 remaining) [2024-11-20 15:04:20,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 158 remaining) [2024-11-20 15:04:20,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ASIdleErr12ASSERT_VIOLATIONMEMORY_LEAK (17 of 158 remaining) [2024-11-20 15:04:20,192 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 158 remaining) [2024-11-20 15:04:20,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 158 remaining) [2024-11-20 15:04:20,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 158 remaining) [2024-11-20 15:04:20,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 158 remaining) [2024-11-20 15:04:20,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 158 remaining) [2024-11-20 15:04:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 15:04:20,199 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] [2024-11-20 15:04:20,244 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 15:04:20,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:04:20 BoogieIcfgContainer [2024-11-20 15:04:20,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 15:04:20,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 15:04:20,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 15:04:20,251 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 15:04:20,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:03:52" (3/4) ... [2024-11-20 15:04:20,252 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 15:04:20,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 15:04:20,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 15:04:20,318 INFO L158 Benchmark]: Toolchain (without parser) took 29326.87ms. Allocated memory was 169.9MB in the beginning and 539.0MB in the end (delta: 369.1MB). Free memory was 93.3MB in the beginning and 399.5MB in the end (delta: -306.2MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,318 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 15:04:20,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.44ms. Allocated memory is still 169.9MB. Free memory was 93.0MB in the beginning and 128.0MB in the end (delta: -35.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 125.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,319 INFO L158 Benchmark]: Boogie Preprocessor took 102.07ms. Allocated memory is still 169.9MB. Free memory was 124.4MB in the beginning and 119.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,319 INFO L158 Benchmark]: RCFGBuilder took 1225.03ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 133.5MB in the end (delta: -13.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,319 INFO L158 Benchmark]: TraceAbstraction took 27262.51ms. Allocated memory was 169.9MB in the beginning and 539.0MB in the end (delta: 369.1MB). Free memory was 132.7MB in the beginning and 402.6MB in the end (delta: -269.9MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,319 INFO L158 Benchmark]: Witness Printer took 66.76ms. Allocated memory is still 539.0MB. Free memory was 402.6MB in the beginning and 399.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 15:04:20,320 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.20ms. Allocated memory is still 169.9MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.44ms. Allocated memory is still 169.9MB. Free memory was 93.0MB in the beginning and 128.0MB in the end (delta: -35.0MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 169.9MB. Free memory was 128.0MB in the beginning and 125.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.07ms. Allocated memory is still 169.9MB. Free memory was 124.4MB in the beginning and 119.6MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1225.03ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 133.5MB in the end (delta: -13.9MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 27262.51ms. Allocated memory was 169.9MB in the beginning and 539.0MB in the end (delta: 369.1MB). Free memory was 132.7MB in the beginning and 402.6MB in the end (delta: -269.9MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 66.76ms. Allocated memory is still 539.0MB. Free memory was 402.6MB in the beginning and 399.5MB 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; VAL [user={0:0}] [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)) VAL [user={-1:0}] [L967] user->message.id = 11 VAL [user={-1:0}] [L968] EXPR user->info VAL [user={-1:0}] [L968] user->info->is_valid = 0 VAL [user={-1:0}] [L969] user->status = AS_NULL VAL [user={-1:0}] [L970] user->user_id = 11 VAL [user={-1:0}] [L971] user->timeout = 3 VAL [user={-1:0}] [L976] RET user_initialize() [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; [L977] event_t e = {0}; VAL [user={-1:0}] [L978] e.primitive = _EVENT_START VAL [user={-1:0}] [L979] CALL event_precess(&e) VAL [\old(e)={10:0}, user={-1:0}] [L943] EXPR user->status VAL [\old(e)={10:0}, e={10:0}, user={-1:0}] [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 VAL [\old(e)={10:0}, user={-1:0}] [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 VAL [\old(status)=2, user={-1:0}] [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}; [L829] event_t e = {0}; [L829] event_t e = {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 VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [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 VAL [\old(e)={9:0}, e={9:0}, user={-1:0}] [L881] e_primitive_t primitive = e->primitive; [L882] int rc = -1; [L884] case _EVENT_OPEN: VAL [\old(e)={9:0}, e={9:0}, primitive=3, rc=-1, user={-1:0}] [L884] case _EVENT_OPEN: [L898] case _EVENT_CLOSE: VAL [\old(e)={9:0}, e={9:0}, rc=-1, user={-1:0}] [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, 387 locations, 158 error locations. Started 1 CEGAR loops. OverallTime: 27.1s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8682 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8675 mSDsluCounter, 36357 SdHoareTripleChecker+Invalid, 12.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27982 mSDsCounter, 2418 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16805 IncrementalHoareTripleChecker+Invalid, 19223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2418 mSolverCounterUnsat, 8375 mSDtfsCounter, 16805 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1312occurred in iteration=23, InterpolantAutomatonStates: 230, 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, 25 MinimizatonAttempts, 1415 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 5739 SizeOfPredicates, 20 NumberOfNonLiveVariables, 971 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 27 InterpolantComputations, 25 PerfectInterpolantSequences, 67/71 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-20 15:04:20,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)