./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:13:00,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:13:00,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:13:00,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:13:00,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:13:00,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:13:00,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:13:00,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:13:00,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:13:00,440 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:13:00,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:13:00,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:13:00,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:13:00,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:13:00,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:13:00,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:13:00,443 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:13:00,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:13:00,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:13:00,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:13:00,446 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:13:00,446 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:13:00,446 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:13:00,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:13:00,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:13:00,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:13:00,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:13:00,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:13:00,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:13:00,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:13:00,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:13:00,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:13:00,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:13:00,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:13:00,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:13:00,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:13:00,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:13:00,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:13:00,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:13:00,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:13:00,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:13:00,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:13:00,450 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-22 21:13:00,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:13:00,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:13:00,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:13:00,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:13:00,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:13:00,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-22 21:13:02,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:13:02,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:13:02,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-22 21:13:02,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0f298a7/0c5f55ba92614e98a2841396878d5fad/FLAGe7567222d [2024-11-22 21:13:02,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea0f298a7/0c5f55ba92614e98a2841396878d5fad [2024-11-22 21:13:02,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:13:02,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:13:02,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:13:02,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:13:02,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:13:02,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:13:02" (1/1) ... [2024-11-22 21:13:02,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2d85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:02, skipping insertion in model container [2024-11-22 21:13:02,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:13:02" (1/1) ... [2024-11-22 21:13:02,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:13:02,799 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-22 21:13:02,826 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-22 21:13:02,829 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-22 21:13:02,832 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-22 21:13:02,836 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-22 21:13:02,855 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-22 21:13:02,856 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-22 21:13:02,858 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-22 21:13:02,861 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-22 21:13:02,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:13:02,882 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:13:02,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:13:03,016 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:13:03,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03 WrapperNode [2024-11-22 21:13:03,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:13:03,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:13:03,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:13:03,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:13:03,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,092 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1289 [2024-11-22 21:13:03,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:13:03,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:13:03,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:13:03,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:13:03,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,169 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-22 21:13:03,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:13:03,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:13:03,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:13:03,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:13:03,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (1/1) ... [2024-11-22 21:13:03,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:13:03,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:03,256 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-22 21:13:03,265 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-22 21:13:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 21:13:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 21:13:03,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 21:13:03,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 21:13:03,306 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 21:13:03,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 21:13:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:13:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:13:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:13:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 21:13:03,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:13:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:13:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:13:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 21:13:03,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:13:03,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 21:13:03,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:13:03,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:13:03,503 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:13:03,505 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:13:03,507 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:13:03,545 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:13:03,561 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:13:05,263 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-22 21:13:05,264 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:13:05,305 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:13:05,309 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-22 21:13:05,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:13:05 BoogieIcfgContainer [2024-11-22 21:13:05,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:13:05,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:13:05,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:13:05,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:13:05,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:13:02" (1/3) ... [2024-11-22 21:13:05,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334cf932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:13:05, skipping insertion in model container [2024-11-22 21:13:05,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:13:03" (2/3) ... [2024-11-22 21:13:05,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334cf932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:13:05, skipping insertion in model container [2024-11-22 21:13:05,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:13:05" (3/3) ... [2024-11-22 21:13:05,316 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-11-22 21:13:05,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:13:05,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-22 21:13:05,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:13:05,393 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;@48df6b8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:13:05,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-22 21:13:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 21:13:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 21:13:05,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:05,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 21:13:05,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:05,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:05,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1758832, now seen corresponding path program 1 times [2024-11-22 21:13:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137860050] [2024-11-22 21:13:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:05,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:05,752 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-22 21:13:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:05,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137860050] [2024-11-22 21:13:05,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137860050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098976128] [2024-11-22 21:13:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:05,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:05,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:05,785 INFO L87 Difference]: Start difference. First operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-22 21:13:06,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:06,602 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-22 21:13:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:06,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-22 21:13:06,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:06,619 INFO L225 Difference]: With dead ends: 1349 [2024-11-22 21:13:06,620 INFO L226 Difference]: Without dead ends: 1345 [2024-11-22 21:13:06,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:06,623 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:06,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2648 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 21:13:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-22 21:13:06,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-22 21:13:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 844 states have (on average 1.8815165876777251) internal successors, (1588), 1255 states have internal predecessors, (1588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 21:13:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-22 21:13:06,697 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-22 21:13:06,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:06,698 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-22 21:13:06,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-22 21:13:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-22 21:13:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 21:13:06,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:06,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 21:13:06,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:13:06,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:06,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-22 21:13:06,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:06,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306662078] [2024-11-22 21:13:06,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:06,746 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-22 21:13:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306662078] [2024-11-22 21:13:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306662078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:06,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:06,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:13:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66360064] [2024-11-22 21:13:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:06,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:06,749 INFO L87 Difference]: Start difference. First operand 1260 states and 1594 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-22 21:13:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:07,211 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-22 21:13:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:07,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 21:13:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:07,217 INFO L225 Difference]: With dead ends: 1257 [2024-11-22 21:13:07,217 INFO L226 Difference]: Without dead ends: 1257 [2024-11-22 21:13:07,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:07,219 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:07,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 21:13:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-22 21:13:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-22 21:13:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 852 states have (on average 1.8544600938967135) internal successors, (1580), 1252 states have internal predecessors, (1580), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 21:13:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-22 21:13:07,239 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-22 21:13:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:07,239 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-22 21:13:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-22 21:13:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-22 21:13:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 21:13:07,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:07,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 21:13:07,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:13:07,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-22 21:13:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140398024] [2024-11-22 21:13:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:07,296 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-22 21:13:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140398024] [2024-11-22 21:13:07,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140398024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:07,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:07,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:13:07,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198438397] [2024-11-22 21:13:07,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:07,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:07,298 INFO L87 Difference]: Start difference. First operand 1257 states and 1586 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-22 21:13:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:07,950 INFO L93 Difference]: Finished difference Result 2016 states and 2490 transitions. [2024-11-22 21:13:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:07,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-22 21:13:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:07,957 INFO L225 Difference]: With dead ends: 2016 [2024-11-22 21:13:07,957 INFO L226 Difference]: Without dead ends: 2016 [2024-11-22 21:13:07,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:07,958 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 903 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:07,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1693 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:13:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-22 21:13:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1754. [2024-11-22 21:13:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1350 states have (on average 1.8288888888888888) internal successors, (2469), 1747 states have internal predecessors, (2469), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2479 transitions. [2024-11-22 21:13:08,025 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2479 transitions. Word has length 4 [2024-11-22 21:13:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:08,025 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2479 transitions. [2024-11-22 21:13:08,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-22 21:13:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2479 transitions. [2024-11-22 21:13:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 21:13:08,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:08,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:08,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:13:08,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:08,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-22 21:13:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600479534] [2024-11-22 21:13:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:08,084 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-22 21:13:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600479534] [2024-11-22 21:13:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600479534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:13:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776460559] [2024-11-22 21:13:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:08,087 INFO L87 Difference]: Start difference. First operand 1754 states and 2479 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-22 21:13:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:08,595 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2024-11-22 21:13:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:08,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 21:13:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:08,601 INFO L225 Difference]: With dead ends: 1792 [2024-11-22 21:13:08,601 INFO L226 Difference]: Without dead ends: 1792 [2024-11-22 21:13:08,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:08,603 INFO L432 NwaCegarLoop]: 1122 mSDtfsCounter, 1071 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:08,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1418 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:13:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-22 21:13:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1707. [2024-11-22 21:13:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1350 states have (on average 1.7762962962962963) internal successors, (2398), 1700 states have internal predecessors, (2398), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2408 transitions. [2024-11-22 21:13:08,633 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2408 transitions. Word has length 9 [2024-11-22 21:13:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:08,634 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2408 transitions. [2024-11-22 21:13:08,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-22 21:13:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2408 transitions. [2024-11-22 21:13:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 21:13:08,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:08,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:08,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:13:08,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:08,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-22 21:13:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:08,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342364171] [2024-11-22 21:13:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:08,717 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-22 21:13:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342364171] [2024-11-22 21:13:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342364171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:13:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173529245] [2024-11-22 21:13:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:08,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:08,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:08,723 INFO L87 Difference]: Start difference. First operand 1707 states and 2408 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-22 21:13:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:09,302 INFO L93 Difference]: Finished difference Result 2000 states and 2752 transitions. [2024-11-22 21:13:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-22 21:13:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:09,312 INFO L225 Difference]: With dead ends: 2000 [2024-11-22 21:13:09,312 INFO L226 Difference]: Without dead ends: 2000 [2024-11-22 21:13:09,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:09,314 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 863 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:09,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1666 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:13:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-22 21:13:09,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1682. [2024-11-22 21:13:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1350 states have (on average 1.74) internal successors, (2349), 1675 states have internal predecessors, (2349), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2024-11-22 21:13:09,346 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 9 [2024-11-22 21:13:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:09,347 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2024-11-22 21:13:09,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-22 21:13:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2024-11-22 21:13:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 21:13:09,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:09,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:09,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:13:09,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -186143240, now seen corresponding path program 1 times [2024-11-22 21:13:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400755683] [2024-11-22 21:13:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:09,395 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-22 21:13:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400755683] [2024-11-22 21:13:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400755683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:09,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450722510] [2024-11-22 21:13:09,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:09,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:09,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:09,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:09,398 INFO L87 Difference]: Start difference. First operand 1682 states and 2359 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-22 21:13:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:09,871 INFO L93 Difference]: Finished difference Result 1806 states and 2518 transitions. [2024-11-22 21:13:09,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:09,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-22 21:13:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:09,876 INFO L225 Difference]: With dead ends: 1806 [2024-11-22 21:13:09,877 INFO L226 Difference]: Without dead ends: 1806 [2024-11-22 21:13:09,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:09,877 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1286 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:09,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1400 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 21:13:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-22 21:13:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1659. [2024-11-22 21:13:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1350 states have (on average 1.6888888888888889) internal successors, (2280), 1652 states have internal predecessors, (2280), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2290 transitions. [2024-11-22 21:13:09,902 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2290 transitions. Word has length 14 [2024-11-22 21:13:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:09,902 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2290 transitions. [2024-11-22 21:13:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-22 21:13:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2290 transitions. [2024-11-22 21:13:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 21:13:09,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:09,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:09,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:13:09,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -186143239, now seen corresponding path program 1 times [2024-11-22 21:13:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849736456] [2024-11-22 21:13:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:10,055 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-22 21:13:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849736456] [2024-11-22 21:13:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849736456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736052618] [2024-11-22 21:13:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:10,058 INFO L87 Difference]: Start difference. First operand 1659 states and 2290 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-22 21:13:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:11,001 INFO L93 Difference]: Finished difference Result 2160 states and 2773 transitions. [2024-11-22 21:13:11,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:11,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-22 21:13:11,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:11,007 INFO L225 Difference]: With dead ends: 2160 [2024-11-22 21:13:11,008 INFO L226 Difference]: Without dead ends: 2160 [2024-11-22 21:13:11,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:11,008 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 1277 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:11,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2252 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 21:13:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-22 21:13:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1755. [2024-11-22 21:13:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1446 states have (on average 1.669432918395574) internal successors, (2414), 1748 states have internal predecessors, (2414), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2424 transitions. [2024-11-22 21:13:11,035 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2424 transitions. Word has length 14 [2024-11-22 21:13:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:11,035 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2424 transitions. [2024-11-22 21:13:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-22 21:13:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2424 transitions. [2024-11-22 21:13:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 21:13:11,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:11,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:11,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:13:11,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:11,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1505170837, now seen corresponding path program 1 times [2024-11-22 21:13:11,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:11,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907169861] [2024-11-22 21:13:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:11,072 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-22 21:13:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907169861] [2024-11-22 21:13:11,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907169861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:11,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:11,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:11,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136717339] [2024-11-22 21:13:11,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:11,074 INFO L87 Difference]: Start difference. First operand 1755 states and 2424 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-22 21:13:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:11,123 INFO L93 Difference]: Finished difference Result 1427 states and 1907 transitions. [2024-11-22 21:13:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:13:11,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-22 21:13:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:11,127 INFO L225 Difference]: With dead ends: 1427 [2024-11-22 21:13:11,127 INFO L226 Difference]: Without dead ends: 1427 [2024-11-22 21:13:11,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:11,128 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 45 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:11,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2809 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-22 21:13:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-22 21:13:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1137 states have (on average 1.6684256816182939) internal successors, (1897), 1420 states have internal predecessors, (1897), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1907 transitions. [2024-11-22 21:13:11,148 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1907 transitions. Word has length 16 [2024-11-22 21:13:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1907 transitions. [2024-11-22 21:13:11,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-22 21:13:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1907 transitions. [2024-11-22 21:13:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 21:13:11,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:11,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:11,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:13:11,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:11,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:11,150 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-22 21:13:11,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:11,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765845691] [2024-11-22 21:13:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:11,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:11,191 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-22 21:13:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765845691] [2024-11-22 21:13:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765845691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063509091] [2024-11-22 21:13:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:11,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:11,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:11,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:11,193 INFO L87 Difference]: Start difference. First operand 1427 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-22 21:13:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:11,777 INFO L93 Difference]: Finished difference Result 1541 states and 2015 transitions. [2024-11-22 21:13:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-22 21:13:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:11,781 INFO L225 Difference]: With dead ends: 1541 [2024-11-22 21:13:11,781 INFO L226 Difference]: Without dead ends: 1541 [2024-11-22 21:13:11,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:11,782 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 1182 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:11,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1653 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:13:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-22 21:13:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1404. [2024-11-22 21:13:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1137 states have (on average 1.6279683377308707) internal successors, (1851), 1397 states have internal predecessors, (1851), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1861 transitions. [2024-11-22 21:13:11,799 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1861 transitions. Word has length 19 [2024-11-22 21:13:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1861 transitions. [2024-11-22 21:13:11,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-22 21:13:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1861 transitions. [2024-11-22 21:13:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 21:13:11,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:11,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:11,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:13:11,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:11,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash -179577125, now seen corresponding path program 1 times [2024-11-22 21:13:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:11,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325947504] [2024-11-22 21:13:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:11,869 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-22 21:13:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325947504] [2024-11-22 21:13:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325947504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212212380] [2024-11-22 21:13:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:11,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:11,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:11,871 INFO L87 Difference]: Start difference. First operand 1404 states and 1861 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-22 21:13:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:11,893 INFO L93 Difference]: Finished difference Result 1266 states and 1655 transitions. [2024-11-22 21:13:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-22 21:13:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:11,896 INFO L225 Difference]: With dead ends: 1266 [2024-11-22 21:13:11,900 INFO L226 Difference]: Without dead ends: 1266 [2024-11-22 21:13:11,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:11,901 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 61 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1603 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-22 21:13:11,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1603 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-22 21:13:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-22 21:13:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1011 states have (on average 1.6271018793273986) internal successors, (1645), 1259 states have internal predecessors, (1645), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1655 transitions. [2024-11-22 21:13:11,920 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1655 transitions. Word has length 19 [2024-11-22 21:13:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1655 transitions. [2024-11-22 21:13:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-22 21:13:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1655 transitions. [2024-11-22 21:13:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 21:13:11,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:11,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:11,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:13:11,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:11,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -774768265, now seen corresponding path program 1 times [2024-11-22 21:13:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219203763] [2024-11-22 21:13:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:11,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:11,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-22 21:13:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219203763] [2024-11-22 21:13:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219203763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:11,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:11,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:11,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063922955] [2024-11-22 21:13:11,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:11,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:11,973 INFO L87 Difference]: Start difference. First operand 1266 states and 1655 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-22 21:13:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:12,018 INFO L93 Difference]: Finished difference Result 1237 states and 1605 transitions. [2024-11-22 21:13:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-22 21:13:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:12,022 INFO L225 Difference]: With dead ends: 1237 [2024-11-22 21:13:12,022 INFO L226 Difference]: Without dead ends: 1237 [2024-11-22 21:13:12,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:12,023 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 41 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:12,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2351 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-22 21:13:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1231. [2024-11-22 21:13:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 983 states have (on average 1.6164801627670398) internal successors, (1589), 1224 states have internal predecessors, (1589), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1599 transitions. [2024-11-22 21:13:12,039 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1599 transitions. Word has length 21 [2024-11-22 21:13:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1599 transitions. [2024-11-22 21:13:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-22 21:13:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1599 transitions. [2024-11-22 21:13:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 21:13:12,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:12,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:12,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:13:12,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:12,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash -441307835, now seen corresponding path program 1 times [2024-11-22 21:13:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:12,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572937650] [2024-11-22 21:13:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:12,227 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-22 21:13:12,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572937650] [2024-11-22 21:13:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572937650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181463246] [2024-11-22 21:13:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:12,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:12,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:12,228 INFO L87 Difference]: Start difference. First operand 1231 states and 1599 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-22 21:13:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:12,933 INFO L93 Difference]: Finished difference Result 1813 states and 2395 transitions. [2024-11-22 21:13:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:13:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-22 21:13:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:12,939 INFO L225 Difference]: With dead ends: 1813 [2024-11-22 21:13:12,940 INFO L226 Difference]: Without dead ends: 1813 [2024-11-22 21:13:12,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:12,940 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 658 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:12,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1905 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 21:13:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-22 21:13:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1227. [2024-11-22 21:13:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 983 states have (on average 1.6083418107833163) internal successors, (1581), 1220 states have internal predecessors, (1581), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1591 transitions. [2024-11-22 21:13:12,957 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1591 transitions. Word has length 35 [2024-11-22 21:13:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:12,958 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1591 transitions. [2024-11-22 21:13:12,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-22 21:13:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1591 transitions. [2024-11-22 21:13:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 21:13:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:12,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:13:12,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1141586281, now seen corresponding path program 1 times [2024-11-22 21:13:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342918104] [2024-11-22 21:13:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:13,057 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-22 21:13:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342918104] [2024-11-22 21:13:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342918104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149762693] [2024-11-22 21:13:13,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:13,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:13,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:13,060 INFO L87 Difference]: Start difference. First operand 1227 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-22 21:13:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:13,097 INFO L93 Difference]: Finished difference Result 1209 states and 1561 transitions. [2024-11-22 21:13:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:13:13,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-22 21:13:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:13,101 INFO L225 Difference]: With dead ends: 1209 [2024-11-22 21:13:13,101 INFO L226 Difference]: Without dead ends: 1209 [2024-11-22 21:13:13,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:13,102 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 27 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2327 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-22 21:13:13,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2327 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:13,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-22 21:13:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-22 21:13:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.6072538860103627) internal successors, (1551), 1202 states have internal predecessors, (1551), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1561 transitions. [2024-11-22 21:13:13,117 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1561 transitions. Word has length 62 [2024-11-22 21:13:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:13,117 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1561 transitions. [2024-11-22 21:13:13,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-22 21:13:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1561 transitions. [2024-11-22 21:13:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 21:13:13,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:13,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:13:13,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash 116988697, now seen corresponding path program 1 times [2024-11-22 21:13:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927054192] [2024-11-22 21:13:13,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:13,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:13,227 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-22 21:13:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:13,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927054192] [2024-11-22 21:13:13,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927054192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:13,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:13,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:13,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082298753] [2024-11-22 21:13:13,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:13,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:13:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:13,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:13:13,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:13:13,230 INFO L87 Difference]: Start difference. First operand 1209 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-22 21:13:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:13,293 INFO L93 Difference]: Finished difference Result 1209 states and 1553 transitions. [2024-11-22 21:13:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:13:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2024-11-22 21:13:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:13,297 INFO L225 Difference]: With dead ends: 1209 [2024-11-22 21:13:13,297 INFO L226 Difference]: Without dead ends: 1209 [2024-11-22 21:13:13,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:13,298 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 21 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2321 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-22 21:13:13,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2321 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-22 21:13:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-22 21:13:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.5989637305699482) internal successors, (1543), 1202 states have internal predecessors, (1543), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1553 transitions. [2024-11-22 21:13:13,312 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1553 transitions. Word has length 69 [2024-11-22 21:13:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1553 transitions. [2024-11-22 21:13:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-22 21:13:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1553 transitions. [2024-11-22 21:13:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 21:13:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:13,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:13,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:13:13,313 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1547714973, now seen corresponding path program 1 times [2024-11-22 21:13:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982226940] [2024-11-22 21:13:13,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:13,390 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-22 21:13:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982226940] [2024-11-22 21:13:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982226940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:13:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818200131] [2024-11-22 21:13:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:13,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:13:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:13:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:13,392 INFO L87 Difference]: Start difference. First operand 1209 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-22 21:13:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:13,434 INFO L93 Difference]: Finished difference Result 1474 states and 1856 transitions. [2024-11-22 21:13:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:13:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-22 21:13:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:13,438 INFO L225 Difference]: With dead ends: 1474 [2024-11-22 21:13:13,438 INFO L226 Difference]: Without dead ends: 1474 [2024-11-22 21:13:13,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:13:13,438 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 201 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:13,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1559 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:13:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-22 21:13:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2024-11-22 21:13:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1217 states have (on average 1.513557929334429) internal successors, (1842), 1454 states have internal predecessors, (1842), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1852 transitions. [2024-11-22 21:13:13,453 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1852 transitions. Word has length 70 [2024-11-22 21:13:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:13,454 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1852 transitions. [2024-11-22 21:13:13,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-22 21:13:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1852 transitions. [2024-11-22 21:13:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-22 21:13:13,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:13,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:13,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:13:13,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 616886410, now seen corresponding path program 1 times [2024-11-22 21:13:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:13,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241093626] [2024-11-22 21:13:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:13,712 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-22 21:13:13,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241093626] [2024-11-22 21:13:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241093626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:13,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:13,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 21:13:13,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619249267] [2024-11-22 21:13:13,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:13,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:13:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:13:13,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:13:13,714 INFO L87 Difference]: Start difference. First operand 1461 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-22 21:13:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:13,825 INFO L93 Difference]: Finished difference Result 2081 states and 2585 transitions. [2024-11-22 21:13:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:13:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2024-11-22 21:13:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:13,831 INFO L225 Difference]: With dead ends: 2081 [2024-11-22 21:13:13,831 INFO L226 Difference]: Without dead ends: 2078 [2024-11-22 21:13:13,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:13:13,832 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 727 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:13,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3773 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:13:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-22 21:13:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1362. [2024-11-22 21:13:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1118 states have (on average 1.5330948121645795) internal successors, (1714), 1355 states have internal predecessors, (1714), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1724 transitions. [2024-11-22 21:13:13,850 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1724 transitions. Word has length 76 [2024-11-22 21:13:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:13,850 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1724 transitions. [2024-11-22 21:13:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-22 21:13:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1724 transitions. [2024-11-22 21:13:13,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 21:13:13,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:13,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:13:13,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:13,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:13,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414216, now seen corresponding path program 1 times [2024-11-22 21:13:13,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:13,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318260563] [2024-11-22 21:13:13,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:13,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:14,116 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-22 21:13:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318260563] [2024-11-22 21:13:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318260563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790298110] [2024-11-22 21:13:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:13:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:13:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:14,119 INFO L87 Difference]: Start difference. First operand 1362 states and 1724 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:13:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:14,590 INFO L93 Difference]: Finished difference Result 1361 states and 1722 transitions. [2024-11-22 21:13:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:13:14,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-22 21:13:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:14,595 INFO L225 Difference]: With dead ends: 1361 [2024-11-22 21:13:14,595 INFO L226 Difference]: Without dead ends: 1361 [2024-11-22 21:13:14,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:13:14,596 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 2 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:14,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2327 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 21:13:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-22 21:13:14,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2024-11-22 21:13:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1118 states have (on average 1.5313059033989267) internal successors, (1712), 1354 states have internal predecessors, (1712), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1722 transitions. [2024-11-22 21:13:14,609 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1722 transitions. Word has length 85 [2024-11-22 21:13:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:14,610 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1722 transitions. [2024-11-22 21:13:14,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:13:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1722 transitions. [2024-11-22 21:13:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-22 21:13:14,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:14,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 21:13:14,611 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414215, now seen corresponding path program 1 times [2024-11-22 21:13:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296652581] [2024-11-22 21:13:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:15,000 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-22 21:13:15,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:15,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296652581] [2024-11-22 21:13:15,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296652581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:15,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:13:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093042835] [2024-11-22 21:13:15,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:15,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:13:15,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:13:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:13:15,002 INFO L87 Difference]: Start difference. First operand 1361 states and 1722 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:13:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:15,547 INFO L93 Difference]: Finished difference Result 1360 states and 1720 transitions. [2024-11-22 21:13:15,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:13:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-22 21:13:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:15,550 INFO L225 Difference]: With dead ends: 1360 [2024-11-22 21:13:15,551 INFO L226 Difference]: Without dead ends: 1360 [2024-11-22 21:13:15,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:13:15,551 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:15,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2253 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:13:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-22 21:13:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2024-11-22 21:13:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1116 states have (on average 1.532258064516129) internal successors, (1710), 1353 states have internal predecessors, (1710), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1720 transitions. [2024-11-22 21:13:15,566 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1720 transitions. Word has length 85 [2024-11-22 21:13:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:15,566 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1720 transitions. [2024-11-22 21:13:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-22 21:13:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1720 transitions. [2024-11-22 21:13:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 21:13:15,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:15,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:15,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 21:13:15,567 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:15,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 286448127, now seen corresponding path program 1 times [2024-11-22 21:13:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:15,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377687804] [2024-11-22 21:13:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:15,752 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-22 21:13:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377687804] [2024-11-22 21:13:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377687804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:13:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054871171] [2024-11-22 21:13:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:13:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:15,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:13:15,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:13:15,754 INFO L87 Difference]: Start difference. First operand 1360 states and 1720 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-22 21:13:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:16,347 INFO L93 Difference]: Finished difference Result 1378 states and 1746 transitions. [2024-11-22 21:13:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:13:16,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-22 21:13:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:16,352 INFO L225 Difference]: With dead ends: 1378 [2024-11-22 21:13:16,352 INFO L226 Difference]: Without dead ends: 1378 [2024-11-22 21:13:16,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:13:16,353 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 6 mSDsluCounter, 2849 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3636 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:16,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3636 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:13:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-22 21:13:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1369. [2024-11-22 21:13:16,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5311387900355873) internal successors, (1721), 1360 states have internal predecessors, (1721), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-22 21:13:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1736 transitions. [2024-11-22 21:13:16,369 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1736 transitions. Word has length 93 [2024-11-22 21:13:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:16,369 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1736 transitions. [2024-11-22 21:13:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-22 21:13:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1736 transitions. [2024-11-22 21:13:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 21:13:16,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:16,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:16,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:13:16,370 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash 286448128, now seen corresponding path program 1 times [2024-11-22 21:13:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494695827] [2024-11-22 21:13:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:16,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:16,778 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-22 21:13:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494695827] [2024-11-22 21:13:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494695827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:16,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:13:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906202550] [2024-11-22 21:13:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:16,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:13:16,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:13:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:13:16,780 INFO L87 Difference]: Start difference. First operand 1369 states and 1736 transitions. Second operand has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-22 21:13:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:17,384 INFO L93 Difference]: Finished difference Result 1369 states and 1734 transitions. [2024-11-22 21:13:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:13:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-22 21:13:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:17,387 INFO L225 Difference]: With dead ends: 1369 [2024-11-22 21:13:17,387 INFO L226 Difference]: Without dead ends: 1369 [2024-11-22 21:13:17,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:13:17,388 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 1 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:17,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2924 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:13:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-22 21:13:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-22 21:13:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5293594306049823) internal successors, (1719), 1360 states have internal predecessors, (1719), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-22 21:13:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1734 transitions. [2024-11-22 21:13:17,414 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1734 transitions. Word has length 93 [2024-11-22 21:13:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:17,414 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1734 transitions. [2024-11-22 21:13:17,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-22 21:13:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1734 transitions. [2024-11-22 21:13:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 21:13:17,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:17,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 21:13:17,415 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 894772636, now seen corresponding path program 1 times [2024-11-22 21:13:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682650164] [2024-11-22 21:13:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:17,805 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-22 21:13:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682650164] [2024-11-22 21:13:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682650164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533057004] [2024-11-22 21:13:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:17,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:17,811 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-22 21:13:17,816 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-22 21:13:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:17,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 21:13:17,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:18,019 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-22 21:13:18,140 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:13:18,141 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-22 21:13:18,174 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-22 21:13:18,249 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-22 21:13:18,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:18,404 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-22 21:13:18,437 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-22 21:13:18,463 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-22 21:13:18,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:18,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:13:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533057004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:18,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-22 21:13:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739866815] [2024-11-22 21:13:18,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 21:13:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 21:13:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-22 21:13:18,502 INFO L87 Difference]: Start difference. First operand 1369 states and 1734 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-22 21:13:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:20,424 INFO L93 Difference]: Finished difference Result 1376 states and 1740 transitions. [2024-11-22 21:13:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:13:20,425 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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 94 [2024-11-22 21:13:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:20,428 INFO L225 Difference]: With dead ends: 1376 [2024-11-22 21:13:20,429 INFO L226 Difference]: Without dead ends: 1376 [2024-11-22 21:13:20,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-22 21:13:20,430 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 707 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 3657 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 5865 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:20,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 5865 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3657 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:13:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-22 21:13:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-22 21:13:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1128 states have (on average 1.5265957446808511) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1734 transitions. [2024-11-22 21:13:20,447 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1734 transitions. Word has length 94 [2024-11-22 21:13:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:20,447 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1734 transitions. [2024-11-22 21:13:20,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-22 21:13:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1734 transitions. [2024-11-22 21:13:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 21:13:20,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:20,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:20,458 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-22 21:13:20,650 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,SelfDestructingSolverStorable20 [2024-11-22 21:13:20,651 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 894772637, now seen corresponding path program 1 times [2024-11-22 21:13:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040644539] [2024-11-22 21:13:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:20,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:21,216 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-22 21:13:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040644539] [2024-11-22 21:13:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040644539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521476018] [2024-11-22 21:13:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:21,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:21,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:21,220 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-22 21:13:21,222 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-22 21:13:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:21,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 21:13:21,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:21,395 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-22 21:13:21,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:13:21,488 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-22 21:13:21,495 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-22 21:13:21,515 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-22 21:13:21,518 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-22 21:13:21,581 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-22 21:13:21,585 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-22 21:13:21,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:21,668 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-22 21:13:21,673 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-22 21:13:21,709 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-22 21:13:21,714 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-22 21:13:21,728 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-22 21:13:21,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:21,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_763) |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~mem54#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_763 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 21:13:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521476018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:21,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-22 21:13:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855065248] [2024-11-22 21:13:21,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:21,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 21:13:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:21,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 21:13:21,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2024-11-22 21:13:21,811 INFO L87 Difference]: Start difference. First operand 1373 states and 1734 transitions. Second operand has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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-22 21:13:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:23,794 INFO L93 Difference]: Finished difference Result 1375 states and 1738 transitions. [2024-11-22 21:13:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:13:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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 94 [2024-11-22 21:13:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:23,798 INFO L225 Difference]: With dead ends: 1375 [2024-11-22 21:13:23,798 INFO L226 Difference]: Without dead ends: 1375 [2024-11-22 21:13:23,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-22 21:13:23,802 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 702 mSDsluCounter, 3728 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 4231 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:23,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 4231 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 21:13:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-22 21:13:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1363. [2024-11-22 21:13:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1120 states have (on average 1.5276785714285714) internal successors, (1711), 1355 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1721 transitions. [2024-11-22 21:13:23,834 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1721 transitions. Word has length 94 [2024-11-22 21:13:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:23,835 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1721 transitions. [2024-11-22 21:13:23,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.866666666666667) internal successors, (148), 18 states have internal predecessors, (148), 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-22 21:13:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1721 transitions. [2024-11-22 21:13:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 21:13:23,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:23,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:23,854 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-22 21:13:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 21:13:24,037 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash -523230140, now seen corresponding path program 1 times [2024-11-22 21:13:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051427250] [2024-11-22 21:13:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:13:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:24,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051427250] [2024-11-22 21:13:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051427250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 21:13:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091923700] [2024-11-22 21:13:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:13:24,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:13:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:13:24,389 INFO L87 Difference]: Start difference. First operand 1363 states and 1721 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-22 21:13:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:25,436 INFO L93 Difference]: Finished difference Result 1382 states and 1746 transitions. [2024-11-22 21:13:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:13:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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 96 [2024-11-22 21:13:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:25,440 INFO L225 Difference]: With dead ends: 1382 [2024-11-22 21:13:25,440 INFO L226 Difference]: Without dead ends: 1382 [2024-11-22 21:13:25,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:13:25,441 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 737 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:25,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3891 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 21:13:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-22 21:13:25,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2024-11-22 21:13:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5238095238095237) internal successors, (1728), 1368 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1740 transitions. [2024-11-22 21:13:25,459 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1740 transitions. Word has length 96 [2024-11-22 21:13:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1740 transitions. [2024-11-22 21:13:25,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 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-22 21:13:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1740 transitions. [2024-11-22 21:13:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 21:13:25,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:25,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:25,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 21:13:25,461 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -523230139, now seen corresponding path program 1 times [2024-11-22 21:13:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293693123] [2024-11-22 21:13:25,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:26,081 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-22 21:13:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:26,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293693123] [2024-11-22 21:13:26,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293693123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:26,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:26,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:13:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290738105] [2024-11-22 21:13:26,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:26,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:13:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:13:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:13:26,086 INFO L87 Difference]: Start difference. First operand 1378 states and 1740 transitions. Second operand has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-22 21:13:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:27,874 INFO L93 Difference]: Finished difference Result 1381 states and 1744 transitions. [2024-11-22 21:13:27,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:13:27,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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 96 [2024-11-22 21:13:27,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:27,878 INFO L225 Difference]: With dead ends: 1381 [2024-11-22 21:13:27,878 INFO L226 Difference]: Without dead ends: 1381 [2024-11-22 21:13:27,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:13:27,879 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 713 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 3324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 3822 SdHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:27,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 3822 Invalid, 3335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3324 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 21:13:27,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-22 21:13:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-22 21:13:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5220458553791887) internal successors, (1726), 1368 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1738 transitions. [2024-11-22 21:13:27,896 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1738 transitions. Word has length 96 [2024-11-22 21:13:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:27,897 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1738 transitions. [2024-11-22 21:13:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.4) internal successors, (94), 11 states have internal predecessors, (94), 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-22 21:13:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1738 transitions. [2024-11-22 21:13:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 21:13:27,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:27,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:27,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 21:13:27,898 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:27,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1605195655, now seen corresponding path program 1 times [2024-11-22 21:13:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:27,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992996152] [2024-11-22 21:13:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:28,331 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-22 21:13:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992996152] [2024-11-22 21:13:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992996152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13919809] [2024-11-22 21:13:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:28,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:28,334 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-22 21:13:28,336 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-22 21:13:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:28,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 21:13:28,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:28,583 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-22 21:13:28,664 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:13:28,664 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-22 21:13:28,686 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-22 21:13:28,750 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-22 21:13:28,860 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:28,860 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-22 21:13:28,924 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:28,925 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-22 21:13:28,936 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-22 21:13:28,960 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-22 21:13:28,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:28,968 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:13:28,972 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 21:13:28,990 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1044 (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~mem54#1.base| v_ArrVal_1047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1044)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13919809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:28,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-22 21:13:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332140499] [2024-11-22 21:13:28,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:28,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:13:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:28,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:13:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=395, Unknown=3, NotChecked=126, Total=600 [2024-11-22 21:13:28,993 INFO L87 Difference]: Start difference. First operand 1378 states and 1738 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-22 21:13:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:31,226 INFO L93 Difference]: Finished difference Result 1380 states and 1742 transitions. [2024-11-22 21:13:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:13:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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 97 [2024-11-22 21:13:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:31,229 INFO L225 Difference]: With dead ends: 1380 [2024-11-22 21:13:31,229 INFO L226 Difference]: Without dead ends: 1380 [2024-11-22 21:13:31,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=512, Unknown=3, NotChecked=144, Total=756 [2024-11-22 21:13:31,230 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 692 mSDsluCounter, 6794 mSDsCounter, 0 mSdLazyCounter, 4630 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 7293 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 4630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:31,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 7293 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 4630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:13:31,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-22 21:13:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-22 21:13:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1134 states have (on average 1.5202821869488536) internal successors, (1724), 1367 states have internal predecessors, (1724), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1736 transitions. [2024-11-22 21:13:31,242 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1736 transitions. Word has length 97 [2024-11-22 21:13:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:31,242 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1736 transitions. [2024-11-22 21:13:31,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-22 21:13:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1736 transitions. [2024-11-22 21:13:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 21:13:31,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:31,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:31,252 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-22 21:13:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:31,448 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:31,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1605195656, now seen corresponding path program 1 times [2024-11-22 21:13:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116135768] [2024-11-22 21:13:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:32,007 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-22 21:13:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116135768] [2024-11-22 21:13:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116135768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286701268] [2024-11-22 21:13:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:32,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:32,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:32,010 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-22 21:13:32,011 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-22 21:13:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:32,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 21:13:32,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:32,204 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-22 21:13:32,283 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-22 21:13:32,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:13:32,292 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-22 21:13:32,334 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-22 21:13:32,338 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-22 21:13:32,398 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-22 21:13:32,402 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-22 21:13:32,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:32,489 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-22 21:13:32,498 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-22 21:13:32,614 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:32,614 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-22 21:13:32,621 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-22 21:13:32,644 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-22 21:13:32,647 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-22 21:13:32,675 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-22 21:13:32,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:32,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1199 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1200) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 21:13:32,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1206) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1200 (Array Int Int)) (v_ArrVal_1199 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1205))) (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~mem54#1.base| v_ArrVal_1206) .cse1 v_ArrVal_1199) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1200) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 21:13:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286701268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:32,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:32,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-22 21:13:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736251836] [2024-11-22 21:13:32,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:32,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 21:13:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 21:13:32,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=424, Unknown=12, NotChecked=86, Total=600 [2024-11-22 21:13:32,918 INFO L87 Difference]: Start difference. First operand 1377 states and 1736 transitions. Second operand has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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-22 21:13:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:34,968 INFO L93 Difference]: Finished difference Result 1379 states and 1740 transitions. [2024-11-22 21:13:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:13:34,968 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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 97 [2024-11-22 21:13:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:34,970 INFO L225 Difference]: With dead ends: 1379 [2024-11-22 21:13:34,970 INFO L226 Difference]: Without dead ends: 1379 [2024-11-22 21:13:34,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=626, Unknown=13, NotChecked=106, Total=870 [2024-11-22 21:13:34,971 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 701 mSDsluCounter, 4564 mSDsCounter, 0 mSdLazyCounter, 4451 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 5066 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:34,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 5066 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4451 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 21:13:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-22 21:13:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1361. [2024-11-22 21:13:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1120 states have (on average 1.5241071428571429) internal successors, (1707), 1353 states have internal predecessors, (1707), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1717 transitions. [2024-11-22 21:13:34,984 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1717 transitions. Word has length 97 [2024-11-22 21:13:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:34,984 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1717 transitions. [2024-11-22 21:13:34,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.058823529411764) internal successors, (154), 20 states have internal predecessors, (154), 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-22 21:13:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1717 transitions. [2024-11-22 21:13:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 21:13:34,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:34,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:34,997 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-22 21:13:35,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 21:13:35,186 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1112141050, now seen corresponding path program 1 times [2024-11-22 21:13:35,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:35,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108582271] [2024-11-22 21:13:35,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:35,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:35,833 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-22 21:13:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108582271] [2024-11-22 21:13:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108582271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 21:13:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990727704] [2024-11-22 21:13:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:35,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 21:13:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 21:13:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:13:35,835 INFO L87 Difference]: Start difference. First operand 1361 states and 1717 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-22 21:13:37,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:37,087 INFO L93 Difference]: Finished difference Result 1386 states and 1748 transitions. [2024-11-22 21:13:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:13:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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 99 [2024-11-22 21:13:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:37,090 INFO L225 Difference]: With dead ends: 1386 [2024-11-22 21:13:37,090 INFO L226 Difference]: Without dead ends: 1386 [2024-11-22 21:13:37,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-22 21:13:37,091 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 718 mSDsluCounter, 3416 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:37,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 3915 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 21:13:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-22 21:13:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1382. [2024-11-22 21:13:37,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5175438596491229) internal successors, (1730), 1372 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1742 transitions. [2024-11-22 21:13:37,102 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1742 transitions. Word has length 99 [2024-11-22 21:13:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:37,102 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1742 transitions. [2024-11-22 21:13:37,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 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-22 21:13:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1742 transitions. [2024-11-22 21:13:37,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 21:13:37,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:37,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:37,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 21:13:37,103 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:37,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1112141049, now seen corresponding path program 1 times [2024-11-22 21:13:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108151440] [2024-11-22 21:13:37,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:37,714 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-22 21:13:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108151440] [2024-11-22 21:13:37,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108151440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:37,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:37,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:13:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956819377] [2024-11-22 21:13:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:37,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:13:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:37,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:13:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:13:37,715 INFO L87 Difference]: Start difference. First operand 1382 states and 1742 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-22 21:13:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:39,293 INFO L93 Difference]: Finished difference Result 1385 states and 1746 transitions. [2024-11-22 21:13:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:13:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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 99 [2024-11-22 21:13:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:39,296 INFO L225 Difference]: With dead ends: 1385 [2024-11-22 21:13:39,296 INFO L226 Difference]: Without dead ends: 1385 [2024-11-22 21:13:39,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:13:39,297 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 715 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 3819 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:39,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 3819 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 21:13:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-22 21:13:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2024-11-22 21:13:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5157894736842106) internal successors, (1728), 1372 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1740 transitions. [2024-11-22 21:13:39,314 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1740 transitions. Word has length 99 [2024-11-22 21:13:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:39,314 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1740 transitions. [2024-11-22 21:13:39,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 12 states have internal predecessors, (97), 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-22 21:13:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1740 transitions. [2024-11-22 21:13:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-22 21:13:39,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:39,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 21:13:39,315 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash 218526947, now seen corresponding path program 1 times [2024-11-22 21:13:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473846698] [2024-11-22 21:13:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:39,768 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-22 21:13:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473846698] [2024-11-22 21:13:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473846698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:39,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223285192] [2024-11-22 21:13:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:39,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:39,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:39,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:13:39,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 21:13:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:39,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 21:13:39,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:39,990 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-22 21:13:40,075 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:13:40,075 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-22 21:13:40,100 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-22 21:13:40,159 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-22 21:13:40,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:40,258 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-22 21:13:40,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:40,323 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-22 21:13:40,364 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:40,364 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-22 21:13:40,376 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-22 21:13:40,403 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-22 21:13:40,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:40,414 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1512 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:13:40,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1512 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1512) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 21:13:40,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1511))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1512)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:40,479 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1515 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1511 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1515))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1511)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1512)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223285192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:40,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-22 21:13:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101609727] [2024-11-22 21:13:40,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 21:13:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 21:13:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=506, Unknown=15, NotChecked=196, Total=812 [2024-11-22 21:13:40,482 INFO L87 Difference]: Start difference. First operand 1382 states and 1740 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-22 21:13:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:42,789 INFO L93 Difference]: Finished difference Result 1384 states and 1744 transitions. [2024-11-22 21:13:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:13:42,789 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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 100 [2024-11-22 21:13:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:42,791 INFO L225 Difference]: With dead ends: 1384 [2024-11-22 21:13:42,791 INFO L226 Difference]: Without dead ends: 1384 [2024-11-22 21:13:42,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=641, Unknown=15, NotChecked=220, Total=992 [2024-11-22 21:13:42,792 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 693 mSDsluCounter, 7253 mSDsCounter, 0 mSdLazyCounter, 4860 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 7751 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:42,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 7751 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4860 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-22 21:13:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-22 21:13:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-22 21:13:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1140 states have (on average 1.5140350877192983) internal successors, (1726), 1371 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1738 transitions. [2024-11-22 21:13:42,807 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1738 transitions. Word has length 100 [2024-11-22 21:13:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1738 transitions. [2024-11-22 21:13:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-22 21:13:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1738 transitions. [2024-11-22 21:13:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-22 21:13:42,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:42,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:42,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 21:13:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-22 21:13:43,013 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash 218526948, now seen corresponding path program 1 times [2024-11-22 21:13:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790493668] [2024-11-22 21:13:43,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:43,697 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-22 21:13:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790493668] [2024-11-22 21:13:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790493668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312050303] [2024-11-22 21:13:43,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:43,700 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:13:43,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 21:13:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:43,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-22 21:13:43,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:43,912 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-22 21:13:44,096 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-22 21:13:44,102 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:13:44,103 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-22 21:13:44,127 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 11 treesize of output 7 [2024-11-22 21:13:44,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:13:44,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:13:44,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2024-11-22 21:13:44,284 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 24 treesize of output 11 [2024-11-22 21:13:44,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:13:44,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:13:44,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:13:44,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:13:44,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2024-11-22 21:13:44,397 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 24 treesize of output 11 [2024-11-22 21:13:44,572 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2024-11-22 21:13:44,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 61 [2024-11-22 21:13:44,580 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 24 treesize of output 11 [2024-11-22 21:13:44,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:13:44,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-22 21:13:44,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:13:44,659 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 7 treesize of output 3 [2024-11-22 21:13:44,679 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-22 21:13:44,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312050303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:49,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2024-11-22 21:13:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070364316] [2024-11-22 21:13:49,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:13:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:13:49,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=934, Unknown=1, NotChecked=0, Total=1056 [2024-11-22 21:13:49,503 INFO L87 Difference]: Start difference. First operand 1381 states and 1738 transitions. Second operand has 26 states, 23 states have (on average 8.26086956521739) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (2), 1 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-22 21:13:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:52,684 INFO L93 Difference]: Finished difference Result 1696 states and 2133 transitions. [2024-11-22 21:13:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 21:13:52,685 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 8.26086956521739) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (2), 1 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 100 [2024-11-22 21:13:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:52,687 INFO L225 Difference]: With dead ends: 1696 [2024-11-22 21:13:52,691 INFO L226 Difference]: Without dead ends: 1696 [2024-11-22 21:13:52,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=286, Invalid=1693, Unknown=1, NotChecked=0, Total=1980 [2024-11-22 21:13:52,692 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1552 mSDsluCounter, 6660 mSDsCounter, 0 mSdLazyCounter, 5376 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 7176 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 5376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:52,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 7176 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 5376 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-22 21:13:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-11-22 21:13:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1359. [2024-11-22 21:13:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1120 states have (on average 1.5205357142857143) internal successors, (1703), 1351 states have internal predecessors, (1703), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:13:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1713 transitions. [2024-11-22 21:13:52,717 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1713 transitions. Word has length 100 [2024-11-22 21:13:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1713 transitions. [2024-11-22 21:13:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 8.26086956521739) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (2), 1 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-22 21:13:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1713 transitions. [2024-11-22 21:13:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 21:13:52,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:52,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:52,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 21:13:52,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:52,919 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:52,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -415649749, now seen corresponding path program 1 times [2024-11-22 21:13:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097411876] [2024-11-22 21:13:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:53,358 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-22 21:13:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097411876] [2024-11-22 21:13:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097411876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:53,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 21:13:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419669612] [2024-11-22 21:13:53,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:53,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:13:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:13:53,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:13:53,360 INFO L87 Difference]: Start difference. First operand 1359 states and 1713 transitions. Second operand has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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-22 21:13:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:54,693 INFO L93 Difference]: Finished difference Result 1390 states and 1750 transitions. [2024-11-22 21:13:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:13:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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 102 [2024-11-22 21:13:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:54,702 INFO L225 Difference]: With dead ends: 1390 [2024-11-22 21:13:54,702 INFO L226 Difference]: Without dead ends: 1390 [2024-11-22 21:13:54,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-22 21:13:54,702 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 737 mSDsluCounter, 5344 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:54,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 5842 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3682 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:13:54,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-22 21:13:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1386. [2024-11-22 21:13:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5113438045375218) internal successors, (1732), 1376 states have internal predecessors, (1732), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1744 transitions. [2024-11-22 21:13:54,720 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1744 transitions. Word has length 102 [2024-11-22 21:13:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:54,720 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1744 transitions. [2024-11-22 21:13:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 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-22 21:13:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1744 transitions. [2024-11-22 21:13:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 21:13:54,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:54,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:54,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 21:13:54,722 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:54,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash -415649748, now seen corresponding path program 1 times [2024-11-22 21:13:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472146927] [2024-11-22 21:13:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:55,331 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-22 21:13:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:55,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472146927] [2024-11-22 21:13:55,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472146927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:13:55,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:13:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 21:13:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552716247] [2024-11-22 21:13:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:13:55,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:13:55,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:55,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:13:55,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:13:55,333 INFO L87 Difference]: Start difference. First operand 1386 states and 1744 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-22 21:13:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:56,802 INFO L93 Difference]: Finished difference Result 1389 states and 1748 transitions. [2024-11-22 21:13:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:13:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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 102 [2024-11-22 21:13:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:56,805 INFO L225 Difference]: With dead ends: 1389 [2024-11-22 21:13:56,805 INFO L226 Difference]: Without dead ends: 1389 [2024-11-22 21:13:56,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-22 21:13:56,805 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 733 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:56,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3820 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 21:13:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-22 21:13:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2024-11-22 21:13:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5095986038394416) internal successors, (1730), 1376 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1742 transitions. [2024-11-22 21:13:56,834 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1742 transitions. Word has length 102 [2024-11-22 21:13:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:56,834 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1742 transitions. [2024-11-22 21:13:56,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 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-22 21:13:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2024-11-22 21:13:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 21:13:56,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:56,839 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:56,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 21:13:56,840 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:13:56,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:13:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1033493202, now seen corresponding path program 1 times [2024-11-22 21:13:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:13:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445368275] [2024-11-22 21:13:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:13:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:13:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:13:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445368275] [2024-11-22 21:13:57,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445368275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:57,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521636399] [2024-11-22 21:13:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:13:57,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:13:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:13:57,444 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:13:57,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 21:13:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:13:57,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 21:13:57,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:13:57,663 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-22 21:13:57,739 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:13:57,739 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-22 21:13:57,763 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-22 21:13:57,830 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-22 21:13:57,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:57,944 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-22 21:13:58,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:58,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 42 treesize of output 41 [2024-11-22 21:13:58,065 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:58,065 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-22 21:13:58,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:13:58,110 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-22 21:13:58,120 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-22 21:13:58,145 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-22 21:13:58,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:13:58,204 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (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~mem57#1.base| v_ArrVal_2017))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:58,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2017))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-22 21:13:58,213 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2016))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2017)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:58,217 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2016))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2017)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:58,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2017 (Array Int Int)) (v_ArrVal_2016 (Array Int Int)) (v_ArrVal_2021 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2021))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2016)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2017)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2018)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:13:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521636399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:13:58,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:13:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-22 21:13:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118842030] [2024-11-22 21:13:58,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:13:58,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:13:58,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:13:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:13:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=642, Unknown=14, NotChecked=280, Total=1056 [2024-11-22 21:13:58,237 INFO L87 Difference]: Start difference. First operand 1386 states and 1742 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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-22 21:13:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:13:59,898 INFO L93 Difference]: Finished difference Result 1388 states and 1746 transitions. [2024-11-22 21:13:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:13:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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 103 [2024-11-22 21:13:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:13:59,900 INFO L225 Difference]: With dead ends: 1388 [2024-11-22 21:13:59,900 INFO L226 Difference]: Without dead ends: 1388 [2024-11-22 21:13:59,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=794, Unknown=14, NotChecked=310, Total=1260 [2024-11-22 21:13:59,901 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 686 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 5372 SdHoareTripleChecker+Invalid, 3445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:13:59,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 5372 Invalid, 3445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3432 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 21:13:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-22 21:13:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-22 21:13:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1146 states have (on average 1.5078534031413613) internal successors, (1728), 1375 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:13:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1740 transitions. [2024-11-22 21:13:59,912 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1740 transitions. Word has length 103 [2024-11-22 21:13:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:13:59,912 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1740 transitions. [2024-11-22 21:13:59,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 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-22 21:13:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1740 transitions. [2024-11-22 21:13:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-22 21:13:59,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:13:59,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:13:59,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 21:14:00,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:14:00,114 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:14:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:14:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1033493201, now seen corresponding path program 1 times [2024-11-22 21:14:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:14:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681924332] [2024-11-22 21:14:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:14:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:00,818 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-22 21:14:00,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:14:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681924332] [2024-11-22 21:14:00,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681924332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:14:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727703971] [2024-11-22 21:14:00,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:00,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:14:00,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:14:00,820 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:14:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 21:14:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:01,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 21:14:01,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:14:01,061 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-22 21:14:01,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:14:01,157 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-22 21:14:01,165 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-22 21:14:01,197 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-22 21:14:01,199 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 19 treesize of output 1 [2024-11-22 21:14:01,290 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-22 21:14:01,297 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-22 21:14:01,392 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:01,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 62 treesize of output 57 [2024-11-22 21:14:01,398 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-22 21:14:01,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:01,467 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-22 21:14:01,476 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-22 21:14:01,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:01,569 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-22 21:14:01,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-22 21:14:01,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:01,702 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-22 21:14:01,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-22 21:14:01,738 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 30 treesize of output 12 [2024-11-22 21:14:01,742 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-22 21:14:01,777 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-22 21:14:01,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:14:02,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2198 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2198))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2199))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse5 .cse2 v_ArrVal_2201))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store .cse0 .cse2 v_ArrVal_2200) .cse3 v_ArrVal_2203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_2198 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2198))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2199))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse6 .cse7 v_ArrVal_2200) (select (select (store .cse8 .cse7 v_ArrVal_2201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2203))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))))) is different from false [2024-11-22 21:14:02,168 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2198 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_2198))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_2199))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse4 (store .cse5 .cse2 v_ArrVal_2201))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store .cse0 .cse2 v_ArrVal_2200) .cse3 v_ArrVal_2203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_2198 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_2198))) (or (< (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_2199))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (store (store .cse7 .cse8 v_ArrVal_2200) (select (select (store .cse9 .cse8 v_ArrVal_2201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2203))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))))))) is different from false [2024-11-22 21:14:02,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2198 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2208))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2209) .cse5 v_ArrVal_2198))) (or (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store .cse4 .cse5 v_ArrVal_2199))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store .cse0 .cse1 v_ArrVal_2200) (select (select (store .cse2 .cse1 v_ArrVal_2201) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2203))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) 0)))))) (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2198 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2208))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2209) .cse12 v_ArrVal_2198))) (or (< (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) 0) (forall ((v_ArrVal_2203 (Array Int Int)) (v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int)) (v_ArrVal_2199 (Array Int Int))) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_2199))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2201))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store .cse6 .cse7 v_ArrVal_2200) .cse8 v_ArrVal_2203) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_2202) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))))) is different from false [2024-11-22 21:14:02,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727703971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:14:02,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:14:02,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-22 21:14:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590959188] [2024-11-22 21:14:02,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:14:02,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-22 21:14:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:14:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-22 21:14:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=790, Unknown=26, NotChecked=180, Total=1122 [2024-11-22 21:14:02,230 INFO L87 Difference]: Start difference. First operand 1385 states and 1740 transitions. Second operand has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 25 states have internal predecessors, (166), 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-22 21:14:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:14:04,277 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-11-22 21:14:04,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:14:04,278 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 25 states have internal predecessors, (166), 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 103 [2024-11-22 21:14:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:14:04,280 INFO L225 Difference]: With dead ends: 1387 [2024-11-22 21:14:04,280 INFO L226 Difference]: Without dead ends: 1387 [2024-11-22 21:14:04,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1183, Unknown=26, NotChecked=222, Total=1640 [2024-11-22 21:14:04,280 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 699 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 4464 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 4480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:14:04,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5084 Invalid, 4480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4464 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 21:14:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-22 21:14:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1357. [2024-11-22 21:14:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1120 states have (on average 1.5169642857142858) internal successors, (1699), 1349 states have internal predecessors, (1699), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 21:14:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1709 transitions. [2024-11-22 21:14:04,295 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1709 transitions. Word has length 103 [2024-11-22 21:14:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:14:04,296 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1709 transitions. [2024-11-22 21:14:04,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 25 states have internal predecessors, (166), 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-22 21:14:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1709 transitions. [2024-11-22 21:14:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 21:14:04,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:14:04,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:14:04,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 21:14:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-22 21:14:04,498 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:14:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:14:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1450583085, now seen corresponding path program 1 times [2024-11-22 21:14:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:14:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064334334] [2024-11-22 21:14:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:14:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:05,032 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-22 21:14:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:14:05,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064334334] [2024-11-22 21:14:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064334334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:14:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:14:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 21:14:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403312188] [2024-11-22 21:14:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:14:05,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:14:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:14:05,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:14:05,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:14:05,034 INFO L87 Difference]: Start difference. First operand 1357 states and 1709 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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-22 21:14:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:14:05,961 INFO L93 Difference]: Finished difference Result 1396 states and 1754 transitions. [2024-11-22 21:14:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:14:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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 106 [2024-11-22 21:14:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:14:05,965 INFO L225 Difference]: With dead ends: 1396 [2024-11-22 21:14:05,965 INFO L226 Difference]: Without dead ends: 1396 [2024-11-22 21:14:05,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:14:05,966 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 718 mSDsluCounter, 3401 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 3901 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:14:05,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 3901 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 21:14:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-22 21:14:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1392. [2024-11-22 21:14:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1154 states have (on average 1.5043327556325823) internal successors, (1736), 1382 states have internal predecessors, (1736), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:14:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1748 transitions. [2024-11-22 21:14:05,976 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1748 transitions. Word has length 106 [2024-11-22 21:14:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:14:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1748 transitions. [2024-11-22 21:14:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 14 states have internal predecessors, (104), 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-22 21:14:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1748 transitions. [2024-11-22 21:14:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 21:14:05,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:14:05,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:14:05,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-22 21:14:05,978 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:14:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:14:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1450583086, now seen corresponding path program 1 times [2024-11-22 21:14:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:14:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236221877] [2024-11-22 21:14:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:14:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:06,831 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-22 21:14:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:14:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236221877] [2024-11-22 21:14:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236221877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:14:06,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:14:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 21:14:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714946023] [2024-11-22 21:14:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:14:06,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 21:14:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:14:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 21:14:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 21:14:06,834 INFO L87 Difference]: Start difference. First operand 1392 states and 1748 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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-22 21:14:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:14:08,750 INFO L93 Difference]: Finished difference Result 1395 states and 1752 transitions. [2024-11-22 21:14:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:14:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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 106 [2024-11-22 21:14:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:14:08,753 INFO L225 Difference]: With dead ends: 1395 [2024-11-22 21:14:08,753 INFO L226 Difference]: Without dead ends: 1395 [2024-11-22 21:14:08,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-22 21:14:08,754 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 738 mSDsluCounter, 3713 mSDsCounter, 0 mSdLazyCounter, 3770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:14:08,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 4211 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3770 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 21:14:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-11-22 21:14:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1392. [2024-11-22 21:14:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1154 states have (on average 1.5025996533795494) internal successors, (1734), 1382 states have internal predecessors, (1734), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:14:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1746 transitions. [2024-11-22 21:14:08,767 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1746 transitions. Word has length 106 [2024-11-22 21:14:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:14:08,768 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1746 transitions. [2024-11-22 21:14:08,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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-22 21:14:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1746 transitions. [2024-11-22 21:14:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 21:14:08,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:14:08,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:14:08,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-22 21:14:08,769 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:14:08,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:14:08,769 INFO L85 PathProgramCache]: Analyzing trace with hash 747265968, now seen corresponding path program 1 times [2024-11-22 21:14:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:14:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858698296] [2024-11-22 21:14:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:14:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:09,395 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-22 21:14:09,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:14:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858698296] [2024-11-22 21:14:09,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858698296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:14:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874072353] [2024-11-22 21:14:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:14:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:14:09,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:14:09,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 21:14:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:09,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 21:14:09,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:14:09,638 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-22 21:14:09,733 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:14:09,734 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-22 21:14:09,773 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-22 21:14:09,843 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-22 21:14:10,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:10,010 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-22 21:14:10,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:10,093 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-22 21:14:10,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:10,140 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-22 21:14:10,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:10,183 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-22 21:14:10,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:10,234 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-22 21:14:10,244 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-22 21:14:10,288 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-22 21:14:10,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-22 21:14:10,292 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-22 21:14:10,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:14:15,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874072353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:14:15,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:14:15,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-22 21:14:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289663182] [2024-11-22 21:14:15,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:14:15,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 21:14:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:14:15,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 21:14:15,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1233, Unknown=53, NotChecked=0, Total=1482 [2024-11-22 21:14:15,013 INFO L87 Difference]: Start difference. First operand 1392 states and 1746 transitions. Second operand has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 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-22 21:14:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:14:16,616 INFO L93 Difference]: Finished difference Result 1394 states and 1750 transitions. [2024-11-22 21:14:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 21:14:16,616 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 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 107 [2024-11-22 21:14:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:14:16,620 INFO L225 Difference]: With dead ends: 1394 [2024-11-22 21:14:16,620 INFO L226 Difference]: Without dead ends: 1394 [2024-11-22 21:14:16,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=223, Invalid=1446, Unknown=53, NotChecked=0, Total=1722 [2024-11-22 21:14:16,621 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 682 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 3419 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 5358 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:14:16,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 5358 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3419 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 21:14:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-22 21:14:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1391. [2024-11-22 21:14:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1391 states, 1154 states have (on average 1.5008665511265165) internal successors, (1732), 1381 states have internal predecessors, (1732), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 21:14:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1744 transitions. [2024-11-22 21:14:16,659 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1744 transitions. Word has length 107 [2024-11-22 21:14:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:14:16,659 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1744 transitions. [2024-11-22 21:14:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.96) internal successors, (174), 27 states have internal predecessors, (174), 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-22 21:14:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1744 transitions. [2024-11-22 21:14:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-22 21:14:16,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:14:16,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:14:16,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 21:14:16,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-22 21:14:16,863 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-22 21:14:16,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:14:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 747265969, now seen corresponding path program 1 times [2024-11-22 21:14:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:14:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005724811] [2024-11-22 21:14:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:16,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:14:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:17,915 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-22 21:14:17,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:14:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005724811] [2024-11-22 21:14:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005724811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:14:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105691645] [2024-11-22 21:14:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:14:17,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:14:17,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:14:17,918 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:14:17,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 21:14:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:14:18,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-22 21:14:18,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:14:18,168 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-22 21:14:18,246 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-22 21:14:18,258 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:14:18,259 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-22 21:14:18,293 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-22 21:14:18,299 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-22 21:14:18,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-22 21:14:18,400 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-22 21:14:18,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:18,563 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 73 treesize of output 66 [2024-11-22 21:14:18,568 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-22 21:14:18,664 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:18,664 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 73 treesize of output 66 [2024-11-22 21:14:18,668 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-22 21:14:18,739 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:18,740 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 73 treesize of output 66 [2024-11-22 21:14:18,745 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-22 21:14:18,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:18,822 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 73 treesize of output 66 [2024-11-22 21:14:18,826 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-22 21:14:18,899 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:14:18,900 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 73 treesize of output 66 [2024-11-22 21:14:18,906 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-22 21:14:18,924 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 42 treesize of output 18 [2024-11-22 21:14:18,928 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-22 21:14:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:14:18,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:14:18,984 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 21:14:18,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 21:14:18,988 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-22 21:14:18,988 INFO L311 TraceCheckSpWp]: Computing backward predicates...