./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f 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_FNV_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 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:39:29,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:39:29,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:39:29,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:39:29,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:39:29,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:39:29,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:39:29,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:39:29,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:39:29,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:39:29,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:39:29,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:39:29,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:39:29,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:39:29,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:39:29,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:39:29,559 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:39:29,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:39:29,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:39:29,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:39:29,560 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:39:29,563 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:39:29,564 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:39:29,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:39:29,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:39:29,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:39:29,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:39:29,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:39:29,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:39:29,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:39:29,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:39:29,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:39:29,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:39:29,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:39:29,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:39:29,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:39:29,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:39:29,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:39:29,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:39:29,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:39:29,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:39:29,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:39:29,570 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 -> 43c551c05c986c34609f999e25a13e0dbb4f692e7b1d3b7f2939ec615c71d0d0 [2024-11-12 15:39:29,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:39:29,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:39:29,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:39:29,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:39:29,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:39:29,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-11-12 15:39:31,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:39:31,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:39:31,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test10-1.i [2024-11-12 15:39:31,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec35036e3/23d774f6bd6d458699b043f8180ee778/FLAG0e439019d [2024-11-12 15:39:31,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec35036e3/23d774f6bd6d458699b043f8180ee778 [2024-11-12 15:39:31,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:39:31,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:39:31,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:39:31,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:39:31,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:39:31,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:39:31" (1/1) ... [2024-11-12 15:39:31,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7971c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:31, skipping insertion in model container [2024-11-12 15:39:31,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:39:31" (1/1) ... [2024-11-12 15:39:31,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:39:32,326 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-12 15:39:32,365 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-12 15:39:32,368 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-12 15:39:32,372 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-12 15:39:32,378 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-12 15:39:32,408 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-12 15:39:32,414 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-12 15:39:32,417 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-12 15:39:32,423 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-12 15:39:32,458 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-12 15:39:32,458 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-12 15:39:32,461 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-12 15:39:32,461 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-12 15:39:32,473 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-12 15:39:32,474 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-12 15:39:32,476 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-12 15:39:32,476 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-12 15:39:32,492 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-12 15:39:32,495 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-12 15:39:32,497 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-12 15:39:32,498 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-12 15:39:32,518 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-12 15:39:32,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-12 15:39:32,525 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-12 15:39:32,529 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-12 15:39:32,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:39:32,562 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:39:32,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:39:32,801 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:39:32,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32 WrapperNode [2024-11-12 15:39:32,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:39:32,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:39:32,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:39:32,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:39:32,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:32,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:32,984 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3443 [2024-11-12 15:39:32,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:39:32,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:39:32,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:39:32,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:39:32,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:32,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,167 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 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, 82, 4]. [2024-11-12 15:39:33,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:39:33,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:39:33,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:39:33,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:39:33,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (1/1) ... [2024-11-12 15:39:33,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:39:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:39:33,358 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-12 15:39:33,365 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-12 15:39:33,410 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-12 15:39:33,411 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-12 15:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 15:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 15:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 15:39:33,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:39:33,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:39:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 15:39:33,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 15:39:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 15:39:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:39:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:39:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 15:39:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:39:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:39:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:39:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:39:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 15:39:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:39:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 15:39:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 15:39:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 15:39:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:39:33,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:39:33,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:39:33,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:39:33,749 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:39:33,768 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:39:33,782 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:39:37,751 INFO L? ?]: Removed 2487 outVars from TransFormulas that were not future-live. [2024-11-12 15:39:37,751 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:39:37,813 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:39:37,814 INFO L316 CfgBuilder]: Removed 151 assume(true) statements. [2024-11-12 15:39:37,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:39:37 BoogieIcfgContainer [2024-11-12 15:39:37,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:39:37,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:39:37,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:39:37,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:39:37,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:39:31" (1/3) ... [2024-11-12 15:39:37,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0e8ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:39:37, skipping insertion in model container [2024-11-12 15:39:37,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:39:32" (2/3) ... [2024-11-12 15:39:37,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0e8ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:39:37, skipping insertion in model container [2024-11-12 15:39:37,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:39:37" (3/3) ... [2024-11-12 15:39:37,824 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test10-1.i [2024-11-12 15:39:37,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:39:37,841 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-11-12 15:39:37,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:39:37,985 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;@1da91391, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:39:37,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-11-12 15:39:37,999 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-12 15:39:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:39:38,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:38,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:39:38,009 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-12 15:39:38,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-12 15:39:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:38,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211824812] [2024-11-12 15:39:38,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:38,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:38,254 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-12 15:39:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:38,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211824812] [2024-11-12 15:39:38,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211824812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:38,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:39:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017070377] [2024-11-12 15:39:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:38,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:38,294 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-12 15:39:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:39,908 INFO L93 Difference]: Finished difference Result 3236 states and 3807 transitions. [2024-11-12 15:39:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:39,910 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-12 15:39:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:39,940 INFO L225 Difference]: With dead ends: 3236 [2024-11-12 15:39:39,940 INFO L226 Difference]: Without dead ends: 3234 [2024-11-12 15:39:39,942 INFO L434 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-12 15:39:39,945 INFO L435 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.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:39,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 2734 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:39:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2024-11-12 15:39:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2887. [2024-11-12 15:39:40,071 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-12 15:39:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3611 transitions. [2024-11-12 15:39:40,080 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3611 transitions. Word has length 3 [2024-11-12 15:39:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:40,081 INFO L471 AbstractCegarLoop]: Abstraction has 2887 states and 3611 transitions. [2024-11-12 15:39:40,081 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-12 15:39:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3611 transitions. [2024-11-12 15:39:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:39:40,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:40,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:39:40,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 15:39:40,082 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-12 15:39:40,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:40,083 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-12 15:39:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507066186] [2024-11-12 15:39:40,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:40,223 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-12 15:39:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507066186] [2024-11-12 15:39:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507066186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:40,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:39:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100405275] [2024-11-12 15:39:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:40,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:40,227 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-12 15:39:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:42,027 INFO L93 Difference]: Finished difference Result 4956 states and 6133 transitions. [2024-11-12 15:39:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:42,028 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-12 15:39:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:42,047 INFO L225 Difference]: With dead ends: 4956 [2024-11-12 15:39:42,047 INFO L226 Difference]: Without dead ends: 4956 [2024-11-12 15:39:42,048 INFO L434 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-12 15:39:42,049 INFO L435 NwaCegarLoop]: 2399 mSDtfsCounter, 2502 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:42,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2509 Valid, 4507 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:39:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2024-11-12 15:39:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4280. [2024-11-12 15:39:42,163 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-12 15:39:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6117 transitions. [2024-11-12 15:39:42,182 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6117 transitions. Word has length 3 [2024-11-12 15:39:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:42,182 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 6117 transitions. [2024-11-12 15:39:42,182 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-12 15:39:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6117 transitions. [2024-11-12 15:39:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:39:42,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:42,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:39:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 15:39:42,184 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-12 15:39:42,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-12 15:39:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389320700] [2024-11-12 15:39:42,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:42,290 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-12 15:39:42,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:42,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389320700] [2024-11-12 15:39:42,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389320700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:42,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:42,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:39:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227164968] [2024-11-12 15:39:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:42,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:42,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:42,292 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-12 15:39:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:43,606 INFO L93 Difference]: Finished difference Result 5364 states and 7438 transitions. [2024-11-12 15:39:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:43,606 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-12 15:39:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:43,625 INFO L225 Difference]: With dead ends: 5364 [2024-11-12 15:39:43,625 INFO L226 Difference]: Without dead ends: 5364 [2024-11-12 15:39:43,626 INFO L434 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-12 15:39:43,627 INFO L435 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-12 15:39:43,630 INFO L436 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-12 15:39:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2024-11-12 15:39:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4188. [2024-11-12 15:39:43,759 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-12 15:39:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4188 states to 4188 states and 5957 transitions. [2024-11-12 15:39:43,774 INFO L78 Accepts]: Start accepts. Automaton has 4188 states and 5957 transitions. Word has length 8 [2024-11-12 15:39:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:43,774 INFO L471 AbstractCegarLoop]: Abstraction has 4188 states and 5957 transitions. [2024-11-12 15:39:43,775 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-12 15:39:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4188 states and 5957 transitions. [2024-11-12 15:39:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:39:43,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:43,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:39:43,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 15:39:43,777 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-12 15:39:43,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-12 15:39:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:43,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385784866] [2024-11-12 15:39:43,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:43,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:43,915 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-12 15:39:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385784866] [2024-11-12 15:39:43,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385784866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:43,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:43,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:39:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879016565] [2024-11-12 15:39:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:43,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:43,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:43,918 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-12 15:39:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:45,313 INFO L93 Difference]: Finished difference Result 6923 states and 9906 transitions. [2024-11-12 15:39:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:45,313 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-12 15:39:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:45,333 INFO L225 Difference]: With dead ends: 6923 [2024-11-12 15:39:45,333 INFO L226 Difference]: Without dead ends: 6923 [2024-11-12 15:39:45,333 INFO L434 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-12 15:39:45,334 INFO L435 NwaCegarLoop]: 3882 mSDtfsCounter, 2319 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:45,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 5660 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:39:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2024-11-12 15:39:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 4720. [2024-11-12 15:39:45,458 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-12 15:39:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4720 states to 4720 states and 6901 transitions. [2024-11-12 15:39:45,466 INFO L78 Accepts]: Start accepts. Automaton has 4720 states and 6901 transitions. Word has length 8 [2024-11-12 15:39:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:45,467 INFO L471 AbstractCegarLoop]: Abstraction has 4720 states and 6901 transitions. [2024-11-12 15:39:45,467 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-12 15:39:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4720 states and 6901 transitions. [2024-11-12 15:39:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:39:45,467 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:45,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:39:45,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 15:39:45,468 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-12 15:39:45,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash -342826361, now seen corresponding path program 1 times [2024-11-12 15:39:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887002212] [2024-11-12 15:39:45,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:45,563 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-12 15:39:45,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887002212] [2024-11-12 15:39:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887002212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566565655] [2024-11-12 15:39:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:45,566 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-12 15:39:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:45,774 INFO L93 Difference]: Finished difference Result 6557 states and 9343 transitions. [2024-11-12 15:39:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:39:45,775 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-12 15:39:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:45,795 INFO L225 Difference]: With dead ends: 6557 [2024-11-12 15:39:45,796 INFO L226 Difference]: Without dead ends: 6557 [2024-11-12 15:39:45,796 INFO L434 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-12 15:39:45,797 INFO L435 NwaCegarLoop]: 3442 mSDtfsCounter, 1449 mSDsluCounter, 6290 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:45,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 9732 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:39:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-12 15:39:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4722. [2024-11-12 15:39:45,883 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-12 15:39:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 6903 transitions. [2024-11-12 15:39:45,892 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 6903 transitions. Word has length 11 [2024-11-12 15:39:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:45,893 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 6903 transitions. [2024-11-12 15:39:45,893 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-12 15:39:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 6903 transitions. [2024-11-12 15:39:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 15:39:45,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:45,894 INFO L218 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-12 15:39:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 15:39:45,894 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-12 15:39:45,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1711966207, now seen corresponding path program 1 times [2024-11-12 15:39:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:45,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847987076] [2024-11-12 15:39:45,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:46,010 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-12 15:39:46,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847987076] [2024-11-12 15:39:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847987076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:46,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:46,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474039803] [2024-11-12 15:39:46,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:46,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:46,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:46,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:46,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:46,013 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-12 15:39:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:46,234 INFO L93 Difference]: Finished difference Result 6557 states and 9342 transitions. [2024-11-12 15:39:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:39:46,235 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-12 15:39:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:46,253 INFO L225 Difference]: With dead ends: 6557 [2024-11-12 15:39:46,254 INFO L226 Difference]: Without dead ends: 6557 [2024-11-12 15:39:46,254 INFO L434 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-12 15:39:46,256 INFO L435 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-12 15:39:46,257 INFO L436 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-12 15:39:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-12 15:39:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 4732. [2024-11-12 15:39:46,339 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-12 15:39:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 6913 transitions. [2024-11-12 15:39:46,348 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 6913 transitions. Word has length 20 [2024-11-12 15:39:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:46,348 INFO L471 AbstractCegarLoop]: Abstraction has 4732 states and 6913 transitions. [2024-11-12 15:39:46,349 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-12 15:39:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 6913 transitions. [2024-11-12 15:39:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 15:39:46,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:46,349 INFO L218 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-12 15:39:46,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 15:39:46,350 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-12 15:39:46,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-12 15:39:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433766739] [2024-11-12 15:39:46,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:46,445 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-12 15:39:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433766739] [2024-11-12 15:39:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433766739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:46,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:39:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479949915] [2024-11-12 15:39:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:46,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:46,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:46,447 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-12 15:39:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:47,682 INFO L93 Difference]: Finished difference Result 4807 states and 7019 transitions. [2024-11-12 15:39:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:39:47,683 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-12 15:39:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:47,693 INFO L225 Difference]: With dead ends: 4807 [2024-11-12 15:39:47,693 INFO L226 Difference]: Without dead ends: 4807 [2024-11-12 15:39:47,693 INFO L434 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-12 15:39:47,694 INFO L435 NwaCegarLoop]: 2025 mSDtfsCounter, 3103 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:47,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 3925 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:39:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2024-11-12 15:39:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4709. [2024-11-12 15:39:47,760 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-12 15:39:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 6867 transitions. [2024-11-12 15:39:47,768 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 6867 transitions. Word has length 20 [2024-11-12 15:39:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 4709 states and 6867 transitions. [2024-11-12 15:39:47,768 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-12 15:39:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 6867 transitions. [2024-11-12 15:39:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 15:39:47,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:47,769 INFO L218 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-12 15:39:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 15:39:47,769 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-12 15:39:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash -286362848, now seen corresponding path program 1 times [2024-11-12 15:39:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046065928] [2024-11-12 15:39:47,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:39:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046065928] [2024-11-12 15:39:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046065928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:39:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071756124] [2024-11-12 15:39:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:47,844 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-12 15:39:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:47,887 INFO L93 Difference]: Finished difference Result 4571 states and 6661 transitions. [2024-11-12 15:39:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:47,888 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-12 15:39:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:47,899 INFO L225 Difference]: With dead ends: 4571 [2024-11-12 15:39:47,899 INFO L226 Difference]: Without dead ends: 4571 [2024-11-12 15:39:47,900 INFO L434 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-12 15:39:47,901 INFO L435 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-12 15:39:47,901 INFO L436 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-12 15:39:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2024-11-12 15:39:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4571. [2024-11-12 15:39:47,971 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-12 15:39:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6661 transitions. [2024-11-12 15:39:47,981 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6661 transitions. Word has length 20 [2024-11-12 15:39:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:47,982 INFO L471 AbstractCegarLoop]: Abstraction has 4571 states and 6661 transitions. [2024-11-12 15:39:47,982 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-12 15:39:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6661 transitions. [2024-11-12 15:39:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 15:39:47,983 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:47,983 INFO L218 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-12 15:39:47,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 15:39:47,983 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-12 15:39:47,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:47,984 INFO L85 PathProgramCache]: Analyzing trace with hash -316632036, now seen corresponding path program 1 times [2024-11-12 15:39:47,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:47,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996185627] [2024-11-12 15:39:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:48,044 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-12 15:39:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996185627] [2024-11-12 15:39:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996185627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:48,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:48,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606280605] [2024-11-12 15:39:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:48,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:48,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:48,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:48,047 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-12 15:39:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:48,149 INFO L93 Difference]: Finished difference Result 4542 states and 6611 transitions. [2024-11-12 15:39:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:39:48,149 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-12 15:39:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:48,158 INFO L225 Difference]: With dead ends: 4542 [2024-11-12 15:39:48,159 INFO L226 Difference]: Without dead ends: 4542 [2024-11-12 15:39:48,159 INFO L434 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-12 15:39:48,160 INFO L435 NwaCegarLoop]: 2821 mSDtfsCounter, 41 mSDsluCounter, 5614 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:48,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 8435 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:39:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4542 states. [2024-11-12 15:39:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4542 to 4536. [2024-11-12 15:39:48,222 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-12 15:39:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6605 transitions. [2024-11-12 15:39:48,230 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6605 transitions. Word has length 22 [2024-11-12 15:39:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:48,230 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 6605 transitions. [2024-11-12 15:39:48,232 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-12 15:39:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6605 transitions. [2024-11-12 15:39:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 15:39:48,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:48,233 INFO L218 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-12 15:39:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 15:39:48,233 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-12 15:39:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -828222326, now seen corresponding path program 1 times [2024-11-12 15:39:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:48,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977154739] [2024-11-12 15:39:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:48,438 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-12 15:39:48,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977154739] [2024-11-12 15:39:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977154739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:48,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:39:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092459457] [2024-11-12 15:39:48,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:48,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:48,442 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-12 15:39:50,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:50,349 INFO L93 Difference]: Finished difference Result 6833 states and 9754 transitions. [2024-11-12 15:39:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:39:50,350 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-12 15:39:50,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:50,361 INFO L225 Difference]: With dead ends: 6833 [2024-11-12 15:39:50,361 INFO L226 Difference]: Without dead ends: 6833 [2024-11-12 15:39:50,361 INFO L434 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-12 15:39:50,362 INFO L435 NwaCegarLoop]: 2286 mSDtfsCounter, 2318 mSDsluCounter, 3649 mSDsCounter, 0 mSdLazyCounter, 2378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:50,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 5935 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2378 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 15:39:50,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6833 states. [2024-11-12 15:39:50,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6833 to 4532. [2024-11-12 15:39:50,428 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-12 15:39:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6597 transitions. [2024-11-12 15:39:50,435 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6597 transitions. Word has length 36 [2024-11-12 15:39:50,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:50,437 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6597 transitions. [2024-11-12 15:39:50,437 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-12 15:39:50,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6597 transitions. [2024-11-12 15:39:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 15:39:50,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:50,438 INFO L218 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-12 15:39:50,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 15:39:50,439 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-12 15:39:50,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:50,439 INFO L85 PathProgramCache]: Analyzing trace with hash 852766398, now seen corresponding path program 1 times [2024-11-12 15:39:50,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:50,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575972455] [2024-11-12 15:39:50,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:50,584 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-12 15:39:50,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:50,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575972455] [2024-11-12 15:39:50,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575972455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:50,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:50,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:50,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776605827] [2024-11-12 15:39:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:50,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:39:50,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:39:50,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:39:50,588 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-12 15:39:50,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:50,656 INFO L93 Difference]: Finished difference Result 4532 states and 6589 transitions. [2024-11-12 15:39:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:39:50,656 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-12 15:39:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:50,665 INFO L225 Difference]: With dead ends: 4532 [2024-11-12 15:39:50,665 INFO L226 Difference]: Without dead ends: 4532 [2024-11-12 15:39:50,665 INFO L434 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-12 15:39:50,666 INFO L435 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-12 15:39:50,666 INFO L436 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-12 15:39:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2024-11-12 15:39:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4532. [2024-11-12 15:39:50,726 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-12 15:39:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 6589 transitions. [2024-11-12 15:39:50,735 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 6589 transitions. Word has length 70 [2024-11-12 15:39:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:50,735 INFO L471 AbstractCegarLoop]: Abstraction has 4532 states and 6589 transitions. [2024-11-12 15:39:50,735 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-12 15:39:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 6589 transitions. [2024-11-12 15:39:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 15:39:50,739 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:50,739 INFO L218 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-12 15:39:50,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 15:39:50,740 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-12 15:39:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1685969162, now seen corresponding path program 1 times [2024-11-12 15:39:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811978302] [2024-11-12 15:39:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:50,900 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-12 15:39:50,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:50,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811978302] [2024-11-12 15:39:50,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811978302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:50,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:50,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:39:50,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173469620] [2024-11-12 15:39:50,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:50,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:39:50,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:50,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:39:50,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:39:50,903 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-12 15:39:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:51,006 INFO L93 Difference]: Finished difference Result 6036 states and 8768 transitions. [2024-11-12 15:39:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:39:51,007 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-12 15:39:51,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:51,020 INFO L225 Difference]: With dead ends: 6036 [2024-11-12 15:39:51,020 INFO L226 Difference]: Without dead ends: 6036 [2024-11-12 15:39:51,020 INFO L434 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-12 15:39:51,021 INFO L435 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-12 15:39:51,021 INFO L436 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-12 15:39:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2024-11-12 15:39:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 5385. [2024-11-12 15:39:51,091 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-12 15:39:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8015 transitions. [2024-11-12 15:39:51,099 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8015 transitions. Word has length 78 [2024-11-12 15:39:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:51,100 INFO L471 AbstractCegarLoop]: Abstraction has 5385 states and 8015 transitions. [2024-11-12 15:39:51,100 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-12 15:39:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8015 transitions. [2024-11-12 15:39:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-12 15:39:51,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:51,120 INFO L218 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-12 15:39:51,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 15:39:51,120 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-12 15:39:51,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:51,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1252654197, now seen corresponding path program 1 times [2024-11-12 15:39:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502289647] [2024-11-12 15:39:51,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:51,601 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-12 15:39:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:51,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502289647] [2024-11-12 15:39:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502289647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:51,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:51,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 15:39:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020493214] [2024-11-12 15:39:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:51,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 15:39:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:51,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 15:39:51,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 15:39:51,603 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-12 15:39:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:53,210 INFO L93 Difference]: Finished difference Result 5301 states and 7873 transitions. [2024-11-12 15:39:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:39:53,211 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-12 15:39:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:53,222 INFO L225 Difference]: With dead ends: 5301 [2024-11-12 15:39:53,223 INFO L226 Difference]: Without dead ends: 5301 [2024-11-12 15:39:53,223 INFO L434 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-12 15:39:53,223 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 5265 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5275 Valid, 3045 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:39:53,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2024-11-12 15:39:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 4759. [2024-11-12 15:39:53,313 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-12 15:39:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4759 states to 4759 states and 6909 transitions. [2024-11-12 15:39:53,320 INFO L78 Accepts]: Start accepts. Automaton has 4759 states and 6909 transitions. Word has length 81 [2024-11-12 15:39:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:53,320 INFO L471 AbstractCegarLoop]: Abstraction has 4759 states and 6909 transitions. [2024-11-12 15:39:53,320 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-12 15:39:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4759 states and 6909 transitions. [2024-11-12 15:39:53,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 15:39:53,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:53,321 INFO L218 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-12 15:39:53,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 15:39:53,322 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-12 15:39:53,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash -420245411, now seen corresponding path program 1 times [2024-11-12 15:39:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173981877] [2024-11-12 15:39:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:53,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:53,559 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-12 15:39:53,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:53,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173981877] [2024-11-12 15:39:53,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173981877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:53,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:53,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:53,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019713018] [2024-11-12 15:39:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:53,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:39:53,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:53,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:39:53,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:39:53,562 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-12 15:39:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:54,993 INFO L93 Difference]: Finished difference Result 4758 states and 6907 transitions. [2024-11-12 15:39:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:39:54,993 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-12 15:39:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:55,003 INFO L225 Difference]: With dead ends: 4758 [2024-11-12 15:39:55,004 INFO L226 Difference]: Without dead ends: 4758 [2024-11-12 15:39:55,005 INFO L434 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-12 15:39:55,006 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 2 mSDsluCounter, 5744 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:55,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8487 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 15:39:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2024-11-12 15:39:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4758. [2024-11-12 15:39:55,063 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-12 15:39:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6907 transitions. [2024-11-12 15:39:55,070 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6907 transitions. Word has length 86 [2024-11-12 15:39:55,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:55,070 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6907 transitions. [2024-11-12 15:39:55,071 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-12 15:39:55,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6907 transitions. [2024-11-12 15:39:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 15:39:55,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:55,074 INFO L218 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-12 15:39:55,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 15:39:55,075 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-12 15:39:55,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash -420245410, now seen corresponding path program 1 times [2024-11-12 15:39:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:55,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674173620] [2024-11-12 15:39:55,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:55,632 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-12 15:39:55,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674173620] [2024-11-12 15:39:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674173620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:55,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:39:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31864672] [2024-11-12 15:39:55,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:39:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:39:55,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:39:55,635 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-12 15:39:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:57,240 INFO L93 Difference]: Finished difference Result 4757 states and 6905 transitions. [2024-11-12 15:39:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:39:57,241 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-12 15:39:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:57,248 INFO L225 Difference]: With dead ends: 4757 [2024-11-12 15:39:57,249 INFO L226 Difference]: Without dead ends: 4757 [2024-11-12 15:39:57,250 INFO L434 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-12 15:39:57,251 INFO L435 NwaCegarLoop]: 2743 mSDtfsCounter, 1 mSDsluCounter, 5718 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:57,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 8461 Invalid, 2516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:39:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2024-11-12 15:39:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 4757. [2024-11-12 15:39:57,301 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-12 15:39:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 6905 transitions. [2024-11-12 15:39:57,308 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 6905 transitions. Word has length 86 [2024-11-12 15:39:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:57,308 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 6905 transitions. [2024-11-12 15:39:57,309 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-12 15:39:57,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 6905 transitions. [2024-11-12 15:39:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 15:39:57,310 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:57,310 INFO L218 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-12 15:39:57,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 15:39:57,310 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-12 15:39:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash -796304604, now seen corresponding path program 1 times [2024-11-12 15:39:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:57,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20534677] [2024-11-12 15:39:57,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:39:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:39:57,575 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-12 15:39:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:39:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20534677] [2024-11-12 15:39:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20534677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:39:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:39:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:39:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362016212] [2024-11-12 15:39:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:39:57,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:39:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:39:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:39:57,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:39:57,580 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-12 15:39:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:39:59,535 INFO L93 Difference]: Finished difference Result 4775 states and 6938 transitions. [2024-11-12 15:39:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 15:39:59,536 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-12 15:39:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:39:59,548 INFO L225 Difference]: With dead ends: 4775 [2024-11-12 15:39:59,548 INFO L226 Difference]: Without dead ends: 4775 [2024-11-12 15:39:59,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 15:39:59,549 INFO L435 NwaCegarLoop]: 2707 mSDtfsCounter, 31 mSDsluCounter, 10436 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13143 SdHoareTripleChecker+Invalid, 3304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:39:59,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13143 Invalid, 3304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 15:39:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-12 15:39:59,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4766. [2024-11-12 15:39:59,631 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-12 15:39:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6928 transitions. [2024-11-12 15:39:59,642 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6928 transitions. Word has length 94 [2024-11-12 15:39:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:39:59,643 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6928 transitions. [2024-11-12 15:39:59,643 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-12 15:39:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6928 transitions. [2024-11-12 15:39:59,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 15:39:59,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:39:59,644 INFO L218 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-12 15:39:59,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 15:39:59,644 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-12 15:39:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:39:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -796304603, now seen corresponding path program 1 times [2024-11-12 15:39:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:39:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283130673] [2024-11-12 15:39:59,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:39:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:39:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:00,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:00,223 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-12 15:40:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283130673] [2024-11-12 15:40:00,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283130673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:40:00,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:40:00,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 15:40:00,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781574600] [2024-11-12 15:40:00,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:40:00,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 15:40:00,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:00,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 15:40:00,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 15:40:00,226 INFO L87 Difference]: Start difference. First operand 4766 states and 6928 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) 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-12 15:40:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:02,001 INFO L93 Difference]: Finished difference Result 4766 states and 6926 transitions. [2024-11-12 15:40:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:40:02,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) 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-12 15:40:02,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:02,010 INFO L225 Difference]: With dead ends: 4766 [2024-11-12 15:40:02,010 INFO L226 Difference]: Without dead ends: 4766 [2024-11-12 15:40:02,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:40:02,011 INFO L435 NwaCegarLoop]: 2714 mSDtfsCounter, 43 mSDsluCounter, 8081 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 10795 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:02,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 10795 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:40:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4766 states. [2024-11-12 15:40:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4766 to 4766. [2024-11-12 15:40:02,066 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-12 15:40:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 6926 transitions. [2024-11-12 15:40:02,074 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 6926 transitions. Word has length 94 [2024-11-12 15:40:02,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:02,074 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 6926 transitions. [2024-11-12 15:40:02,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) 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-12 15:40:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 6926 transitions. [2024-11-12 15:40:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 15:40:02,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:02,076 INFO L218 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-12 15:40:02,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 15:40:02,076 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-12 15:40:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:02,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1398690569, now seen corresponding path program 1 times [2024-11-12 15:40:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622926097] [2024-11-12 15:40:02,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:02,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:02,570 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-12 15:40:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622926097] [2024-11-12 15:40:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622926097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263620778] [2024-11-12 15:40:02,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:40:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:40:02,574 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-12 15:40:02,575 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-12 15:40:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:02,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 15:40:02,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:40:02,907 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-12 15:40:03,055 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 15:40:03,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 15:40:03,092 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-12 15:40:03,202 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-12 15:40:03,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:03,393 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-12 15:40:03,429 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-12 15:40:03,464 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-12 15:40:03,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:40:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263620778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:03,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:40:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-12 15:40:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935650529] [2024-11-12 15:40:03,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:40:03,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:40:03,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:40:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=320, Unknown=6, NotChecked=0, Total=380 [2024-11-12 15:40:03,538 INFO L87 Difference]: Start difference. First operand 4766 states and 6926 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:08,443 INFO L93 Difference]: Finished difference Result 4773 states and 6932 transitions. [2024-11-12 15:40:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:40:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:08,451 INFO L225 Difference]: With dead ends: 4773 [2024-11-12 15:40:08,451 INFO L226 Difference]: Without dead ends: 4773 [2024-11-12 15:40:08,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=506, Unknown=7, NotChecked=0, Total=600 [2024-11-12 15:40:08,452 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2653 mSDsluCounter, 20558 mSDsCounter, 0 mSdLazyCounter, 10460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2671 SdHoareTripleChecker+Valid, 22449 SdHoareTripleChecker+Invalid, 10487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 10460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:08,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2671 Valid, 22449 Invalid, 10487 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 10460 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-12 15:40:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2024-11-12 15:40:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 4770. [2024-11-12 15:40:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 4025 states have (on average 1.7050931677018633) internal successors, (6863), 4740 states have internal predecessors, (6863), 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-12 15:40:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 6919 transitions. [2024-11-12 15:40:08,515 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 6919 transitions. Word has length 95 [2024-11-12 15:40:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 4770 states and 6919 transitions. [2024-11-12 15:40:08,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 6919 transitions. [2024-11-12 15:40:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-12 15:40:08,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:08,517 INFO L218 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-12 15:40:08,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 15:40:08,717 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-12 15:40:08,718 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-12 15:40:08,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:08,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1398690568, now seen corresponding path program 1 times [2024-11-12 15:40:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:08,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705224455] [2024-11-12 15:40:08,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:08,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:09,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:09,586 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-12 15:40:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705224455] [2024-11-12 15:40:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705224455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011868800] [2024-11-12 15:40:09,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:40:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:40:09,589 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-12 15:40:09,591 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-12 15:40:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:09,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 15:40:09,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:40:09,894 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-12 15:40:10,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:40:10,006 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-12 15:40:10,013 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-12 15:40:10,041 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-12 15:40:10,048 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-12 15:40:10,124 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-12 15:40:10,129 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-12 15:40:10,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:10,239 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-12 15:40:10,244 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-12 15:40:10,281 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-12 15:40:10,289 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-12 15:40:10,310 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-12 15:40:10,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:40:10,409 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_816 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_816) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_817 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-12 15:40:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011868800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:10,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:40:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-12 15:40:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161570688] [2024-11-12 15:40:10,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:40:10,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 15:40:10,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 15:40:10,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-12 15:40:10,414 INFO L87 Difference]: Start difference. First operand 4770 states and 6919 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:14,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:14,838 INFO L93 Difference]: Finished difference Result 4772 states and 6930 transitions. [2024-11-12 15:40:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 15:40:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:14,845 INFO L225 Difference]: With dead ends: 4772 [2024-11-12 15:40:14,845 INFO L226 Difference]: Without dead ends: 4772 [2024-11-12 15:40:14,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-12 15:40:14,846 INFO L435 NwaCegarLoop]: 1897 mSDtfsCounter, 2693 mSDsluCounter, 12778 mSDsCounter, 0 mSdLazyCounter, 10053 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 14675 SdHoareTripleChecker+Invalid, 10116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 10053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:14,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 14675 Invalid, 10116 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 10053 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-12 15:40:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-12 15:40:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4760. [2024-11-12 15:40:14,899 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-12 15:40:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 6906 transitions. [2024-11-12 15:40:14,906 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 6906 transitions. Word has length 95 [2024-11-12 15:40:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:14,907 INFO L471 AbstractCegarLoop]: Abstraction has 4760 states and 6906 transitions. [2024-11-12 15:40:14,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 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-12 15:40:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 6906 transitions. [2024-11-12 15:40:14,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 15:40:14,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:14,908 INFO L218 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-12 15:40:14,926 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-12 15:40:15,108 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-12 15:40:15,109 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-12 15:40:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1605417604, now seen corresponding path program 1 times [2024-11-12 15:40:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660212856] [2024-11-12 15:40:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:15,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:15,685 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-12 15:40:15,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:15,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660212856] [2024-11-12 15:40:15,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660212856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:40:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:40:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 15:40:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451692031] [2024-11-12 15:40:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:40:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:40:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:15,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:40:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:40:15,688 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-12 15:40:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:19,208 INFO L93 Difference]: Finished difference Result 4779 states and 6938 transitions. [2024-11-12 15:40:19,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 15:40:19,208 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-12 15:40:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:19,213 INFO L225 Difference]: With dead ends: 4779 [2024-11-12 15:40:19,213 INFO L226 Difference]: Without dead ends: 4779 [2024-11-12 15:40:19,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-12 15:40:19,214 INFO L435 NwaCegarLoop]: 1891 mSDtfsCounter, 2667 mSDsluCounter, 16821 mSDsCounter, 0 mSdLazyCounter, 8733 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 18712 SdHoareTripleChecker+Invalid, 8756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:19,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 18712 Invalid, 8756 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 8733 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-12 15:40:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2024-11-12 15:40:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4775. [2024-11-12 15:40:19,266 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-12 15:40:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6925 transitions. [2024-11-12 15:40:19,273 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6925 transitions. Word has length 97 [2024-11-12 15:40:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6925 transitions. [2024-11-12 15:40:19,274 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-12 15:40:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6925 transitions. [2024-11-12 15:40:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 15:40:19,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:19,275 INFO L218 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-12 15:40:19,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 15:40:19,275 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-12 15:40:19,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1605417603, now seen corresponding path program 1 times [2024-11-12 15:40:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612017964] [2024-11-12 15:40:19,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:19,971 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-12 15:40:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612017964] [2024-11-12 15:40:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612017964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:40:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:40:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 15:40:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541882252] [2024-11-12 15:40:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:40:19,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 15:40:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 15:40:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-12 15:40:19,975 INFO L87 Difference]: Start difference. First operand 4775 states and 6925 transitions. Second operand has 12 states, 11 states have (on average 8.636363636363637) 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-12 15:40:23,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:23,680 INFO L93 Difference]: Finished difference Result 4778 states and 6936 transitions. [2024-11-12 15:40:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 15:40:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.636363636363637) 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-12 15:40:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:23,691 INFO L225 Difference]: With dead ends: 4778 [2024-11-12 15:40:23,691 INFO L226 Difference]: Without dead ends: 4778 [2024-11-12 15:40:23,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-12 15:40:23,693 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2683 mSDsluCounter, 11601 mSDsCounter, 0 mSdLazyCounter, 8416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 13499 SdHoareTripleChecker+Invalid, 8455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:23,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 13499 Invalid, 8455 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 8416 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-12 15:40:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-11-12 15:40:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4775. [2024-11-12 15:40:23,747 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-12 15:40:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 6923 transitions. [2024-11-12 15:40:23,754 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 6923 transitions. Word has length 97 [2024-11-12 15:40:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 4775 states and 6923 transitions. [2024-11-12 15:40:23,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.636363636363637) 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-12 15:40:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 6923 transitions. [2024-11-12 15:40:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 15:40:23,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:23,755 INFO L218 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-12 15:40:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 15:40:23,756 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-12 15:40:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629065, now seen corresponding path program 1 times [2024-11-12 15:40:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289217578] [2024-11-12 15:40:23,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:24,271 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-12 15:40:24,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289217578] [2024-11-12 15:40:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289217578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:24,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540643850] [2024-11-12 15:40:24,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:24,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:40:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:40:24,275 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-12 15:40:24,276 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-12 15:40:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:24,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 15:40:24,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:40:24,591 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-12 15:40:24,700 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-12 15:40:24,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-12 15:40:24,735 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-12 15:40:24,813 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-12 15:40:24,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:24,953 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-12 15:40:25,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:25,040 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-12 15:40:25,053 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-12 15:40:25,083 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-12 15:40:25,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:40:25,161 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1107))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-12 15:40:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540643850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:25,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:40:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-12 15:40:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62507533] [2024-11-12 15:40:25,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:40:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 15:40:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 15:40:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=454, Unknown=22, NotChecked=44, Total=600 [2024-11-12 15:40:25,164 INFO L87 Difference]: Start difference. First operand 4775 states and 6923 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 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-12 15:40:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:30,176 INFO L93 Difference]: Finished difference Result 4777 states and 6934 transitions. [2024-11-12 15:40:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:40:30,177 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 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-12 15:40:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:30,183 INFO L225 Difference]: With dead ends: 4777 [2024-11-12 15:40:30,183 INFO L226 Difference]: Without dead ends: 4777 [2024-11-12 15:40:30,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=629, Unknown=23, NotChecked=52, Total=812 [2024-11-12 15:40:30,184 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2646 mSDsluCounter, 22420 mSDsCounter, 0 mSdLazyCounter, 11341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 24310 SdHoareTripleChecker+Invalid, 11364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 11341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:30,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 24310 Invalid, 11364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 11341 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-12 15:40:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-11-12 15:40:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4774. [2024-11-12 15:40:30,234 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-12 15:40:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 6921 transitions. [2024-11-12 15:40:30,242 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 6921 transitions. Word has length 98 [2024-11-12 15:40:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:30,242 INFO L471 AbstractCegarLoop]: Abstraction has 4774 states and 6921 transitions. [2024-11-12 15:40:30,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 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-12 15:40:30,243 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 6921 transitions. [2024-11-12 15:40:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 15:40:30,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:30,243 INFO L218 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-12 15:40:30,265 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-12 15:40:30,447 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-12 15:40:30,448 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-12 15:40:30,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1382629066, now seen corresponding path program 1 times [2024-11-12 15:40:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072998184] [2024-11-12 15:40:30,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:31,282 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-12 15:40:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072998184] [2024-11-12 15:40:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072998184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223294240] [2024-11-12 15:40:31,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:31,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 15:40:31,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:40:31,285 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-12 15:40:31,288 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-12 15:40:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:31,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 15:40:31,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:40:31,603 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-12 15:40:31,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 15:40:31,707 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 15:40:31,708 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-12 15:40:31,730 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-12 15:40:31,733 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-12 15:40:31,808 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-12 15:40:31,811 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-12 15:40:31,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:31,933 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-12 15:40:31,942 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-12 15:40:32,012 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:40:32,012 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-12 15:40:32,016 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-12 15:40:32,034 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-12 15:40:32,038 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-12 15:40:32,059 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-12 15:40:32,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:40:32,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-12 15:40:32,134 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1264 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-12 15:40:32,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1270) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int)) (v_ArrVal_1271 (Array Int Int)) (v_ArrVal_1270 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1271))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1270) .cse1 v_ArrVal_1264) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1265) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-12 15:40:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223294240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:40:32,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:40:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-12 15:40:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795707095] [2024-11-12 15:40:32,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:40:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 15:40:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 15:40:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-12 15:40:32,185 INFO L87 Difference]: Start difference. First operand 4774 states and 6921 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) 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-12 15:40:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:37,847 INFO L93 Difference]: Finished difference Result 4776 states and 6932 transitions. [2024-11-12 15:40:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 15:40:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) 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-12 15:40:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:37,853 INFO L225 Difference]: With dead ends: 4776 [2024-11-12 15:40:37,853 INFO L226 Difference]: Without dead ends: 4776 [2024-11-12 15:40:37,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-12 15:40:37,854 INFO L435 NwaCegarLoop]: 1896 mSDtfsCounter, 2652 mSDsluCounter, 17998 mSDsCounter, 0 mSdLazyCounter, 13021 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2670 SdHoareTripleChecker+Valid, 19894 SdHoareTripleChecker+Invalid, 13049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:37,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2670 Valid, 19894 Invalid, 13049 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 13021 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-12 15:40:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states. [2024-11-12 15:40:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4758. [2024-11-12 15:40:37,903 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-12 15:40:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4758 states to 4758 states and 6902 transitions. [2024-11-12 15:40:37,910 INFO L78 Accepts]: Start accepts. Automaton has 4758 states and 6902 transitions. Word has length 98 [2024-11-12 15:40:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 4758 states and 6902 transitions. [2024-11-12 15:40:37,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) 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-12 15:40:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4758 states and 6902 transitions. [2024-11-12 15:40:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 15:40:37,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:37,912 INFO L218 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-12 15:40:37,931 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-12 15:40:38,115 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-12 15:40:38,116 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-12 15:40:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1760638795, now seen corresponding path program 1 times [2024-11-12 15:40:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902095656] [2024-11-12 15:40:38,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 15:40:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:40:38,667 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-12 15:40:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 15:40:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902095656] [2024-11-12 15:40:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902095656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:40:38,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:40:38,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 15:40:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797161761] [2024-11-12 15:40:38,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:40:38,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 15:40:38,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 15:40:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 15:40:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-12 15:40:38,669 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-12 15:40:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:40:42,709 INFO L93 Difference]: Finished difference Result 4783 states and 6940 transitions. [2024-11-12 15:40:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 15:40:42,709 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-12 15:40:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:40:42,714 INFO L225 Difference]: With dead ends: 4783 [2024-11-12 15:40:42,714 INFO L226 Difference]: Without dead ends: 4783 [2024-11-12 15:40:42,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-12 15:40:42,715 INFO L435 NwaCegarLoop]: 1890 mSDtfsCounter, 2690 mSDsluCounter, 18687 mSDsCounter, 0 mSdLazyCounter, 9586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 20577 SdHoareTripleChecker+Invalid, 9610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 9586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:40:42,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 20577 Invalid, 9610 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [24 Valid, 9586 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-12 15:40:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4783 states. [2024-11-12 15:40:42,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4783 to 4779. [2024-11-12 15:40:42,772 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-12 15:40:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 6927 transitions. [2024-11-12 15:40:42,780 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 6927 transitions. Word has length 100 [2024-11-12 15:40:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:40:42,780 INFO L471 AbstractCegarLoop]: Abstraction has 4779 states and 6927 transitions. [2024-11-12 15:40:42,780 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-12 15:40:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 6927 transitions. [2024-11-12 15:40:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 15:40:42,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:40:42,781 INFO L218 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-12 15:40:42,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 15:40:42,782 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-12 15:40:42,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:40:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1760638796, now seen corresponding path program 1 times [2024-11-12 15:40:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 15:40:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997610822] [2024-11-12 15:40:42,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:40:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 15:40:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat