./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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/uthash-2.0.2/uthash_SFH_test10-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:14:56,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:14:56,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:14:56,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:14:56,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:14:56,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:14:56,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:14:56,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:14:56,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:14:56,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:14:56,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:14:56,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:14:56,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:14:56,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:14:56,876 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:14:56,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:14:56,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:14:56,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:14:56,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:14:56,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:14:56,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:14:56,878 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:14:56,878 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:14:56,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:14:56,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:14:56,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:14:56,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:14:56,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:14:56,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:14:56,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:14:56,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:14:56,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:14:56,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:14:56,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:14:56,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:14:56,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:14:56,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:14:56,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:14:56,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:14:56,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:14:56,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:14:56,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:14:56,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-11-19 09:14:57,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:14:57,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:14:57,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:14:57,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:14:57,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:14:57,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-11-19 09:14:58,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:14:58,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:14:58,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-11-19 09:14:58,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b507e05c9/8bbacadb8c2744299946c9e38647f338/FLAG6f33cb976 [2024-11-19 09:14:59,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b507e05c9/8bbacadb8c2744299946c9e38647f338 [2024-11-19 09:14:59,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:14:59,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:14:59,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:14:59,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:14:59,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:14:59,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:14:59,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54aba36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59, skipping insertion in model container [2024-11-19 09:14:59,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:14:59,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:14:59,520 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-19 09:14:59,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-19 09:14:59,566 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-19 09:14:59,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-19 09:14:59,580 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-19 09:14:59,617 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-19 09:14:59,619 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-19 09:14:59,621 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-19 09:14:59,625 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-19 09:14:59,652 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-19 09:14:59,655 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-19 09:14:59,657 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-19 09:14:59,658 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-19 09:14:59,680 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-19 09:14:59,680 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-19 09:14:59,685 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-19 09:14:59,686 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-19 09:14:59,703 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-19 09:14:59,705 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-19 09:14:59,707 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-19 09:14:59,709 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-19 09:14:59,726 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-19 09:14:59,727 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-19 09:14:59,728 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-19 09:14:59,729 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-19 09:14:59,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:14:59,758 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:14:59,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:14:59,996 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:14:59,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59 WrapperNode [2024-11-19 09:14:59,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:14:59,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:14:59,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:14:59,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:15:00,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,182 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3443 [2024-11-19 09:15:00,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:15:00,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:15:00,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:15:00,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:15:00,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,348 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-11-19 09:15:00,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:15:00,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:15:00,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:15:00,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:15:00,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (1/1) ... [2024-11-19 09:15:00,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:15:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:00,542 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-19 09:15:00,551 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-19 09:15:00,596 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-19 09:15:00,597 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:15:00,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:15:00,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:15:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:15:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:00,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:15:00,598 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:15:00,598 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:15:00,598 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:15:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:15:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:15:00,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:15:00,836 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:15:00,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:15:00,894 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:00,911 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:00,931 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:15:04,989 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-19 09:15:04,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:15:05,042 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:15:05,043 INFO L316 CfgBuilder]: Removed 151 assume(true) statements. [2024-11-19 09:15:05,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:05 BoogieIcfgContainer [2024-11-19 09:15:05,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:15:05,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:15:05,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:15:05,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:15:05,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:14:59" (1/3) ... [2024-11-19 09:15:05,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf8835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:05, skipping insertion in model container [2024-11-19 09:15:05,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:14:59" (2/3) ... [2024-11-19 09:15:05,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf8835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:05, skipping insertion in model container [2024-11-19 09:15:05,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:05" (3/3) ... [2024-11-19 09:15:05,055 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-11-19 09:15:05,073 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:15:05,074 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-11-19 09:15:05,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:15:05,194 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;@79283a37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:15:05,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-19 09:15:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 09:15:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:15:05,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:05,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:15:05,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-19 09:15:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683930690] [2024-11-19 09:15:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:05,477 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-19 09:15:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683930690] [2024-11-19 09:15:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683930690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571726583] [2024-11-19 09:15:05,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:05,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:05,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:05,521 INFO L87 Difference]: Start difference. First operand has 2650 states, 1652 states have (on average 1.9776029055690072) internal successors, (3267), 2636 states have internal predecessors, (3267), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-19 09:15:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:07,113 INFO L93 Difference]: Finished difference Result 3236 states and 3807 transitions. [2024-11-19 09:15:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:07,116 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-19 09:15:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:07,160 INFO L225 Difference]: With dead ends: 3236 [2024-11-19 09:15:07,161 INFO L226 Difference]: Without dead ends: 3234 [2024-11-19 09:15:07,163 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-19 09:15:07,167 INFO L432 NwaCegarLoop]: 2197 mSDtfsCounter, 2869 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:07,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2734 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:15:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2024-11-19 09:15:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2887. [2024-11-19 09:15:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 1917 states have (on average 1.8669796557120502) internal successors, (3579), 2871 states have internal predecessors, (3579), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:15:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3611 transitions. [2024-11-19 09:15:07,323 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3611 transitions. Word has length 3 [2024-11-19 09:15:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:07,324 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 3611 transitions. [2024-11-19 09:15:07,324 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-19 09:15:07,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3611 transitions. [2024-11-19 09:15:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:15:07,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:07,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:15:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:15:07,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:07,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-19 09:15:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218060649] [2024-11-19 09:15:07,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:07,453 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-19 09:15:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:07,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218060649] [2024-11-19 09:15:07,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218060649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:07,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856627519] [2024-11-19 09:15:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:07,456 INFO L87 Difference]: Start difference. First operand 2887 states and 3611 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-19 09:15:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:09,556 INFO L93 Difference]: Finished difference Result 4956 states and 6133 transitions. [2024-11-19 09:15:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:09,557 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-19 09:15:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:09,576 INFO L225 Difference]: With dead ends: 4956 [2024-11-19 09:15:09,577 INFO L226 Difference]: Without dead ends: 4956 [2024-11-19 09:15:09,579 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-19 09:15:09,580 INFO L432 NwaCegarLoop]: 2399 mSDtfsCounter, 2502 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2509 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:09,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4507 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:15:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2024-11-19 09:15:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4280. [2024-11-19 09:15:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 3308 states have (on average 1.835247883917775) internal successors, (6071), 4257 states have internal predecessors, (6071), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6117 transitions. [2024-11-19 09:15:09,741 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6117 transitions. Word has length 3 [2024-11-19 09:15:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:09,741 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 6117 transitions. [2024-11-19 09:15:09,742 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-19 09:15:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6117 transitions. [2024-11-19 09:15:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:15:09,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:09,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:09,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:15:09,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-19 09:15:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:09,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842439518] [2024-11-19 09:15:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:09,842 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-19 09:15:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842439518] [2024-11-19 09:15:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842439518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:09,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:09,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:09,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824252072] [2024-11-19 09:15:09,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:09,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:09,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:09,846 INFO L87 Difference]: Start difference. First operand 4280 states and 6117 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:15:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:11,145 INFO L93 Difference]: Finished difference Result 5364 states and 7438 transitions. [2024-11-19 09:15:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:15:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:11,164 INFO L225 Difference]: With dead ends: 5364 [2024-11-19 09:15:11,164 INFO L226 Difference]: Without dead ends: 5364 [2024-11-19 09:15:11,165 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-19 09:15:11,166 INFO L432 NwaCegarLoop]: 3528 mSDtfsCounter, 2840 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2850 SdHoareTripleChecker+Valid, 4697 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:11,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2850 Valid, 4697 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 09:15:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2024-11-19 09:15:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4188. [2024-11-19 09:15:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4188 states, 3308 states have (on average 1.7868802902055623) internal successors, (5911), 4165 states have internal predecessors, (5911), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5957 transitions. [2024-11-19 09:15:11,256 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5957 transitions. Word has length 8 [2024-11-19 09:15:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:11,256 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5957 transitions. [2024-11-19 09:15:11,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:15:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5957 transitions. [2024-11-19 09:15:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:15:11,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:11,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:15:11,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-19 09:15:11,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:11,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725168356] [2024-11-19 09:15:11,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:11,346 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-19 09:15:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725168356] [2024-11-19 09:15:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725168356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:15:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014217230] [2024-11-19 09:15:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:11,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:11,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:11,348 INFO L87 Difference]: Start difference. First operand 4188 states and 5957 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:15:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:13,005 INFO L93 Difference]: Finished difference Result 6923 states and 9906 transitions. [2024-11-19 09:15:13,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:13,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:15:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:13,031 INFO L225 Difference]: With dead ends: 6923 [2024-11-19 09:15:13,031 INFO L226 Difference]: Without dead ends: 6923 [2024-11-19 09:15:13,031 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-19 09:15:13,032 INFO L432 NwaCegarLoop]: 3882 mSDtfsCounter, 2319 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 5660 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:13,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5660 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:15:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2024-11-19 09:15:13,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 4720. [2024-11-19 09:15:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4720 states, 3850 states have (on average 1.7805194805194806) internal successors, (6855), 4697 states have internal predecessors, (6855), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 6901 transitions. [2024-11-19 09:15:13,173 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 6901 transitions. Word has length 8 [2024-11-19 09:15:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:13,174 INFO L471 AbstractCegarLoop]: Abstraction has 4720 states and 6901 transitions. [2024-11-19 09:15:13,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-19 09:15:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 6901 transitions. [2024-11-19 09:15:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:15:13,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:13,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:13,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:15:13,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:13,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -342826361, now seen corresponding path program 1 times [2024-11-19 09:15:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634261578] [2024-11-19 09:15:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:13,310 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-19 09:15:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634261578] [2024-11-19 09:15:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634261578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022835021] [2024-11-19 09:15:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:13,313 INFO L87 Difference]: Start difference. First operand 4720 states and 6901 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 09:15:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:13,568 INFO L93 Difference]: Finished difference Result 6557 states and 9343 transitions. [2024-11-19 09:15:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-19 09:15:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:13,592 INFO L225 Difference]: With dead ends: 6557 [2024-11-19 09:15:13,592 INFO L226 Difference]: Without dead ends: 6557 [2024-11-19 09:15:13,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:13,593 INFO L432 NwaCegarLoop]: 3442 mSDtfsCounter, 1449 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 9732 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:13,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:15:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-19 09:15:13,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4722. [2024-11-19 09:15:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 3852 states have (on average 1.7801142263759087) internal successors, (6857), 4699 states have internal predecessors, (6857), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-19 09:15:13,730 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 11 [2024-11-19 09:15:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-19 09:15:13,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 09:15:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-19 09:15:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:15:13,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:13,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:13,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:15:13,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:13,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1711966207, now seen corresponding path program 1 times [2024-11-19 09:15:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95524667] [2024-11-19 09:15:13,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:13,861 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-19 09:15:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95524667] [2024-11-19 09:15:13,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95524667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:13,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:13,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369247321] [2024-11-19 09:15:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:13,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:13,865 INFO L87 Difference]: Start difference. First operand 4722 states and 6903 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 09:15:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:14,102 INFO L93 Difference]: Finished difference Result 6557 states and 9342 transitions. [2024-11-19 09:15:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-19 09:15:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:14,127 INFO L225 Difference]: With dead ends: 6557 [2024-11-19 09:15:14,127 INFO L226 Difference]: Without dead ends: 6557 [2024-11-19 09:15:14,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:14,128 INFO L432 NwaCegarLoop]: 3442 mSDtfsCounter, 1438 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 9732 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:14,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:15:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-19 09:15:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4732. [2024-11-19 09:15:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4732 states, 3862 states have (on average 1.7780942516830658) internal successors, (6867), 4709 states have internal predecessors, (6867), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6913 transitions. [2024-11-19 09:15:14,213 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6913 transitions. Word has length 20 [2024-11-19 09:15:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:14,214 INFO L471 AbstractCegarLoop]: Abstraction has 4732 states and 6913 transitions. [2024-11-19 09:15:14,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-19 09:15:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6913 transitions. [2024-11-19 09:15:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:15:14,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:14,215 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:14,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:15:14,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:14,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-19 09:15:14,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:14,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107208888] [2024-11-19 09:15:14,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:14,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:14,286 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-19 09:15:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:14,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107208888] [2024-11-19 09:15:14,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107208888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:14,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:14,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:14,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481241582] [2024-11-19 09:15:14,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:14,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:14,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:14,289 INFO L87 Difference]: Start difference. First operand 4732 states and 6913 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 09:15:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:15,779 INFO L93 Difference]: Finished difference Result 4807 states and 7019 transitions. [2024-11-19 09:15:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-19 09:15:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:15,789 INFO L225 Difference]: With dead ends: 4807 [2024-11-19 09:15:15,789 INFO L226 Difference]: Without dead ends: 4807 [2024-11-19 09:15:15,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 09:15:15,790 INFO L432 NwaCegarLoop]: 2025 mSDtfsCounter, 3103 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:15,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3925 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 09:15:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2024-11-19 09:15:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4709. [2024-11-19 09:15:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 3862 states have (on average 1.7661833247022267) internal successors, (6821), 4686 states have internal predecessors, (6821), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 6867 transitions. [2024-11-19 09:15:15,861 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 6867 transitions. Word has length 20 [2024-11-19 09:15:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 4709 states and 6867 transitions. [2024-11-19 09:15:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-19 09:15:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 6867 transitions. [2024-11-19 09:15:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:15:15,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:15,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:15,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:15:15,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:15,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:15,864 INFO L85 PathProgramCache]: Analyzing trace with hash -286362848, now seen corresponding path program 1 times [2024-11-19 09:15:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:15,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589776141] [2024-11-19 09:15:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589776141] [2024-11-19 09:15:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589776141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:15,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972003947] [2024-11-19 09:15:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:15,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:15,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:15,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:15,949 INFO L87 Difference]: Start difference. First operand 4709 states and 6867 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 09:15:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:15,998 INFO L93 Difference]: Finished difference Result 4571 states and 6661 transitions. [2024-11-19 09:15:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-19 09:15:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:16,008 INFO L225 Difference]: With dead ends: 4571 [2024-11-19 09:15:16,009 INFO L226 Difference]: Without dead ends: 4571 [2024-11-19 09:15:16,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:16,011 INFO L432 NwaCegarLoop]: 2856 mSDtfsCounter, 61 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 5659 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:16,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 5659 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2024-11-19 09:15:16,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4571. [2024-11-19 09:15:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4571 states, 3736 states have (on average 1.770610278372591) internal successors, (6615), 4548 states have internal predecessors, (6615), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6661 transitions. [2024-11-19 09:15:16,070 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6661 transitions. Word has length 20 [2024-11-19 09:15:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 4571 states and 6661 transitions. [2024-11-19 09:15:16,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-19 09:15:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6661 transitions. [2024-11-19 09:15:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:15:16,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:16,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:16,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:15:16,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash -316632036, now seen corresponding path program 1 times [2024-11-19 09:15:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410198206] [2024-11-19 09:15:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:16,128 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-19 09:15:16,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410198206] [2024-11-19 09:15:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410198206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:16,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:16,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:16,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327110348] [2024-11-19 09:15:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:16,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:16,131 INFO L87 Difference]: Start difference. First operand 4571 states and 6661 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-19 09:15:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:16,206 INFO L93 Difference]: Finished difference Result 4542 states and 6611 transitions. [2024-11-19 09:15:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-19 09:15:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:16,215 INFO L225 Difference]: With dead ends: 4542 [2024-11-19 09:15:16,216 INFO L226 Difference]: Without dead ends: 4542 [2024-11-19 09:15:16,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:16,217 INFO L432 NwaCegarLoop]: 2821 mSDtfsCounter, 41 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8435 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:16,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-11-19 09:15:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4536. [2024-11-19 09:15:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3708 states have (on average 1.7688781014023733) internal successors, (6559), 4513 states have internal predecessors, (6559), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6605 transitions. [2024-11-19 09:15:16,272 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6605 transitions. Word has length 22 [2024-11-19 09:15:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:16,272 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 6605 transitions. [2024-11-19 09:15:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-19 09:15:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6605 transitions. [2024-11-19 09:15:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:15:16,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:16,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:15:16,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:15:16,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:16,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash -828222326, now seen corresponding path program 1 times [2024-11-19 09:15:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:16,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811285551] [2024-11-19 09:15:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:16,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:16,442 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-19 09:15:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:16,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811285551] [2024-11-19 09:15:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811285551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028319257] [2024-11-19 09:15:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:16,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:16,445 INFO L87 Difference]: Start difference. First operand 4536 states and 6605 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:15:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:18,065 INFO L93 Difference]: Finished difference Result 6833 states and 9754 transitions. [2024-11-19 09:15:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:15:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-19 09:15:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:18,079 INFO L225 Difference]: With dead ends: 6833 [2024-11-19 09:15:18,079 INFO L226 Difference]: Without dead ends: 6833 [2024-11-19 09:15:18,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-19 09:15:18,080 INFO L432 NwaCegarLoop]: 2286 mSDtfsCounter, 2318 mSDsluCounter, 3649 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 5935 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:18,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 5935 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 09:15:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2024-11-19 09:15:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 4532. [2024-11-19 09:15:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.766720604099245) internal successors, (6551), 4509 states have internal predecessors, (6551), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6597 transitions. [2024-11-19 09:15:18,155 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6597 transitions. Word has length 36 [2024-11-19 09:15:18,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:18,156 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6597 transitions. [2024-11-19 09:15:18,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-19 09:15:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6597 transitions. [2024-11-19 09:15:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 09:15:18,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:18,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:15:18,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 852766398, now seen corresponding path program 1 times [2024-11-19 09:15:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611034250] [2024-11-19 09:15:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:18,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611034250] [2024-11-19 09:15:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611034250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:18,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215649113] [2024-11-19 09:15:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:15:18,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:15:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:15:18,269 INFO L87 Difference]: Start difference. First operand 4532 states and 6597 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-19 09:15:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:18,336 INFO L93 Difference]: Finished difference Result 4532 states and 6589 transitions. [2024-11-19 09:15:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2024-11-19 09:15:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:18,346 INFO L225 Difference]: With dead ends: 4532 [2024-11-19 09:15:18,347 INFO L226 Difference]: Without dead ends: 4532 [2024-11-19 09:15:18,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:18,348 INFO L432 NwaCegarLoop]: 2816 mSDtfsCounter, 21 mSDsluCounter, 5601 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8417 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:18,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8417 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:15:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2024-11-19 09:15:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4532. [2024-11-19 09:15:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4532 states, 3708 states have (on average 1.7645631067961165) internal successors, (6543), 4509 states have internal predecessors, (6543), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 09:15:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6589 transitions. [2024-11-19 09:15:18,422 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6589 transitions. Word has length 70 [2024-11-19 09:15:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:18,422 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6589 transitions. [2024-11-19 09:15:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-19 09:15:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6589 transitions. [2024-11-19 09:15:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 09:15:18,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:18,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:15:18,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:18,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1685969162, now seen corresponding path program 1 times [2024-11-19 09:15:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536694383] [2024-11-19 09:15:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:18,577 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-19 09:15:18,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:18,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536694383] [2024-11-19 09:15:18,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536694383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:18,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:18,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:15:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450789550] [2024-11-19 09:15:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:18,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:15:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:15:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:18,579 INFO L87 Difference]: Start difference. First operand 4532 states and 6589 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-19 09:15:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:18,680 INFO L93 Difference]: Finished difference Result 6036 states and 8768 transitions. [2024-11-19 09:15:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:15:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-11-19 09:15:18,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:18,692 INFO L225 Difference]: With dead ends: 6036 [2024-11-19 09:15:18,692 INFO L226 Difference]: Without dead ends: 6036 [2024-11-19 09:15:18,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:15:18,693 INFO L432 NwaCegarLoop]: 2832 mSDtfsCounter, 1083 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 5601 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:18,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 5601 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:15:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2024-11-19 09:15:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 5385. [2024-11-19 09:15:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5385 states, 4557 states have (on average 1.7469826640333552) internal successors, (7961), 5358 states have internal predecessors, (7961), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:15:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8015 transitions. [2024-11-19 09:15:18,760 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8015 transitions. Word has length 78 [2024-11-19 09:15:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:18,761 INFO L471 AbstractCegarLoop]: Abstraction has 5385 states and 8015 transitions. [2024-11-19 09:15:18,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-19 09:15:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8015 transitions. [2024-11-19 09:15:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 09:15:18,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:18,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:15:18,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1252654197, now seen corresponding path program 1 times [2024-11-19 09:15:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633207580] [2024-11-19 09:15:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:19,202 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-19 09:15:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633207580] [2024-11-19 09:15:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633207580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:15:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124711132] [2024-11-19 09:15:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:15:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:19,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:15:19,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:15:19,205 INFO L87 Difference]: Start difference. First operand 5385 states and 8015 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-19 09:15:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:21,015 INFO L93 Difference]: Finished difference Result 5301 states and 7873 transitions. [2024-11-19 09:15:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:15:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2024-11-19 09:15:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:21,027 INFO L225 Difference]: With dead ends: 5301 [2024-11-19 09:15:21,027 INFO L226 Difference]: Without dead ends: 5301 [2024-11-19 09:15:21,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 09:15:21,028 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 5265 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5275 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:21,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5275 Valid, 3045 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:15:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2024-11-19 09:15:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 4759. [2024-11-19 09:15:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4759 states, 4015 states have (on average 1.7073474470734744) internal successors, (6855), 4732 states have internal predecessors, (6855), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:15:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6909 transitions. [2024-11-19 09:15:21,101 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6909 transitions. Word has length 81 [2024-11-19 09:15:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:21,101 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6909 transitions. [2024-11-19 09:15:21,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-19 09:15:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6909 transitions. [2024-11-19 09:15:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:15:21,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:21,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:21,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:15:21,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -420245411, now seen corresponding path program 1 times [2024-11-19 09:15:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839716581] [2024-11-19 09:15:21,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:21,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:21,411 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-19 09:15:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839716581] [2024-11-19 09:15:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839716581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808337641] [2024-11-19 09:15:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:21,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:15:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:15:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:21,413 INFO L87 Difference]: Start difference. First operand 4759 states and 6909 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-19 09:15:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:22,630 INFO L93 Difference]: Finished difference Result 4758 states and 6907 transitions. [2024-11-19 09:15:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:15:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-19 09:15:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:22,638 INFO L225 Difference]: With dead ends: 4758 [2024-11-19 09:15:22,638 INFO L226 Difference]: Without dead ends: 4758 [2024-11-19 09:15:22,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-19 09:15:22,639 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 2 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8487 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:22,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8487 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 09:15:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2024-11-19 09:15:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4758. [2024-11-19 09:15:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4015 states have (on average 1.7068493150684931) internal successors, (6853), 4731 states have internal predecessors, (6853), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:15:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6907 transitions. [2024-11-19 09:15:22,711 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6907 transitions. Word has length 86 [2024-11-19 09:15:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:22,711 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6907 transitions. [2024-11-19 09:15:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-19 09:15:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6907 transitions. [2024-11-19 09:15:22,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 09:15:22,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:22,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:22,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:15:22,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:22,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -420245410, now seen corresponding path program 1 times [2024-11-19 09:15:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:22,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939539224] [2024-11-19 09:15:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:23,291 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-19 09:15:23,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:23,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939539224] [2024-11-19 09:15:23,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939539224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:23,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:23,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:15:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581627823] [2024-11-19 09:15:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:23,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:15:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:23,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:15:23,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:15:23,294 INFO L87 Difference]: Start difference. First operand 4758 states and 6907 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-19 09:15:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:25,051 INFO L93 Difference]: Finished difference Result 4757 states and 6905 transitions. [2024-11-19 09:15:25,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:15:25,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2024-11-19 09:15:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:25,060 INFO L225 Difference]: With dead ends: 4757 [2024-11-19 09:15:25,060 INFO L226 Difference]: Without dead ends: 4757 [2024-11-19 09:15:25,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-19 09:15:25,061 INFO L432 NwaCegarLoop]: 2743 mSDtfsCounter, 1 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8461 SdHoareTripleChecker+Invalid, 2516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:25,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8461 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:15:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2024-11-19 09:15:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4757. [2024-11-19 09:15:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 4013 states have (on average 1.7072015948168453) internal successors, (6851), 4730 states have internal predecessors, (6851), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:15:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6905 transitions. [2024-11-19 09:15:25,128 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6905 transitions. Word has length 86 [2024-11-19 09:15:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:25,128 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6905 transitions. [2024-11-19 09:15:25,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 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-19 09:15:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6905 transitions. [2024-11-19 09:15:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 09:15:25,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:25,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:25,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:15:25,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:25,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -163344476, now seen corresponding path program 1 times [2024-11-19 09:15:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222747547] [2024-11-19 09:15:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:25,381 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-19 09:15:25,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:25,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222747547] [2024-11-19 09:15:25,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222747547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:25,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:25,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:15:25,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251600225] [2024-11-19 09:15:25,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:25,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:15:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:15:25,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:15:25,384 INFO L87 Difference]: Start difference. First operand 4757 states and 6905 transitions. Second operand has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-19 09:15:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:27,050 INFO L93 Difference]: Finished difference Result 4775 states and 6938 transitions. [2024-11-19 09:15:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:15:27,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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 94 [2024-11-19 09:15:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:27,066 INFO L225 Difference]: With dead ends: 4775 [2024-11-19 09:15:27,066 INFO L226 Difference]: Without dead ends: 4775 [2024-11-19 09:15:27,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:15:27,067 INFO L432 NwaCegarLoop]: 2707 mSDtfsCounter, 27 mSDsluCounter, 8670 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 11377 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:27,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 11377 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:15:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-19 09:15:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4766. [2024-11-19 09:15:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.7065406615269834) internal successors, (6862), 4737 states have internal predecessors, (6862), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-19 09:15:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6928 transitions. [2024-11-19 09:15:27,155 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6928 transitions. Word has length 94 [2024-11-19 09:15:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:27,156 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6928 transitions. [2024-11-19 09:15:27,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-19 09:15:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6928 transitions. [2024-11-19 09:15:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 09:15:27,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:27,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:27,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:15:27,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:27,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:27,158 INFO L85 PathProgramCache]: Analyzing trace with hash -163344475, now seen corresponding path program 1 times [2024-11-19 09:15:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:27,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198813049] [2024-11-19 09:15:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:27,723 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-19 09:15:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198813049] [2024-11-19 09:15:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198813049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:27,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:27,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:15:27,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914014586] [2024-11-19 09:15:27,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:27,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:15:27,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:27,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:15:27,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:15:27,726 INFO L87 Difference]: Start difference. First operand 4766 states and 6928 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-19 09:15:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:29,567 INFO L93 Difference]: Finished difference Result 4766 states and 6926 transitions. [2024-11-19 09:15:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:15:29,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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 94 [2024-11-19 09:15:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:29,575 INFO L225 Difference]: With dead ends: 4766 [2024-11-19 09:15:29,575 INFO L226 Difference]: Without dead ends: 4766 [2024-11-19 09:15:29,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:15:29,576 INFO L432 NwaCegarLoop]: 2714 mSDtfsCounter, 22 mSDsluCounter, 8081 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 10795 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:29,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 10795 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 09:15:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2024-11-19 09:15:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4766. [2024-11-19 09:15:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 4021 states have (on average 1.706043272817707) internal successors, (6860), 4737 states have internal predecessors, (6860), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-19 09:15:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6926 transitions. [2024-11-19 09:15:29,631 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6926 transitions. Word has length 94 [2024-11-19 09:15:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6926 transitions. [2024-11-19 09:15:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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-19 09:15:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6926 transitions. [2024-11-19 09:15:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:15:29,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:29,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:15:29,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1059827593, now seen corresponding path program 1 times [2024-11-19 09:15:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195915046] [2024-11-19 09:15:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:30,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:30,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195915046] [2024-11-19 09:15:30,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195915046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:30,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758289866] [2024-11-19 09:15:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:30,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:30,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:30,196 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-19 09:15:30,197 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-19 09:15:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:30,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:15:30,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:30,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:15:30,667 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-19 09:15:30,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:30,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:15:30,789 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 31 treesize of output 13 [2024-11-19 09:15:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:30,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:30,845 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 09:15:30,846 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 21 treesize of output 20 [2024-11-19 09:15:30,857 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-19 09:15:30,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758289866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:30,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2024-11-19 09:15:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408812632] [2024-11-19 09:15:30,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:30,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:15:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:30,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:15:30,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-19 09:15:30,860 INFO L87 Difference]: Start difference. First operand 4766 states and 6926 transitions. Second operand has 14 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:34,391 INFO L93 Difference]: Finished difference Result 4765 states and 6924 transitions. [2024-11-19 09:15:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:15:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-19 09:15:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:34,401 INFO L225 Difference]: With dead ends: 4765 [2024-11-19 09:15:34,402 INFO L226 Difference]: Without dead ends: 4765 [2024-11-19 09:15:34,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-19 09:15:34,403 INFO L432 NwaCegarLoop]: 1892 mSDtfsCounter, 2667 mSDsluCounter, 14965 mSDsCounter, 0 mSdLazyCounter, 7822 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 16857 SdHoareTripleChecker+Invalid, 7847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:34,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 16857 Invalid, 7847 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 7822 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 09:15:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2024-11-19 09:15:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 4765. [2024-11-19 09:15:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4765 states, 4021 states have (on average 1.7055458841084308) internal successors, (6858), 4736 states have internal predecessors, (6858), 27 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (39), 26 states have call predecessors, (39), 27 states have call successors, (39) [2024-11-19 09:15:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4765 states to 4765 states and 6924 transitions. [2024-11-19 09:15:34,471 INFO L78 Accepts]: Start accepts. Automaton has 4765 states and 6924 transitions. Word has length 95 [2024-11-19 09:15:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 4765 states and 6924 transitions. [2024-11-19 09:15:34,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 9.0) internal successors, (108), 13 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:15:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4765 states and 6924 transitions. [2024-11-19 09:15:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 09:15:34,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:34,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:34,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:15:34,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 09:15:34,676 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1059827594, now seen corresponding path program 1 times [2024-11-19 09:15:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399381883] [2024-11-19 09:15:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399381883] [2024-11-19 09:15:35,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399381883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:35,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720007723] [2024-11-19 09:15:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:35,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:35,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:35,445 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-19 09:15:35,447 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-19 09:15:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:35,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 09:15:35,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:35,857 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:15:35,858 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-19 09:15:35,863 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 8 treesize of output 1 [2024-11-19 09:15:35,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:35,901 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 13 treesize of output 9 [2024-11-19 09:15:36,003 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 22 treesize of output 10 [2024-11-19 09:15:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:15:36,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:36,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:15:36,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:15:36,175 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 31 treesize of output 13 [2024-11-19 09:15:36,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:15:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:36,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:36,313 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_804) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_805 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:15:36,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720007723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:36,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:36,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2024-11-19 09:15:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651524390] [2024-11-19 09:15:36,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:36,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:15:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:36,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:15:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-19 09:15:36,318 INFO L87 Difference]: Start difference. First operand 4765 states and 6924 transitions. Second operand has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:15:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:42,090 INFO L93 Difference]: Finished difference Result 4772 states and 6930 transitions. [2024-11-19 09:15:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:15:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-19 09:15:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:42,098 INFO L225 Difference]: With dead ends: 4772 [2024-11-19 09:15:42,098 INFO L226 Difference]: Without dead ends: 4772 [2024-11-19 09:15:42,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-19 09:15:42,099 INFO L432 NwaCegarLoop]: 1897 mSDtfsCounter, 2661 mSDsluCounter, 14630 mSDsCounter, 0 mSdLazyCounter, 10870 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2679 SdHoareTripleChecker+Valid, 16527 SdHoareTripleChecker+Invalid, 10899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 10870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:42,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2679 Valid, 16527 Invalid, 10899 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 10870 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-19 09:15:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-19 09:15:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4760. [2024-11-19 09:15:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4017 states have (on average 1.7057505601194922) internal successors, (6852), 4732 states have internal predecessors, (6852), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:15:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6906 transitions. [2024-11-19 09:15:42,168 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6906 transitions. Word has length 95 [2024-11-19 09:15:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:42,169 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6906 transitions. [2024-11-19 09:15:42,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:15:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6906 transitions. [2024-11-19 09:15:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 09:15:42,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:42,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:42,191 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-19 09:15:42,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:42,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 3326204, now seen corresponding path program 1 times [2024-11-19 09:15:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150827078] [2024-11-19 09:15:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150827078] [2024-11-19 09:15:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150827078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 09:15:42,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298117236] [2024-11-19 09:15:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:42,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:15:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:15:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:15:42,916 INFO L87 Difference]: Start difference. First operand 4760 states and 6906 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-19 09:15:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:46,251 INFO L93 Difference]: Finished difference Result 4779 states and 6938 transitions. [2024-11-19 09:15:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:15:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-19 09:15:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:46,259 INFO L225 Difference]: With dead ends: 4779 [2024-11-19 09:15:46,259 INFO L226 Difference]: Without dead ends: 4779 [2024-11-19 09:15:46,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 09:15:46,260 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2669 mSDsluCounter, 14928 mSDsCounter, 0 mSdLazyCounter, 7887 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 16819 SdHoareTripleChecker+Invalid, 7911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:46,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 16819 Invalid, 7911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 7887 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 09:15:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-19 09:15:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4775. [2024-11-19 09:15:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7040436616224262) internal successors, (6869), 4745 states have internal predecessors, (6869), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-19 09:15:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6925 transitions. [2024-11-19 09:15:46,322 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6925 transitions. Word has length 97 [2024-11-19 09:15:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:46,322 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6925 transitions. [2024-11-19 09:15:46,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 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-19 09:15:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6925 transitions. [2024-11-19 09:15:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 09:15:46,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:46,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 09:15:46,324 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 3326205, now seen corresponding path program 1 times [2024-11-19 09:15:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336237562] [2024-11-19 09:15:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:47,079 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-19 09:15:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336237562] [2024-11-19 09:15:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336237562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:15:47,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:15:47,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:15:47,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786020183] [2024-11-19 09:15:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:15:47,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:15:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:47,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:15:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:15:47,083 INFO L87 Difference]: Start difference. First operand 4775 states and 6925 transitions. Second operand has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-19 09:15:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:50,627 INFO L93 Difference]: Finished difference Result 4778 states and 6936 transitions. [2024-11-19 09:15:50,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:15:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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 97 [2024-11-19 09:15:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:50,635 INFO L225 Difference]: With dead ends: 4778 [2024-11-19 09:15:50,636 INFO L226 Difference]: Without dead ends: 4778 [2024-11-19 09:15:50,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:15:50,637 INFO L432 NwaCegarLoop]: 1898 mSDtfsCounter, 2661 mSDsluCounter, 9762 mSDsCounter, 0 mSdLazyCounter, 7544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2679 SdHoareTripleChecker+Valid, 11660 SdHoareTripleChecker+Invalid, 7566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:50,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2679 Valid, 11660 Invalid, 7566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7544 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 09:15:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-19 09:15:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4775. [2024-11-19 09:15:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4031 states have (on average 1.7035475068221284) internal successors, (6867), 4745 states have internal predecessors, (6867), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-19 09:15:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6923 transitions. [2024-11-19 09:15:50,695 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6923 transitions. Word has length 97 [2024-11-19 09:15:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:50,696 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6923 transitions. [2024-11-19 09:15:50,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.5) internal successors, (95), 11 states have internal predecessors, (95), 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-19 09:15:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6923 transitions. [2024-11-19 09:15:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 09:15:50,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:50,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:50,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 09:15:50,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1019894519, now seen corresponding path program 1 times [2024-11-19 09:15:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:50,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317590359] [2024-11-19 09:15:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:51,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317590359] [2024-11-19 09:15:51,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317590359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:51,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246260121] [2024-11-19 09:15:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:51,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:51,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:51,260 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-19 09:15:51,262 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-19 09:15:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:51,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:15:51,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:51,563 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-19 09:15:51,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:15:51,668 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-19 09:15:51,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:51,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:51,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:15:51,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:51,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-19 09:15:51,788 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 31 treesize of output 13 [2024-11-19 09:15:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:51,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:51,829 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 09:15:51,868 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 09:15:51,868 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 33 treesize of output 32 [2024-11-19 09:15:51,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1089 (Array Int Int)) (v_ArrVal_1086 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1089))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1086)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem55#1.base|)) is different from false [2024-11-19 09:15:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246260121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:51,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:51,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-19 09:15:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530855176] [2024-11-19 09:15:51,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:51,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:15:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:15:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=224, Unknown=7, NotChecked=62, Total=342 [2024-11-19 09:15:51,879 INFO L87 Difference]: Start difference. First operand 4775 states and 6923 transitions. Second operand has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 15 states have internal predecessors, (144), 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-19 09:15:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:15:55,402 INFO L93 Difference]: Finished difference Result 4777 states and 6934 transitions. [2024-11-19 09:15:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:15:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 15 states have internal predecessors, (144), 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-19 09:15:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:15:55,411 INFO L225 Difference]: With dead ends: 4777 [2024-11-19 09:15:55,411 INFO L226 Difference]: Without dead ends: 4777 [2024-11-19 09:15:55,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=453, Unknown=7, NotChecked=90, Total=650 [2024-11-19 09:15:55,412 INFO L432 NwaCegarLoop]: 1891 mSDtfsCounter, 2647 mSDsluCounter, 16787 mSDsCounter, 0 mSdLazyCounter, 8713 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 18678 SdHoareTripleChecker+Invalid, 8736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:15:55,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 18678 Invalid, 8736 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8713 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 09:15:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-19 09:15:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4774. [2024-11-19 09:15:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4031 states have (on average 1.7030513520218309) internal successors, (6865), 4744 states have internal predecessors, (6865), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-19 09:15:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 6921 transitions. [2024-11-19 09:15:55,474 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 6921 transitions. Word has length 98 [2024-11-19 09:15:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:15:55,474 INFO L471 AbstractCegarLoop]: Abstraction has 4774 states and 6921 transitions. [2024-11-19 09:15:55,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 10.285714285714286) internal successors, (144), 15 states have internal predecessors, (144), 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-19 09:15:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 6921 transitions. [2024-11-19 09:15:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 09:15:55,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:15:55,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:15:55,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 09:15:55,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:55,680 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:15:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:15:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1019894520, now seen corresponding path program 1 times [2024-11-19 09:15:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:15:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985093670] [2024-11-19 09:15:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:15:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:15:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985093670] [2024-11-19 09:15:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985093670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779574232] [2024-11-19 09:15:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:15:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:15:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:15:56,637 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-19 09:15:56,639 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-19 09:15:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:15:56,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 09:15:56,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:15:56,958 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-19 09:15:57,066 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:15:57,067 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-19 09:15:57,075 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 8 treesize of output 1 [2024-11-19 09:15:57,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:15:57,105 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 13 treesize of output 9 [2024-11-19 09:15:57,185 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 22 treesize of output 10 [2024-11-19 09:15:57,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:15:57,303 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:57,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:15:57,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:15:57,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:15:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:15:57,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:15:57,408 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 31 treesize of output 13 [2024-11-19 09:15:57,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:15:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:15:57,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:15:57,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 09:15:57,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-19 09:15:57,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1248) .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1242) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1248 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1248) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-19 09:15:57,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779574232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:15:57,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:15:57,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 09:15:57,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064475737] [2024-11-19 09:15:57,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:15:57,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 09:15:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:15:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 09:15:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2024-11-19 09:15:57,543 INFO L87 Difference]: Start difference. First operand 4774 states and 6921 transitions. Second operand has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:16:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:03,436 INFO L93 Difference]: Finished difference Result 4776 states and 6932 transitions. [2024-11-19 09:16:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:16:03,436 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 98 [2024-11-19 09:16:03,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:03,442 INFO L225 Difference]: With dead ends: 4776 [2024-11-19 09:16:03,442 INFO L226 Difference]: Without dead ends: 4776 [2024-11-19 09:16:03,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=595, Unknown=3, NotChecked=156, Total=870 [2024-11-19 09:16:03,442 INFO L432 NwaCegarLoop]: 1896 mSDtfsCounter, 2647 mSDsluCounter, 17648 mSDsCounter, 0 mSdLazyCounter, 13374 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 19544 SdHoareTripleChecker+Invalid, 13402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:03,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 19544 Invalid, 13402 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 13374 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-19 09:16:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-19 09:16:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4758. [2024-11-19 09:16:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4758 states, 4017 states have (on average 1.704754792133433) internal successors, (6848), 4730 states have internal predecessors, (6848), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-19 09:16:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6902 transitions. [2024-11-19 09:16:03,506 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6902 transitions. Word has length 98 [2024-11-19 09:16:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:03,506 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6902 transitions. [2024-11-19 09:16:03,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.235294117647058) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:16:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6902 transitions. [2024-11-19 09:16:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 09:16:03,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:03,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:16:03,529 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-19 09:16:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:16:03,713 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:16:03,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash 307366859, now seen corresponding path program 1 times [2024-11-19 09:16:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:16:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050645086] [2024-11-19 09:16:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:16:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:04,341 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-19 09:16:04,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:16:04,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050645086] [2024-11-19 09:16:04,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050645086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:04,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:04,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 09:16:04,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890880143] [2024-11-19 09:16:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:04,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:16:04,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:16:04,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:16:04,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:16:04,344 INFO L87 Difference]: Start difference. First operand 4758 states and 6902 transitions. Second operand has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-19 09:16:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:06,920 INFO L93 Difference]: Finished difference Result 4783 states and 6940 transitions. [2024-11-19 09:16:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:16:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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 100 [2024-11-19 09:16:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:06,927 INFO L225 Difference]: With dead ends: 4783 [2024-11-19 09:16:06,928 INFO L226 Difference]: Without dead ends: 4783 [2024-11-19 09:16:06,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 09:16:06,929 INFO L432 NwaCegarLoop]: 1890 mSDtfsCounter, 2670 mSDsluCounter, 11223 mSDsCounter, 0 mSdLazyCounter, 6138 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 13113 SdHoareTripleChecker+Invalid, 6162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:06,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 13113 Invalid, 6162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6138 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 09:16:06,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-19 09:16:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4779. [2024-11-19 09:16:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4037 states have (on average 1.7020064404260589) internal successors, (6871), 4749 states have internal predecessors, (6871), 27 states have call successors, (27), 4 states have call predecessors, (27), 5 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29) [2024-11-19 09:16:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6927 transitions. [2024-11-19 09:16:06,991 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6927 transitions. Word has length 100 [2024-11-19 09:16:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6927 transitions. [2024-11-19 09:16:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.538461538461538) internal successors, (98), 14 states have internal predecessors, (98), 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-19 09:16:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6927 transitions. [2024-11-19 09:16:06,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 09:16:06,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:06,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 09:16:06,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 09:16:06,993 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-11-19 09:16:06,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 307366860, now seen corresponding path program 1 times [2024-11-19 09:16:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:16:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145290904] [2024-11-19 09:16:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:16:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:07,834 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-19 09:16:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:16:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145290904] [2024-11-19 09:16:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145290904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:16:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106779424] [2024-11-19 09:16:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:07,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:16:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:16:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:16:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:16:07,837 INFO L87 Difference]: Start difference. First operand 4779 states and 6927 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 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)