./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 09:57:41,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 09:57:41,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 09:57:41,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 09:57:41,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 09:57:41,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 09:57:41,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 09:57:41,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 09:57:41,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 09:57:41,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 09:57:41,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 09:57:41,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 09:57:41,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 09:57:41,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 09:57:41,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 09:57:41,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 09:57:41,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 09:57:41,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 09:57:41,676 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 09:57:41,676 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 09:57:41,677 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 09:57:41,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 09:57:41,677 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 09:57:41,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 09:57:41,678 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 09:57:41,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 09:57:41,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 09:57:41,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 09:57:41,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 09:57:41,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 09:57:41,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:57:41,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 09:57:41,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 09:57:41,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 09:57:41,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 09:57:41,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 09:57:41,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 09:57:41,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 09:57:41,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 09:57:41,683 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2024-11-09 09:57:41,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 09:57:41,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 09:57:41,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 09:57:41,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 09:57:41,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 09:57:41,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-09 09:57:43,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 09:57:43,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 09:57:43,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-09 09:57:43,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d64f1c/1a2b48213a054c7a8e0ad1f8bc483ded/FLAG63026e37e [2024-11-09 09:57:43,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085d64f1c/1a2b48213a054c7a8e0ad1f8bc483ded [2024-11-09 09:57:43,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 09:57:43,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 09:57:43,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 09:57:43,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 09:57:43,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 09:57:43,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:43" (1/1) ... [2024-11-09 09:57:43,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa25bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:43, skipping insertion in model container [2024-11-09 09:57:43,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:43" (1/1) ... [2024-11-09 09:57:43,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 09:57:44,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,540 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,547 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,553 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,561 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,572 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,572 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:57:44,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:57:44,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 09:57:44,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:57:44,821 INFO L204 MainTranslator]: Completed translation [2024-11-09 09:57:44,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44 WrapperNode [2024-11-09 09:57:44,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 09:57:44,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 09:57:44,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 09:57:44,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 09:57:44,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:44,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:44,916 INFO L138 Inliner]: procedures = 346, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 743 [2024-11-09 09:57:44,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 09:57:44,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 09:57:44,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 09:57:44,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 09:57:44,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:44,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:44,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,000 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 12, 3, 3, 12, 3, 4, 4, 4, 3, 355, 2, 2, 1]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 0, 3, 3, 0, 3, 3, 3, 3, 3, 355, 0, 0, 0]. The 10 writes are split as follows [0, 5, 0, 0, 2, 0, 0, 0, 0, 0, 0, 2, 1, 0]. [2024-11-09 09:57:45,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 09:57:45,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 09:57:45,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 09:57:45,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 09:57:45,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (1/1) ... [2024-11-09 09:57:45,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:57:45,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:45,116 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-09 09:57:45,121 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-09 09:57:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 09:57:45,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 09:57:45,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 09:57:45,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 09:57:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 09:57:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 09:57:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 09:57:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 09:57:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 09:57:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 09:57:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-09 09:57:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 09:57:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 09:57:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 09:57:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 09:57:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 09:57:45,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 09:57:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 09:57:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 09:57:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 09:57:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 09:57:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-09 09:57:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-09 09:57:45,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 09:57:45,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 09:57:45,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 09:57:45,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 09:57:46,433 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2024-11-09 09:57:46,434 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 09:57:46,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 09:57:46,461 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 09:57:46,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:57:46 BoogieIcfgContainer [2024-11-09 09:57:46,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 09:57:46,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 09:57:46,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 09:57:46,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 09:57:46,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:57:43" (1/3) ... [2024-11-09 09:57:46,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515f0dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:46, skipping insertion in model container [2024-11-09 09:57:46,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:44" (2/3) ... [2024-11-09 09:57:46,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515f0dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:46, skipping insertion in model container [2024-11-09 09:57:46,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:57:46" (3/3) ... [2024-11-09 09:57:46,473 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2024-11-09 09:57:46,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 09:57:46,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2024-11-09 09:57:46,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 09:57:46,560 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;@5619a535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 09:57:46,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-09 09:57:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:57:46,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:46,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:57:46,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2024-11-09 09:57:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:46,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475202285] [2024-11-09 09:57:46,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:46,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:47,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475202285] [2024-11-09 09:57:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475202285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:47,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351371199] [2024-11-09 09:57:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:47,245 INFO L87 Difference]: Start difference. First operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:47,485 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2024-11-09 09:57:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 09:57:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:47,501 INFO L225 Difference]: With dead ends: 258 [2024-11-09 09:57:47,502 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 09:57:47,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:47,509 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:47,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 209 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 09:57:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2024-11-09 09:57:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 146 states have (on average 1.821917808219178) internal successors, (266), 235 states have internal predecessors, (266), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-11-09 09:57:47,568 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 3 [2024-11-09 09:57:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-11-09 09:57:47,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-11-09 09:57:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:57:47,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:47,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:57:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 09:57:47,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:47,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2024-11-09 09:57:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975326503] [2024-11-09 09:57:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975326503] [2024-11-09 09:57:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975326503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:47,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507290834] [2024-11-09 09:57:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:47,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:47,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:47,894 INFO L87 Difference]: Start difference. First operand 239 states and 270 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:48,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:48,046 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2024-11-09 09:57:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:48,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 09:57:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:48,049 INFO L225 Difference]: With dead ends: 238 [2024-11-09 09:57:48,050 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 09:57:48,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:48,052 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:48,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 438 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 09:57:48,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-09 09:57:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 146 states have (on average 1.8150684931506849) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2024-11-09 09:57:48,066 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 3 [2024-11-09 09:57:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:48,066 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2024-11-09 09:57:48,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2024-11-09 09:57:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 09:57:48,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:48,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 09:57:48,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 09:57:48,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:48,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2024-11-09 09:57:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:48,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656796773] [2024-11-09 09:57:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656796773] [2024-11-09 09:57:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656796773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:48,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:57:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094191802] [2024-11-09 09:57:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:57:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:57:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:48,407 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:48,626 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-09 09:57:48,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:57:48,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 09:57:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:48,629 INFO L225 Difference]: With dead ends: 241 [2024-11-09 09:57:48,629 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 09:57:48,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:48,631 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:48,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 610 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 09:57:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2024-11-09 09:57:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 148 states have (on average 1.804054054054054) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2024-11-09 09:57:48,653 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2024-11-09 09:57:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:48,653 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2024-11-09 09:57:48,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2024-11-09 09:57:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 09:57:48,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:48,654 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:48,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 09:57:48,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:48,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 71430167, now seen corresponding path program 1 times [2024-11-09 09:57:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:48,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165030468] [2024-11-09 09:57:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165030468] [2024-11-09 09:57:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165030468] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615963590] [2024-11-09 09:57:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:49,040 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-09 09:57:49,041 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-09 09:57:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:49,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 09:57:49,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:49,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:49,519 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 7 treesize of output 5 [2024-11-09 09:57:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:49,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615963590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:49,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-09 09:57:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401638682] [2024-11-09 09:57:49,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:49,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 09:57:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 09:57:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:57:49,541 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:49,883 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2024-11-09 09:57:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:57:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 09:57:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:49,885 INFO L225 Difference]: With dead ends: 244 [2024-11-09 09:57:49,885 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 09:57:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-09 09:57:49,887 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 511 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:49,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 784 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 09:57:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-09 09:57:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.7712418300653594) internal successors, (271), 240 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2024-11-09 09:57:49,907 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 9 [2024-11-09 09:57:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:49,907 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2024-11-09 09:57:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:57:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-11-09 09:57:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 09:57:49,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:49,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:49,931 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-09 09:57:50,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:50,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1803865808, now seen corresponding path program 1 times [2024-11-09 09:57:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:50,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78637696] [2024-11-09 09:57:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 09:57:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78637696] [2024-11-09 09:57:50,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78637696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:50,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544103114] [2024-11-09 09:57:50,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:50,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:50,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:50,385 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-09 09:57:50,387 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-09 09:57:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:50,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:57:50,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:50,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544103114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:50,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 09:57:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073903497] [2024-11-09 09:57:50,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:50,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 09:57:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:50,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 09:57:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:57:50,777 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:57:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:50,831 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2024-11-09 09:57:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:57:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 09:57:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:50,833 INFO L225 Difference]: With dead ends: 259 [2024-11-09 09:57:50,834 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 09:57:50,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:57:50,835 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 4 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:50,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1048 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:57:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 09:57:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-09 09:57:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-09 09:57:50,849 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 22 [2024-11-09 09:57:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-09 09:57:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:57:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-09 09:57:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 09:57:50,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:50,850 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:50,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 09:57:51,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:51,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:51,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446110, now seen corresponding path program 2 times [2024-11-09 09:57:51,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:51,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631925657] [2024-11-09 09:57:51,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:51,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 09:57:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631925657] [2024-11-09 09:57:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631925657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:51,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219125927] [2024-11-09 09:57:51,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 09:57:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:51,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:51,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 09:57:51,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 09:57:51,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:57:51,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 09:57:51,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:51,793 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 09:57:51,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 11 [2024-11-09 09:57:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 09:57:51,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 09:57:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219125927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:51,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 09:57:51,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 12 [2024-11-09 09:57:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064587653] [2024-11-09 09:57:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:57:51,831 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:52,025 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2024-11-09 09:57:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 37 [2024-11-09 09:57:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:52,027 INFO L225 Difference]: With dead ends: 271 [2024-11-09 09:57:52,027 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 09:57:52,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:57:52,028 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 223 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:52,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 211 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 09:57:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2024-11-09 09:57:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 168 states have (on average 1.6726190476190477) internal successors, (281), 250 states have internal predecessors, (281), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-09 09:57:52,038 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 37 [2024-11-09 09:57:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:52,045 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-09 09:57:52,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-09 09:57:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 09:57:52,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:52,046 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:52,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 09:57:52,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:52,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:52,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446111, now seen corresponding path program 1 times [2024-11-09 09:57:52,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:52,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160624014] [2024-11-09 09:57:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:52,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 09:57:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160624014] [2024-11-09 09:57:52,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160624014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:57:52,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910149362] [2024-11-09 09:57:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:52,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:52,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:57:52,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:57:52,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 09:57:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:53,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 09:57:53,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:57:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:53,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:57:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:57:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910149362] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:57:53,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:57:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-09 09:57:53,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941949988] [2024-11-09 09:57:53,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:57:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 09:57:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:53,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 09:57:53,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:57:53,186 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:57:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:53,252 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-09 09:57:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:57:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 09:57:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:53,254 INFO L225 Difference]: With dead ends: 260 [2024-11-09 09:57:53,254 INFO L226 Difference]: Without dead ends: 260 [2024-11-09 09:57:53,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:57:53,256 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 2 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:53,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1284 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-09 09:57:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-09 09:57:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2024-11-09 09:57:53,272 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 37 [2024-11-09 09:57:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:53,272 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2024-11-09 09:57:53,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:57:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2024-11-09 09:57:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 09:57:53,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:53,273 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:53,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 09:57:53,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:57:53,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:53,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1137674529, now seen corresponding path program 2 times [2024-11-09 09:57:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:53,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702425971] [2024-11-09 09:57:53,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:53,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702425971] [2024-11-09 09:57:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702425971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:57:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726638397] [2024-11-09 09:57:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:54,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:54,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:54,262 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:54,554 INFO L93 Difference]: Finished difference Result 425 states and 486 transitions. [2024-11-09 09:57:54,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:57:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2024-11-09 09:57:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:54,558 INFO L225 Difference]: With dead ends: 425 [2024-11-09 09:57:54,558 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 09:57:54,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:54,559 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 593 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:54,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 805 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 09:57:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 259. [2024-11-09 09:57:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-09 09:57:54,566 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 43 [2024-11-09 09:57:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:54,567 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-09 09:57:54,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-09 09:57:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 09:57:54,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:54,568 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:54,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 09:57:54,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:54,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -874983285, now seen corresponding path program 1 times [2024-11-09 09:57:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:54,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794774790] [2024-11-09 09:57:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:55,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794774790] [2024-11-09 09:57:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794774790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:57:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777722268] [2024-11-09 09:57:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:55,020 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:55,373 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2024-11-09 09:57:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:55,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2024-11-09 09:57:55,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:55,375 INFO L225 Difference]: With dead ends: 296 [2024-11-09 09:57:55,375 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 09:57:55,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:55,376 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 491 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:55,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 427 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 09:57:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2024-11-09 09:57:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 188 states have (on average 1.6329787234042554) internal successors, (307), 268 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 311 transitions. [2024-11-09 09:57:55,383 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 311 transitions. Word has length 46 [2024-11-09 09:57:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 311 transitions. [2024-11-09 09:57:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 311 transitions. [2024-11-09 09:57:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 09:57:55,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:55,385 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:55,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 09:57:55,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:55,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1354678587, now seen corresponding path program 1 times [2024-11-09 09:57:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699862717] [2024-11-09 09:57:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699862717] [2024-11-09 09:57:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699862717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:57:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444610994] [2024-11-09 09:57:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:55,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:57:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:57:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:57:55,651 INFO L87 Difference]: Start difference. First operand 272 states and 311 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:55,846 INFO L93 Difference]: Finished difference Result 306 states and 352 transitions. [2024-11-09 09:57:55,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:57:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 47 [2024-11-09 09:57:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:55,848 INFO L225 Difference]: With dead ends: 306 [2024-11-09 09:57:55,848 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 09:57:55,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:55,849 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 379 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:55,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 287 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 09:57:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 265. [2024-11-09 09:57:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5957446808510638) internal successors, (300), 261 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2024-11-09 09:57:55,856 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 47 [2024-11-09 09:57:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:55,857 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2024-11-09 09:57:55,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2024-11-09 09:57:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 09:57:55,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:55,858 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 09:57:55,858 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:55,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1354678586, now seen corresponding path program 1 times [2024-11-09 09:57:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754208196] [2024-11-09 09:57:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:56,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:56,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754208196] [2024-11-09 09:57:56,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754208196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:56,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:56,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:57:56,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666884391] [2024-11-09 09:57:56,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:56,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:57:56,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:56,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:57:56,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:56,204 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:56,283 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2024-11-09 09:57:56,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:57:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2024-11-09 09:57:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:56,285 INFO L225 Difference]: With dead ends: 272 [2024-11-09 09:57:56,285 INFO L226 Difference]: Without dead ends: 272 [2024-11-09 09:57:56,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:56,286 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 238 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:56,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 964 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-09 09:57:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-11-09 09:57:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5904255319148937) internal successors, (299), 261 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions. [2024-11-09 09:57:56,292 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 47 [2024-11-09 09:57:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:56,292 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 303 transitions. [2024-11-09 09:57:56,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions. [2024-11-09 09:57:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 09:57:56,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:56,293 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:56,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 09:57:56,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash -470534900, now seen corresponding path program 1 times [2024-11-09 09:57:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955041009] [2024-11-09 09:57:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955041009] [2024-11-09 09:57:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955041009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:56,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:57:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681418951] [2024-11-09 09:57:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:56,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:57:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:57:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:56,607 INFO L87 Difference]: Start difference. First operand 265 states and 303 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:56,723 INFO L93 Difference]: Finished difference Result 271 states and 311 transitions. [2024-11-09 09:57:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:57:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2024-11-09 09:57:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:56,725 INFO L225 Difference]: With dead ends: 271 [2024-11-09 09:57:56,725 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 09:57:56,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:57:56,726 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 209 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:56,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 207 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:57:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 09:57:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2024-11-09 09:57:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.5824742268041236) internal successors, (307), 266 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2024-11-09 09:57:56,734 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 49 [2024-11-09 09:57:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2024-11-09 09:57:56,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2024-11-09 09:57:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 09:57:56,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:56,739 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:56,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 09:57:56,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:56,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -470534899, now seen corresponding path program 1 times [2024-11-09 09:57:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:56,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542930804] [2024-11-09 09:57:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542930804] [2024-11-09 09:57:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542930804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:57,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:57:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100021654] [2024-11-09 09:57:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:57,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:57:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:57:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:57:57,477 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:57,744 INFO L93 Difference]: Finished difference Result 282 states and 317 transitions. [2024-11-09 09:57:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 49 [2024-11-09 09:57:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:57,746 INFO L225 Difference]: With dead ends: 282 [2024-11-09 09:57:57,746 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 09:57:57,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:57:57,747 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 483 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:57,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 294 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:57:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 09:57:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 270. [2024-11-09 09:57:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.5721649484536082) internal successors, (305), 266 states have internal predecessors, (305), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 309 transitions. [2024-11-09 09:57:57,753 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 309 transitions. Word has length 49 [2024-11-09 09:57:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:57,753 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 309 transitions. [2024-11-09 09:57:57,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 309 transitions. [2024-11-09 09:57:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 09:57:57,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:57,754 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:57,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 09:57:57,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:57,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1068074097, now seen corresponding path program 1 times [2024-11-09 09:57:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:57,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450595048] [2024-11-09 09:57:57,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450595048] [2024-11-09 09:57:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450595048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:58,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:57:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975897350] [2024-11-09 09:57:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:57:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:58,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:57:58,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:58,171 INFO L87 Difference]: Start difference. First operand 270 states and 309 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:58,398 INFO L93 Difference]: Finished difference Result 269 states and 307 transitions. [2024-11-09 09:57:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:58,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2024-11-09 09:57:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:58,399 INFO L225 Difference]: With dead ends: 269 [2024-11-09 09:57:58,400 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 09:57:58,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:58,400 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 14 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:58,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 729 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 09:57:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 09:57:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 194 states have (on average 1.5618556701030928) internal successors, (303), 265 states have internal predecessors, (303), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 307 transitions. [2024-11-09 09:57:58,407 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 307 transitions. Word has length 52 [2024-11-09 09:57:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 307 transitions. [2024-11-09 09:57:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 307 transitions. [2024-11-09 09:57:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 09:57:58,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:58,408 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:58,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 09:57:58,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:58,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1068074098, now seen corresponding path program 1 times [2024-11-09 09:57:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338382653] [2024-11-09 09:57:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:59,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:59,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338382653] [2024-11-09 09:57:59,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338382653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:59,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:57:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289287349] [2024-11-09 09:57:59,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:59,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:57:59,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:57:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:59,053 INFO L87 Difference]: Start difference. First operand 269 states and 307 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:59,323 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2024-11-09 09:57:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2024-11-09 09:57:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:59,325 INFO L225 Difference]: With dead ends: 268 [2024-11-09 09:57:59,325 INFO L226 Difference]: Without dead ends: 268 [2024-11-09 09:57:59,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:59,326 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 13 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:59,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 731 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:59,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-09 09:57:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-09 09:57:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 194 states have (on average 1.5515463917525774) internal successors, (301), 264 states have internal predecessors, (301), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 305 transitions. [2024-11-09 09:57:59,335 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 305 transitions. Word has length 52 [2024-11-09 09:57:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:59,335 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 305 transitions. [2024-11-09 09:57:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 305 transitions. [2024-11-09 09:57:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 09:57:59,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:59,336 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:59,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 09:57:59,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 610330706, now seen corresponding path program 1 times [2024-11-09 09:57:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724735943] [2024-11-09 09:57:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:57:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:57:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:57:59,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:57:59,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724735943] [2024-11-09 09:57:59,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724735943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:57:59,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:57:59,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:57:59,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578322841] [2024-11-09 09:57:59,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:57:59,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:57:59,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:57:59,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:57:59,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:57:59,552 INFO L87 Difference]: Start difference. First operand 268 states and 305 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:57:59,748 INFO L93 Difference]: Finished difference Result 267 states and 303 transitions. [2024-11-09 09:57:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:57:59,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 57 [2024-11-09 09:57:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:57:59,749 INFO L225 Difference]: With dead ends: 267 [2024-11-09 09:57:59,749 INFO L226 Difference]: Without dead ends: 267 [2024-11-09 09:57:59,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:57:59,750 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:57:59,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 787 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:57:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-09 09:57:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-09 09:57:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.541237113402062) internal successors, (299), 263 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:57:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 303 transitions. [2024-11-09 09:57:59,757 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 303 transitions. Word has length 57 [2024-11-09 09:57:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:57:59,757 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 303 transitions. [2024-11-09 09:57:59,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:57:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 303 transitions. [2024-11-09 09:57:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 09:57:59,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:57:59,758 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:57:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 09:57:59,758 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:57:59,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:57:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 610330707, now seen corresponding path program 1 times [2024-11-09 09:57:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:57:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146347770] [2024-11-09 09:57:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:57:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:57:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:00,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146347770] [2024-11-09 09:58:00,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146347770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:58:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490956333] [2024-11-09 09:58:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:58:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:58:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:58:00,552 INFO L87 Difference]: Start difference. First operand 267 states and 303 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:00,919 INFO L93 Difference]: Finished difference Result 277 states and 314 transitions. [2024-11-09 09:58:00,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 57 [2024-11-09 09:58:00,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:00,921 INFO L225 Difference]: With dead ends: 277 [2024-11-09 09:58:00,921 INFO L226 Difference]: Without dead ends: 277 [2024-11-09 09:58:00,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 09:58:00,922 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 13 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:00,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1036 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 09:58:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-09 09:58:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-11-09 09:58:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.5247524752475248) internal successors, (308), 271 states have internal predecessors, (308), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:00,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 312 transitions. [2024-11-09 09:58:00,928 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 312 transitions. Word has length 57 [2024-11-09 09:58:00,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:00,928 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 312 transitions. [2024-11-09 09:58:00,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 312 transitions. [2024-11-09 09:58:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 09:58:00,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:00,929 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2024-11-09 09:58:00,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 09:58:00,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:00,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:00,930 INFO L85 PathProgramCache]: Analyzing trace with hash 179394723, now seen corresponding path program 1 times [2024-11-09 09:58:00,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:00,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868964385] [2024-11-09 09:58:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:00,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:01,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868964385] [2024-11-09 09:58:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868964385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654485000] [2024-11-09 09:58:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:01,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:01,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:01,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:01,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 09:58:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:02,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 09:58:02,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:02,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-09 09:58:02,273 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 23 treesize of output 1 [2024-11-09 09:58:02,276 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 23 treesize of output 1 [2024-11-09 09:58:02,477 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 36 treesize of output 12 [2024-11-09 09:58:02,481 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 25 treesize of output 9 [2024-11-09 09:58:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:02,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654485000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:02,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-09 09:58:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390997770] [2024-11-09 09:58:02,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:02,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 09:58:02,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 09:58:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-11-09 09:58:02,806 INFO L87 Difference]: Start difference. First operand 275 states and 312 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:03,634 INFO L93 Difference]: Finished difference Result 288 states and 325 transitions. [2024-11-09 09:58:03,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:03,634 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 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 62 [2024-11-09 09:58:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:03,635 INFO L225 Difference]: With dead ends: 288 [2024-11-09 09:58:03,635 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 09:58:03,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2024-11-09 09:58:03,636 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 40 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:03,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1829 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 09:58:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 09:58:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-09 09:58:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 284 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 325 transitions. [2024-11-09 09:58:03,645 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 325 transitions. Word has length 62 [2024-11-09 09:58:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:03,645 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 325 transitions. [2024-11-09 09:58:03,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 325 transitions. [2024-11-09 09:58:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 09:58:03,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:03,647 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 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] [2024-11-09 09:58:03,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 09:58:03,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:03,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1625335637, now seen corresponding path program 1 times [2024-11-09 09:58:03,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443944100] [2024-11-09 09:58:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443944100] [2024-11-09 09:58:04,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443944100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681034811] [2024-11-09 09:58:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:04,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:04,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:04,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:04,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 09:58:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:04,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:58:04,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:04,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:04,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681034811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:04,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:04,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 09:58:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544628784] [2024-11-09 09:58:04,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:04,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 09:58:04,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:04,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 09:58:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:04,552 INFO L87 Difference]: Start difference. First operand 288 states and 325 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:04,600 INFO L93 Difference]: Finished difference Result 345 states and 380 transitions. [2024-11-09 09:58:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:58:04,601 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 73 [2024-11-09 09:58:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:04,602 INFO L225 Difference]: With dead ends: 345 [2024-11-09 09:58:04,603 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 09:58:04,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-09 09:58:04,603 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 20 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:04,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1226 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 09:58:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 338. [2024-11-09 09:58:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.413533834586466) internal successors, (376), 334 states have internal predecessors, (376), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 380 transitions. [2024-11-09 09:58:04,613 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 380 transitions. Word has length 73 [2024-11-09 09:58:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 380 transitions. [2024-11-09 09:58:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 380 transitions. [2024-11-09 09:58:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 09:58:04,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:04,615 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 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] [2024-11-09 09:58:04,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:04,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:04,815 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:04,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1346452229, now seen corresponding path program 2 times [2024-11-09 09:58:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823991757] [2024-11-09 09:58:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823991757] [2024-11-09 09:58:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823991757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302113554] [2024-11-09 09:58:05,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 09:58:05,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:05,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:05,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:05,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 09:58:05,680 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 09:58:05,680 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:58:05,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 09:58:05,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:05,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-09 09:58:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302113554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:05,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:05,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-09 09:58:05,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838126177] [2024-11-09 09:58:05,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:05,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 09:58:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:05,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 09:58:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:05,920 INFO L87 Difference]: Start difference. First operand 338 states and 380 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:05,979 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2024-11-09 09:58:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:05,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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 98 [2024-11-09 09:58:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:05,982 INFO L225 Difference]: With dead ends: 367 [2024-11-09 09:58:05,982 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 09:58:05,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 188 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:05,983 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 26 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:05,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 993 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 09:58:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 358. [2024-11-09 09:58:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 354 states have internal predecessors, (398), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 402 transitions. [2024-11-09 09:58:05,994 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 402 transitions. Word has length 98 [2024-11-09 09:58:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:05,995 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 402 transitions. [2024-11-09 09:58:05,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 402 transitions. [2024-11-09 09:58:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 09:58:05,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:05,996 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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] [2024-11-09 09:58:06,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:06,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:06,197 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:06,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 998593275, now seen corresponding path program 3 times [2024-11-09 09:58:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143446974] [2024-11-09 09:58:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:07,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143446974] [2024-11-09 09:58:07,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143446974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:07,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614879605] [2024-11-09 09:58:07,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 09:58:07,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:07,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:07,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:07,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 09:58:07,454 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 09:58:07,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 09:58:07,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 09:58:07,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:07,539 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:07,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:07,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 14 [2024-11-09 09:58:07,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:07,657 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 8 treesize of output 4 [2024-11-09 09:58:08,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:08,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 11 [2024-11-09 09:58:08,172 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:08,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:08,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:09,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 09:58:09,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-09 09:58:09,726 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 49 treesize of output 45 [2024-11-09 09:58:09,758 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 09:58:09,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-09 09:58:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614879605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:09,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2024-11-09 09:58:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735528827] [2024-11-09 09:58:09,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:09,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 09:58:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 09:58:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:58:09,803 INFO L87 Difference]: Start difference. First operand 358 states and 402 transitions. Second operand has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:10,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:10,438 INFO L93 Difference]: Finished difference Result 425 states and 462 transitions. [2024-11-09 09:58:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 09:58:10,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 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 108 [2024-11-09 09:58:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:10,442 INFO L225 Difference]: With dead ends: 425 [2024-11-09 09:58:10,442 INFO L226 Difference]: Without dead ends: 425 [2024-11-09 09:58:10,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-11-09 09:58:10,443 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1192 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:10,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 739 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-09 09:58:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 299. [2024-11-09 09:58:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 231 states have (on average 1.4242424242424243) internal successors, (329), 295 states have internal predecessors, (329), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 333 transitions. [2024-11-09 09:58:10,450 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 333 transitions. Word has length 108 [2024-11-09 09:58:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:10,450 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 333 transitions. [2024-11-09 09:58:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.9) internal successors, (78), 21 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 333 transitions. [2024-11-09 09:58:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 09:58:10,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:10,452 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:10,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 09:58:10,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 09:58:10,652 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:10,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:10,653 INFO L85 PathProgramCache]: Analyzing trace with hash 891619926, now seen corresponding path program 1 times [2024-11-09 09:58:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953381183] [2024-11-09 09:58:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:10,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:11,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953381183] [2024-11-09 09:58:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953381183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799643466] [2024-11-09 09:58:11,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:11,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:11,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:11,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:11,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 09:58:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:11,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 09:58:11,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:11,920 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 09:58:11,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 09:58:11,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:11,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:11,954 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 23 treesize of output 1 [2024-11-09 09:58:12,044 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 12 treesize of output 4 [2024-11-09 09:58:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-09 09:58:12,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:12,597 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 49 treesize of output 45 [2024-11-09 09:58:12,620 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-09 09:58:12,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-09 09:58:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:12,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799643466] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:12,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:12,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2024-11-09 09:58:12,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717986269] [2024-11-09 09:58:12,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:12,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 09:58:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 09:58:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:58:12,666 INFO L87 Difference]: Start difference. First operand 299 states and 333 transitions. Second operand has 21 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:13,300 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2024-11-09 09:58:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:58:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 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 109 [2024-11-09 09:58:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:13,302 INFO L225 Difference]: With dead ends: 365 [2024-11-09 09:58:13,302 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 09:58:13,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2024-11-09 09:58:13,303 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1932 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:13,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 745 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 09:58:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 09:58:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 296. [2024-11-09 09:58:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.4112554112554112) internal successors, (326), 292 states have internal predecessors, (326), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 330 transitions. [2024-11-09 09:58:13,311 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 330 transitions. Word has length 109 [2024-11-09 09:58:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 330 transitions. [2024-11-09 09:58:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 330 transitions. [2024-11-09 09:58:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 09:58:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:13,313 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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] [2024-11-09 09:58:13,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:13,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:13,514 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2146214755, now seen corresponding path program 1 times [2024-11-09 09:58:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272053599] [2024-11-09 09:58:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:13,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:14,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272053599] [2024-11-09 09:58:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272053599] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:14,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860738323] [2024-11-09 09:58:14,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:14,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:14,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:14,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:14,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 09:58:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:15,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 09:58:15,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:15,309 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 09:58:15,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 21 treesize of output 23 [2024-11-09 09:58:15,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2024-11-09 09:58:15,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 09:58:15,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:15,502 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 09:58:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2024-11-09 09:58:15,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 09:58:15,906 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 28 treesize of output 20 [2024-11-09 09:58:16,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:16,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 25 [2024-11-09 09:58:16,647 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:58:16,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 09:58:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-09 09:58:16,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:17,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 09:58:17,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-09 09:58:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860738323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:18,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 23 [2024-11-09 09:58:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642394571] [2024-11-09 09:58:18,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 09:58:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 09:58:18,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2024-11-09 09:58:18,236 INFO L87 Difference]: Start difference. First operand 296 states and 330 transitions. Second operand has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:19,807 INFO L93 Difference]: Finished difference Result 491 states and 542 transitions. [2024-11-09 09:58:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:58:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 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 111 [2024-11-09 09:58:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:19,810 INFO L225 Difference]: With dead ends: 491 [2024-11-09 09:58:19,810 INFO L226 Difference]: Without dead ends: 491 [2024-11-09 09:58:19,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 09:58:19,811 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1134 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:19,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1766 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 09:58:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-09 09:58:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 291. [2024-11-09 09:58:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.4140969162995596) internal successors, (321), 287 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 325 transitions. [2024-11-09 09:58:19,823 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 325 transitions. Word has length 111 [2024-11-09 09:58:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:19,823 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 325 transitions. [2024-11-09 09:58:19,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.869565217391304) internal successors, (89), 24 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 325 transitions. [2024-11-09 09:58:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 09:58:19,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:19,825 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:19,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 09:58:20,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 09:58:20,026 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:20,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:20,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1399714849, now seen corresponding path program 1 times [2024-11-09 09:58:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638865843] [2024-11-09 09:58:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638865843] [2024-11-09 09:58:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638865843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:20,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 09:58:20,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928386761] [2024-11-09 09:58:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 09:58:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 09:58:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 09:58:20,482 INFO L87 Difference]: Start difference. First operand 291 states and 325 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:20,679 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2024-11-09 09:58:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:58:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 113 [2024-11-09 09:58:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:20,681 INFO L225 Difference]: With dead ends: 338 [2024-11-09 09:58:20,681 INFO L226 Difference]: Without dead ends: 338 [2024-11-09 09:58:20,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:20,682 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 362 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:20,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 673 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-09 09:58:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 296. [2024-11-09 09:58:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 292 states have internal predecessors, (327), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 331 transitions. [2024-11-09 09:58:20,688 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 331 transitions. Word has length 113 [2024-11-09 09:58:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:20,688 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 331 transitions. [2024-11-09 09:58:20,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 331 transitions. [2024-11-09 09:58:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 09:58:20,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:20,691 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:20,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 09:58:20,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:20,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 148263721, now seen corresponding path program 1 times [2024-11-09 09:58:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371454767] [2024-11-09 09:58:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371454767] [2024-11-09 09:58:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371454767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000436761] [2024-11-09 09:58:22,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:22,548 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:22,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 09:58:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:23,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 09:58:23,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:23,034 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 11 [2024-11-09 09:58:23,038 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 11 [2024-11-09 09:58:23,101 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-09 09:58:23,102 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 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 09:58:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:58:23,110 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 27 treesize of output 15 [2024-11-09 09:58:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:23,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000436761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:24,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2024-11-09 09:58:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653662726] [2024-11-09 09:58:24,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 09:58:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 09:58:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-09 09:58:24,042 INFO L87 Difference]: Start difference. First operand 296 states and 331 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:24,414 INFO L93 Difference]: Finished difference Result 482 states and 543 transitions. [2024-11-09 09:58:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:58:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 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 115 [2024-11-09 09:58:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:24,417 INFO L225 Difference]: With dead ends: 482 [2024-11-09 09:58:24,417 INFO L226 Difference]: Without dead ends: 482 [2024-11-09 09:58:24,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2024-11-09 09:58:24,418 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 881 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:24,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 2737 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 09:58:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-09 09:58:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 361. [2024-11-09 09:58:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 297 states have (on average 1.3265993265993266) internal successors, (394), 357 states have internal predecessors, (394), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 398 transitions. [2024-11-09 09:58:24,425 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 398 transitions. Word has length 115 [2024-11-09 09:58:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 398 transitions. [2024-11-09 09:58:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 398 transitions. [2024-11-09 09:58:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 09:58:24,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:24,427 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:24,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 09:58:24,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 09:58:24,628 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 932572260, now seen corresponding path program 1 times [2024-11-09 09:58:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800752276] [2024-11-09 09:58:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800752276] [2024-11-09 09:58:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800752276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 09:58:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435402801] [2024-11-09 09:58:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:25,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:58:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:58:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:58:25,260 INFO L87 Difference]: Start difference. First operand 361 states and 398 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:25,373 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2024-11-09 09:58:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 116 [2024-11-09 09:58:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:25,375 INFO L225 Difference]: With dead ends: 398 [2024-11-09 09:58:25,375 INFO L226 Difference]: Without dead ends: 398 [2024-11-09 09:58:25,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:25,376 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 42 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:25,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1336 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-09 09:58:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 367. [2024-11-09 09:58:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 303 states have (on average 1.3234323432343233) internal successors, (401), 363 states have internal predecessors, (401), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2024-11-09 09:58:25,382 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 116 [2024-11-09 09:58:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:25,382 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2024-11-09 09:58:25,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2024-11-09 09:58:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 09:58:25,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:25,384 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:25,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 09:58:25,384 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:25,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1861062658, now seen corresponding path program 1 times [2024-11-09 09:58:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758328656] [2024-11-09 09:58:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758328656] [2024-11-09 09:58:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758328656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778440342] [2024-11-09 09:58:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:25,648 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:25,663 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2024-11-09 09:58:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 119 [2024-11-09 09:58:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:25,665 INFO L225 Difference]: With dead ends: 369 [2024-11-09 09:58:25,665 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 09:58:25,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:25,665 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:25,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 09:58:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-09 09:58:25,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 305 states have (on average 1.321311475409836) internal successors, (403), 365 states have internal predecessors, (403), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 407 transitions. [2024-11-09 09:58:25,671 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 407 transitions. Word has length 119 [2024-11-09 09:58:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:25,671 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 407 transitions. [2024-11-09 09:58:25,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 407 transitions. [2024-11-09 09:58:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 09:58:25,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:25,672 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:25,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 09:58:25,672 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:25,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044067, now seen corresponding path program 1 times [2024-11-09 09:58:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:25,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871667853] [2024-11-09 09:58:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:25,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:25,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871667853] [2024-11-09 09:58:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871667853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:25,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29892170] [2024-11-09 09:58:25,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:25,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:25,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:25,901 INFO L87 Difference]: Start difference. First operand 369 states and 407 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:25,992 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2024-11-09 09:58:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 121 [2024-11-09 09:58:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:25,993 INFO L225 Difference]: With dead ends: 369 [2024-11-09 09:58:25,993 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 09:58:25,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:25,994 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:25,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 09:58:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2024-11-09 09:58:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 305 states have (on average 1.318032786885246) internal successors, (402), 364 states have internal predecessors, (402), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:25,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 406 transitions. [2024-11-09 09:58:26,000 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 406 transitions. Word has length 121 [2024-11-09 09:58:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:26,000 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 406 transitions. [2024-11-09 09:58:26,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 406 transitions. [2024-11-09 09:58:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 09:58:26,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:26,001 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 09:58:26,002 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:26,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044066, now seen corresponding path program 1 times [2024-11-09 09:58:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:26,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598521760] [2024-11-09 09:58:26,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598521760] [2024-11-09 09:58:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598521760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419005766] [2024-11-09 09:58:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:26,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:26,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:26,352 INFO L87 Difference]: Start difference. First operand 368 states and 406 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:26,441 INFO L93 Difference]: Finished difference Result 367 states and 405 transitions. [2024-11-09 09:58:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 121 [2024-11-09 09:58:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:26,443 INFO L225 Difference]: With dead ends: 367 [2024-11-09 09:58:26,443 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 09:58:26,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:26,443 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:26,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 09:58:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-09 09:58:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 305 states have (on average 1.3147540983606558) internal successors, (401), 363 states have internal predecessors, (401), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2024-11-09 09:58:26,449 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 121 [2024-11-09 09:58:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:26,450 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2024-11-09 09:58:26,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2024-11-09 09:58:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 09:58:26,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:26,451 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:26,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 09:58:26,452 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -975684373, now seen corresponding path program 1 times [2024-11-09 09:58:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934668473] [2024-11-09 09:58:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934668473] [2024-11-09 09:58:26,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934668473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:26,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:26,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:58:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105448008] [2024-11-09 09:58:26,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:26,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:26,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:26,694 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:26,714 INFO L93 Difference]: Finished difference Result 371 states and 410 transitions. [2024-11-09 09:58:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 124 [2024-11-09 09:58:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:26,716 INFO L225 Difference]: With dead ends: 371 [2024-11-09 09:58:26,716 INFO L226 Difference]: Without dead ends: 371 [2024-11-09 09:58:26,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:26,716 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 2 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:26,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 695 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:58:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-09 09:58:26,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2024-11-09 09:58:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 307 states have (on average 1.3127035830618892) internal successors, (403), 365 states have internal predecessors, (403), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 407 transitions. [2024-11-09 09:58:26,725 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 407 transitions. Word has length 124 [2024-11-09 09:58:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:26,725 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 407 transitions. [2024-11-09 09:58:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 407 transitions. [2024-11-09 09:58:26,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 09:58:26,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:26,727 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:26,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 09:58:26,727 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:26,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -128031900, now seen corresponding path program 1 times [2024-11-09 09:58:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:26,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953922170] [2024-11-09 09:58:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-09 09:58:27,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:27,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953922170] [2024-11-09 09:58:27,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953922170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:27,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:27,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 09:58:27,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838227985] [2024-11-09 09:58:27,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:27,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 09:58:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:27,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 09:58:27,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 09:58:27,066 INFO L87 Difference]: Start difference. First operand 369 states and 407 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:27,157 INFO L93 Difference]: Finished difference Result 384 states and 426 transitions. [2024-11-09 09:58:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:58:27,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 125 [2024-11-09 09:58:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:27,159 INFO L225 Difference]: With dead ends: 384 [2024-11-09 09:58:27,159 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 09:58:27,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 09:58:27,160 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 20 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:27,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1093 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:27,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 09:58:27,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2024-11-09 09:58:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 316 states have (on average 1.3101265822784811) internal successors, (414), 374 states have internal predecessors, (414), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 418 transitions. [2024-11-09 09:58:27,172 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 418 transitions. Word has length 125 [2024-11-09 09:58:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:27,173 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 418 transitions. [2024-11-09 09:58:27,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 418 transitions. [2024-11-09 09:58:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 09:58:27,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:27,174 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:27,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 09:58:27,175 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:27,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1331278773, now seen corresponding path program 1 times [2024-11-09 09:58:27,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:27,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519937202] [2024-11-09 09:58:27,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:27,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:27,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 09:58:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:27,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:27,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519937202] [2024-11-09 09:58:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519937202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:58:27,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061668160] [2024-11-09 09:58:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:58:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:27,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 09:58:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 09:58:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:28,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 09:58:28,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:28,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 09:58:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061668160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:28,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 09:58:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-09 09:58:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410743199] [2024-11-09 09:58:28,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:28,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 09:58:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 09:58:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:58:28,715 INFO L87 Difference]: Start difference. First operand 378 states and 418 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:28,833 INFO L93 Difference]: Finished difference Result 523 states and 579 transitions. [2024-11-09 09:58:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:58:28,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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 126 [2024-11-09 09:58:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:28,835 INFO L225 Difference]: With dead ends: 523 [2024-11-09 09:58:28,835 INFO L226 Difference]: Without dead ends: 523 [2024-11-09 09:58:28,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:28,836 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 326 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:28,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1668 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-09 09:58:28,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2024-11-09 09:58:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 317 states have (on average 1.3091482649842272) internal successors, (415), 375 states have internal predecessors, (415), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 419 transitions. [2024-11-09 09:58:28,844 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 419 transitions. Word has length 126 [2024-11-09 09:58:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:28,844 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 419 transitions. [2024-11-09 09:58:28,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 09:58:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 419 transitions. [2024-11-09 09:58:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 09:58:28,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:28,845 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:28,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-09 09:58:29,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 09:58:29,046 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1733043960, now seen corresponding path program 1 times [2024-11-09 09:58:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:29,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780796291] [2024-11-09 09:58:29,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 09:58:29,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 09:58:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 09:58:29,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 09:58:29,407 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 09:58:29,407 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2024-11-09 09:58:29,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2024-11-09 09:58:29,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2024-11-09 09:58:29,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2024-11-09 09:58:29,410 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2024-11-09 09:58:29,411 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2024-11-09 09:58:29,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2024-11-09 09:58:29,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2024-11-09 09:58:29,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2024-11-09 09:58:29,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2024-11-09 09:58:29,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2024-11-09 09:58:29,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2024-11-09 09:58:29,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2024-11-09 09:58:29,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2024-11-09 09:58:29,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2024-11-09 09:58:29,415 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (54 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2024-11-09 09:58:29,416 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2024-11-09 09:58:29,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2024-11-09 09:58:29,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2024-11-09 09:58:29,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (12 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (11 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (10 of 94 remaining) [2024-11-09 09:58:29,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE (9 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE (8 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (7 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (6 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (5 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_FREE (4 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONMEMORY_FREE (3 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE (2 of 94 remaining) [2024-11-09 09:58:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_FREE (1 of 94 remaining) [2024-11-09 09:58:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONMEMORY_LEAK (0 of 94 remaining) [2024-11-09 09:58:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 09:58:29,425 INFO L407 BasicCegarLoop]: Path program histogram: [3, 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] [2024-11-09 09:58:29,529 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 09:58:29,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:58:29 BoogieIcfgContainer [2024-11-09 09:58:29,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 09:58:29,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 09:58:29,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 09:58:29,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 09:58:29,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:57:46" (3/4) ... [2024-11-09 09:58:29,542 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 09:58:29,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 09:58:29,544 INFO L158 Benchmark]: Toolchain (without parser) took 45625.37ms. Allocated memory was 148.9MB in the beginning and 943.7MB in the end (delta: 794.8MB). Free memory was 89.9MB in the beginning and 392.0MB in the end (delta: -302.0MB). Peak memory consumption was 495.9MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,544 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 148.9MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 09:58:29,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 902.50ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 89.6MB in the beginning and 130.4MB in the end (delta: -40.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.96ms. Allocated memory is still 192.9MB. Free memory was 130.4MB in the beginning and 124.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,545 INFO L158 Benchmark]: Boogie Preprocessor took 154.79ms. Allocated memory is still 192.9MB. Free memory was 123.1MB in the beginning and 112.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,545 INFO L158 Benchmark]: RCFGBuilder took 1388.36ms. Allocated memory is still 192.9MB. Free memory was 112.6MB in the beginning and 129.4MB in the end (delta: -16.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,545 INFO L158 Benchmark]: TraceAbstraction took 43071.86ms. Allocated memory was 192.9MB in the beginning and 943.7MB in the end (delta: 750.8MB). Free memory was 129.4MB in the beginning and 392.0MB in the end (delta: -262.6MB). Peak memory consumption was 491.3MB. Max. memory is 16.1GB. [2024-11-09 09:58:29,545 INFO L158 Benchmark]: Witness Printer took 6.54ms. Allocated memory is still 943.7MB. Free memory is still 392.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 09:58:29,546 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.21ms. Allocated memory is still 148.9MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 902.50ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 89.6MB in the beginning and 130.4MB in the end (delta: -40.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.96ms. Allocated memory is still 192.9MB. Free memory was 130.4MB in the beginning and 124.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.79ms. Allocated memory is still 192.9MB. Free memory was 123.1MB in the beginning and 112.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1388.36ms. Allocated memory is still 192.9MB. Free memory was 112.6MB in the beginning and 129.4MB in the end (delta: -16.8MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43071.86ms. Allocated memory was 192.9MB in the beginning and 943.7MB in the end (delta: 750.8MB). Free memory was 129.4MB in the beginning and 392.0MB in the end (delta: -262.6MB). Peak memory consumption was 491.3MB. Max. memory is 16.1GB. * Witness Printer took 6.54ms. Allocated memory is still 943.7MB. Free memory is still 392.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=10] [L1577] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1587] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0, mem_track={-13:0}, optind=1] [L1587] COND TRUE i= 2u [L1394] FCALL bb_show_usage() [L1395] argv = argv + 1l VAL [applet_name={-1:0}, argv={-12:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND FALSE !(!(s == ((const char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, c=47, dummy_utmp={10:0}, optind=1] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-12:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: 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: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1573]: 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 2 procedures, 248 locations, 94 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 33, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9432 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9412 mSDsluCounter, 27860 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20878 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8373 IncrementalHoareTripleChecker+Invalid, 8527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 6982 mSDtfsCounter, 8373 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2048 GetRequests, 1746 SyntacticMatches, 19 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=32, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 1046 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 23.7s InterpolantComputationTime, 3291 NumberOfCodeBlocks, 3190 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3979 ConstructedInterpolants, 129 QuantifiedInterpolants, 29405 SizeOfPredicates, 49 NumberOfNonLiveVariables, 14949 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 55 InterpolantComputations, 21 PerfectInterpolantSequences, 11188/12176 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 could not prove your program: unable to determine feasibility of some traces [2024-11-09 09:58:29,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 09:58:31,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 09:58:31,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-11-09 09:58:31,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 09:58:31,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 09:58:31,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 09:58:31,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 09:58:31,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 09:58:31,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 09:58:31,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 09:58:31,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 09:58:31,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 09:58:31,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 09:58:31,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 09:58:31,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 09:58:31,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 09:58:31,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 09:58:31,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 09:58:31,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 09:58:31,965 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 09:58:31,968 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 09:58:31,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 09:58:31,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 09:58:31,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 09:58:31,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 09:58:31,970 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 09:58:31,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 09:58:31,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 09:58:31,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 09:58:31,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 09:58:31,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 09:58:31,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 09:58:31,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:58:31,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 09:58:31,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 09:58:31,973 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 09:58:31,973 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 09:58:31,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 09:58:31,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 09:58:31,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 09:58:31,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 09:58:31,977 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2024-11-09 09:58:32,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 09:58:32,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 09:58:32,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 09:58:32,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 09:58:32,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 09:58:32,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-09 09:58:33,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 09:58:34,210 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 09:58:34,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-09 09:58:34,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b478418ec/c8bd9cb408b24dd788a58a3a9d7791dc/FLAGe3e160f56 [2024-11-09 09:58:34,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b478418ec/c8bd9cb408b24dd788a58a3a9d7791dc [2024-11-09 09:58:34,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 09:58:34,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 09:58:34,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 09:58:34,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 09:58:34,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 09:58:34,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:34" (1/1) ... [2024-11-09 09:58:34,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4070b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:34, skipping insertion in model container [2024-11-09 09:58:34,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:34" (1/1) ... [2024-11-09 09:58:34,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 09:58:34,911 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,928 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,934 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,937 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,949 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,949 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,950 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,952 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,954 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,969 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:34,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:58:35,004 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 09:58:35,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:58:35,246 INFO L204 MainTranslator]: Completed translation [2024-11-09 09:58:35,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35 WrapperNode [2024-11-09 09:58:35,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 09:58:35,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 09:58:35,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 09:58:35,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 09:58:35,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,373 INFO L138 Inliner]: procedures = 353, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 735 [2024-11-09 09:58:35,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 09:58:35,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 09:58:35,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 09:58:35,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 09:58:35,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,449 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 355, 12, 12, 2, 2, 1]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 355, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 5, 1, 2, 0]. [2024-11-09 09:58:35,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 09:58:35,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 09:58:35,550 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 09:58:35,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 09:58:35,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (1/1) ... [2024-11-09 09:58:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:58:35,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:35,583 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-09 09:58:35,602 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-09 09:58:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 09:58:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 09:58:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 09:58:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 09:58:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-09 09:58:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-09 09:58:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-09 09:58:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-09 09:58:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-09 09:58:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-09 09:58:35,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 09:58:35,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 09:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 09:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-09 09:58:35,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-09 09:58:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-09 09:58:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 09:58:35,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 09:58:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-09 09:58:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-09 09:58:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-09 09:58:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-09 09:58:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-09 09:58:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-09 09:58:35,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-09 09:58:35,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-09 09:58:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-09 09:58:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-09 09:58:35,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 09:58:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-09 09:58:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-09 09:58:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-09 09:58:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-09 09:58:35,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-09 09:58:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-09 09:58:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-09 09:58:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-09 09:58:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-09 09:58:35,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-09 09:58:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-09 09:58:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-09 09:58:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-09 09:58:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-09 09:58:35,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 09:58:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 09:58:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 09:58:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 09:58:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-09 09:58:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-09 09:58:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-09 09:58:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-09 09:58:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-09 09:58:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 09:58:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 09:58:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 09:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 09:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-09 09:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-09 09:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-09 09:58:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-09 09:58:35,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-09 09:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 09:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 09:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 09:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 09:58:35,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-09 09:58:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-09 09:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-09 09:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-09 09:58:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 09:58:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 09:58:36,109 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 09:58:36,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 09:58:37,472 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2024-11-09 09:58:37,472 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 09:58:37,493 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 09:58:37,493 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 09:58:37,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:58:37 BoogieIcfgContainer [2024-11-09 09:58:37,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 09:58:37,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 09:58:37,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 09:58:37,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 09:58:37,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:58:34" (1/3) ... [2024-11-09 09:58:37,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6821869b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:37, skipping insertion in model container [2024-11-09 09:58:37,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:35" (2/3) ... [2024-11-09 09:58:37,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6821869b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:37, skipping insertion in model container [2024-11-09 09:58:37,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:58:37" (3/3) ... [2024-11-09 09:58:37,504 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2024-11-09 09:58:37,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 09:58:37,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2024-11-09 09:58:37,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 09:58:37,585 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;@52d6d403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 09:58:37,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-09 09:58:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:58:37,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:37,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:58:37,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:37,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2024-11-09 09:58:37,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657321991] [2024-11-09 09:58:37,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:37,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:37,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:37,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 09:58:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:38,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 09:58:38,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:38,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-09 09:58:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:38,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 09:58:38,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 09:58:38,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657321991] [2024-11-09 09:58:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657321991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113013694] [2024-11-09 09:58:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 09:58:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:38,167 INFO L87 Difference]: Start difference. First operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:38,756 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2024-11-09 09:58:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 09:58:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:38,769 INFO L225 Difference]: With dead ends: 258 [2024-11-09 09:58:38,769 INFO L226 Difference]: Without dead ends: 256 [2024-11-09 09:58:38,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:38,775 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:38,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 209 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-09 09:58:38,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2024-11-09 09:58:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 146 states have (on average 1.821917808219178) internal successors, (266), 235 states have internal predecessors, (266), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-11-09 09:58:38,827 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 3 [2024-11-09 09:58:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:38,827 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-11-09 09:58:38,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-11-09 09:58:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 09:58:38,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:38,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 09:58:38,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 09:58:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:39,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2024-11-09 09:58:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:39,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023142098] [2024-11-09 09:58:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:39,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:39,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:39,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:39,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 09:58:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:39,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 09:58:39,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:39,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 09:58:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:39,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 09:58:39,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 09:58:39,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023142098] [2024-11-09 09:58:39,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023142098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:39,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989222899] [2024-11-09 09:58:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:39,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 09:58:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:39,368 INFO L87 Difference]: Start difference. First operand 239 states and 270 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:39,883 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2024-11-09 09:58:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 09:58:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:39,885 INFO L225 Difference]: With dead ends: 238 [2024-11-09 09:58:39,885 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 09:58:39,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:39,886 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:39,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 438 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:39,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 09:58:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-09 09:58:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 146 states have (on average 1.8150684931506849) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2024-11-09 09:58:39,901 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 3 [2024-11-09 09:58:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:39,901 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2024-11-09 09:58:39,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2024-11-09 09:58:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 09:58:39,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:39,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 09:58:39,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 09:58:40,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:40,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:40,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2024-11-09 09:58:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:40,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304507251] [2024-11-09 09:58:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:40,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:40,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:40,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 09:58:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:40,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:58:40,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:40,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 09:58:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:40,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 09:58:40,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 09:58:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304507251] [2024-11-09 09:58:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304507251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:40,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:40,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:58:40,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482538789] [2024-11-09 09:58:40,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:40,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 09:58:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:40,477 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:41,095 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-09 09:58:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 09:58:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:41,097 INFO L225 Difference]: With dead ends: 241 [2024-11-09 09:58:41,097 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 09:58:41,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:41,098 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:41,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 610 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:58:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 09:58:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2024-11-09 09:58:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 148 states have (on average 1.804054054054054) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2024-11-09 09:58:41,118 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2024-11-09 09:58:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:41,119 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2024-11-09 09:58:41,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2024-11-09 09:58:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 09:58:41,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:41,120 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:41,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 09:58:41,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:41,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:41,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:41,321 INFO L85 PathProgramCache]: Analyzing trace with hash 71430167, now seen corresponding path program 1 times [2024-11-09 09:58:41,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:41,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116950955] [2024-11-09 09:58:41,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:41,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:41,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:41,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:41,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 09:58:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:41,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 09:58:41,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:41,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-09 09:58:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:41,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:42,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 09:58:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116950955] [2024-11-09 09:58:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116950955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:42,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:58:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-09 09:58:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622876122] [2024-11-09 09:58:42,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 09:58:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 09:58:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 09:58:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 09:58:42,007 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:44,166 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2024-11-09 09:58:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 09:58:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 09:58:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:44,169 INFO L225 Difference]: With dead ends: 244 [2024-11-09 09:58:44,169 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 09:58:44,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 09:58:44,171 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:44,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 957 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 09:58:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 09:58:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-09 09:58:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.7712418300653594) internal successors, (271), 240 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2024-11-09 09:58:44,179 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 9 [2024-11-09 09:58:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2024-11-09 09:58:44,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:58:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-11-09 09:58:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 09:58:44,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:44,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:44,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 09:58:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:44,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:44,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:44,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1803865808, now seen corresponding path program 1 times [2024-11-09 09:58:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827826896] [2024-11-09 09:58:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:44,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:44,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:44,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:44,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 09:58:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:44,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 09:58:44,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:58:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:44,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:58:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:58:44,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 09:58:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827826896] [2024-11-09 09:58:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827826896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 09:58:44,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:58:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 09:58:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150220799] [2024-11-09 09:58:44,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:58:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 09:58:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 09:58:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 09:58:44,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 09:58:44,802 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:58:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:44,984 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2024-11-09 09:58:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:58:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 09:58:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:44,986 INFO L225 Difference]: With dead ends: 259 [2024-11-09 09:58:44,986 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 09:58:44,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:58:44,987 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 12 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:44,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1831 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:58:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 09:58:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-09 09:58:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:58:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-09 09:58:45,001 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 22 [2024-11-09 09:58:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:45,001 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-09 09:58:45,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 09:58:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-09 09:58:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 09:58:45,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:45,003 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:45,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 09:58:45,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:45,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-09 09:58:45,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446110, now seen corresponding path program 2 times [2024-11-09 09:58:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 09:58:45,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612803329] [2024-11-09 09:58:45,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 09:58:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 09:58:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 09:58:45,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 09:58:45,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process