./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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-?-c7c6ca5-m [2024-11-09 10:05:32,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:05:32,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:05:32,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:05:32,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:05:32,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:05:32,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:05:32,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:05:32,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:05:32,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:05:32,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:05:32,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:05:32,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:05:32,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:05:32,415 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:05:32,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:05:32,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:05:32,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:05:32,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:05:32,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:05:32,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:05:32,419 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:05:32,419 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:05:32,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:05:32,419 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:05:32,419 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:05:32,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:05:32,420 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:05:32,420 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:05:32,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:05:32,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:05:32,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:05:32,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:05:32,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:05:32,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:05:32,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:05:32,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:05:32,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:05:32,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:05:32,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:05:32,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:05:32,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:05:32,430 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-09 10:05:32,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:05:32,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:05:32,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:05:32,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:05:32,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:05:32,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-09 10:05:34,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:05:34,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:05:34,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2024-11-09 10:05:34,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038d6a78b/119ca61098c246bc904b6e010f521cd9/FLAGa1450e235 [2024-11-09 10:05:34,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/038d6a78b/119ca61098c246bc904b6e010f521cd9 [2024-11-09 10:05:34,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:05:34,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:05:34,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:05:34,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:05:34,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:05:34,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:34" (1/1) ... [2024-11-09 10:05:34,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f488696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:34, skipping insertion in model container [2024-11-09 10:05:34,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:05:34" (1/1) ... [2024-11-09 10:05:34,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:05:35,068 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,096 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,157 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,159 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,164 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:05:35,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:05:35,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:05:35,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:05:35,385 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:05:35,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35 WrapperNode [2024-11-09 10:05:35,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:05:35,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:05:35,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:05:35,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:05:35,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,479 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1289 [2024-11-09 10:05:35,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:05:35,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:05:35,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:05:35,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:05:35,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,568 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 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, 4, 42]. [2024-11-09 10:05:35,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:05:35,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:05:35,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:05:35,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:05:35,678 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (1/1) ... [2024-11-09 10:05:35,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:05:35,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:35,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:05:35,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:05:35,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:05:35,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:05:35,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:05:35,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:05:35,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:05:35,754 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:05:35,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:05:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:05:35,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:05:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:05:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:05:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:05:35,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:05:35,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:05:35,930 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:05:35,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:05:35,935 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:05:35,985 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:05:36,004 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:05:37,559 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-09 10:05:37,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:05:37,592 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:05:37,592 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:05:37,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:05:37 BoogieIcfgContainer [2024-11-09 10:05:37,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:05:37,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:05:37,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:05:37,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:05:37,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:05:34" (1/3) ... [2024-11-09 10:05:37,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1578aa5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:37, skipping insertion in model container [2024-11-09 10:05:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:05:35" (2/3) ... [2024-11-09 10:05:37,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1578aa5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:05:37, skipping insertion in model container [2024-11-09 10:05:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:05:37" (3/3) ... [2024-11-09 10:05:37,602 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2024-11-09 10:05:37,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:05:37,617 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 10:05:37,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:05:37,683 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;@405416d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:05:37,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 10:05:37,690 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-09 10:05:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:05:37,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:37,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:05:37,700 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-09 10:05:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1758832, now seen corresponding path program 1 times [2024-11-09 10:05:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298331894] [2024-11-09 10:05:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298331894] [2024-11-09 10:05:37,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298331894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:37,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:37,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:37,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080544820] [2024-11-09 10:05:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:37,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:38,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:38,017 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-09 10:05:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:38,801 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-09 10:05:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:38,806 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-09 10:05:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:38,825 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 10:05:38,826 INFO L226 Difference]: Without dead ends: 1345 [2024-11-09 10:05:38,827 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-09 10:05:38,829 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-09 10:05:38,830 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-09 10:05:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-09 10:05:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-09 10:05:38,908 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-09 10:05:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-09 10:05:38,916 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-09 10:05:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:38,916 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-09 10:05:38,917 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-09 10:05:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-09 10:05:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:05:38,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:38,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:05:38,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:05:38,918 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-09 10:05:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 10:05:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432894818] [2024-11-09 10:05:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432894818] [2024-11-09 10:05:38,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432894818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:38,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:38,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:05:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220811691] [2024-11-09 10:05:38,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:38,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:38,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:38,977 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-09 10:05:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:39,402 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-09 10:05:39,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:39,403 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-09 10:05:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:39,407 INFO L225 Difference]: With dead ends: 1257 [2024-11-09 10:05:39,407 INFO L226 Difference]: Without dead ends: 1257 [2024-11-09 10:05:39,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:39,409 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 10:05:39,409 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-09 10:05:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-09 10:05:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-09 10:05:39,430 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-09 10:05:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-09 10:05:39,434 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-09 10:05:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-09 10:05:39,434 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-09 10:05:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-09 10:05:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:05:39,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:39,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:05:39,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:05:39,437 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-09 10:05:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 10:05:39,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:39,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873909723] [2024-11-09 10:05:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873909723] [2024-11-09 10:05:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873909723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:39,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:39,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:05:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023298380] [2024-11-09 10:05:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:39,530 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-09 10:05:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:40,235 INFO L93 Difference]: Finished difference Result 2016 states and 2490 transitions. [2024-11-09 10:05:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:40,236 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-09 10:05:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:40,243 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 10:05:40,244 INFO L226 Difference]: Without dead ends: 2016 [2024-11-09 10:05:40,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:40,247 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 903 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:40,247 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.7s Time] [2024-11-09 10:05:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-09 10:05:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1754. [2024-11-09 10:05:40,279 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-09 10:05:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2479 transitions. [2024-11-09 10:05:40,315 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2479 transitions. Word has length 4 [2024-11-09 10:05:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:40,316 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2479 transitions. [2024-11-09 10:05:40,316 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-09 10:05:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2479 transitions. [2024-11-09 10:05:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:05:40,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:40,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:40,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:05:40,317 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-09 10:05:40,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 10:05:40,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156284911] [2024-11-09 10:05:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156284911] [2024-11-09 10:05:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156284911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:05:40,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753884747] [2024-11-09 10:05:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:40,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:40,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:40,402 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-09 10:05:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:40,888 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2024-11-09 10:05:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:40,891 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-09 10:05:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:40,896 INFO L225 Difference]: With dead ends: 1792 [2024-11-09 10:05:40,897 INFO L226 Difference]: Without dead ends: 1792 [2024-11-09 10:05:40,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:40,900 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-09 10:05:40,902 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-09 10:05:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-09 10:05:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1707. [2024-11-09 10:05:40,930 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-09 10:05:40,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2408 transitions. [2024-11-09 10:05:40,935 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2408 transitions. Word has length 9 [2024-11-09 10:05:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2408 transitions. [2024-11-09 10:05:40,935 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-09 10:05:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2408 transitions. [2024-11-09 10:05:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:05:40,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:40,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:40,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:05:40,936 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-09 10:05:40,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 10:05:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106448950] [2024-11-09 10:05:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:41,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106448950] [2024-11-09 10:05:41,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106448950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:41,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:41,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:05:41,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117708523] [2024-11-09 10:05:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:41,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:41,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:41,021 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-09 10:05:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:41,543 INFO L93 Difference]: Finished difference Result 2000 states and 2752 transitions. [2024-11-09 10:05:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:41,544 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-09 10:05:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:41,549 INFO L225 Difference]: With dead ends: 2000 [2024-11-09 10:05:41,549 INFO L226 Difference]: Without dead ends: 2000 [2024-11-09 10:05:41,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:41,551 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-09 10:05:41,552 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-09 10:05:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-09 10:05:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1682. [2024-11-09 10:05:41,580 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-09 10:05:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2024-11-09 10:05:41,586 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 9 [2024-11-09 10:05:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:41,588 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2024-11-09 10:05:41,588 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-09 10:05:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2024-11-09 10:05:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:05:41,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:41,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:41,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:05:41,589 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-09 10:05:41,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:41,590 INFO L85 PathProgramCache]: Analyzing trace with hash -186143240, now seen corresponding path program 1 times [2024-11-09 10:05:41,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375875411] [2024-11-09 10:05:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375875411] [2024-11-09 10:05:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375875411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:41,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600867611] [2024-11-09 10:05:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:41,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:41,648 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-09 10:05:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:42,169 INFO L93 Difference]: Finished difference Result 1806 states and 2518 transitions. [2024-11-09 10:05:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:42,170 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-09 10:05:42,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:42,175 INFO L225 Difference]: With dead ends: 1806 [2024-11-09 10:05:42,175 INFO L226 Difference]: Without dead ends: 1806 [2024-11-09 10:05:42,176 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-09 10:05:42,177 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:42,178 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.5s Time] [2024-11-09 10:05:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-09 10:05:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1659. [2024-11-09 10:05:42,204 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-09 10:05:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2290 transitions. [2024-11-09 10:05:42,208 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2290 transitions. Word has length 14 [2024-11-09 10:05:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2290 transitions. [2024-11-09 10:05:42,209 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-09 10:05:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2290 transitions. [2024-11-09 10:05:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:05:42,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:42,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:42,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:05:42,210 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-09 10:05:42,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:42,210 INFO L85 PathProgramCache]: Analyzing trace with hash -186143239, now seen corresponding path program 1 times [2024-11-09 10:05:42,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310950777] [2024-11-09 10:05:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310950777] [2024-11-09 10:05:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310950777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723172535] [2024-11-09 10:05:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:42,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:42,332 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-09 10:05:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:43,044 INFO L93 Difference]: Finished difference Result 2160 states and 2773 transitions. [2024-11-09 10:05:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:43,044 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-09 10:05:43,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:43,049 INFO L225 Difference]: With dead ends: 2160 [2024-11-09 10:05:43,049 INFO L226 Difference]: Without dead ends: 2160 [2024-11-09 10:05:43,050 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-09 10:05:43,050 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 1277 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:43,050 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.7s Time] [2024-11-09 10:05:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-09 10:05:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1755. [2024-11-09 10:05:43,071 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-09 10:05:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2424 transitions. [2024-11-09 10:05:43,075 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2424 transitions. Word has length 14 [2024-11-09 10:05:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:43,075 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2424 transitions. [2024-11-09 10:05:43,075 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-09 10:05:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2424 transitions. [2024-11-09 10:05:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:05:43,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:43,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:05:43,076 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-09 10:05:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1505170837, now seen corresponding path program 1 times [2024-11-09 10:05:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982213415] [2024-11-09 10:05:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982213415] [2024-11-09 10:05:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982213415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:43,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:43,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659801443] [2024-11-09 10:05:43,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:43,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:43,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:43,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:43,112 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-09 10:05:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:43,160 INFO L93 Difference]: Finished difference Result 1427 states and 1907 transitions. [2024-11-09 10:05:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:05:43,163 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-09 10:05:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:43,167 INFO L225 Difference]: With dead ends: 1427 [2024-11-09 10:05:43,168 INFO L226 Difference]: Without dead ends: 1427 [2024-11-09 10:05:43,168 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-09 10:05:43,169 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-09 10:05:43,169 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-09 10:05:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-09 10:05:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-09 10:05:43,186 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-09 10:05:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1907 transitions. [2024-11-09 10:05:43,188 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1907 transitions. Word has length 16 [2024-11-09 10:05:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:43,189 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1907 transitions. [2024-11-09 10:05:43,189 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-09 10:05:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1907 transitions. [2024-11-09 10:05:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:05:43,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:43,190 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-09 10:05:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:05:43,190 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-09 10:05:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 10:05:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881988318] [2024-11-09 10:05:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881988318] [2024-11-09 10:05:43,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881988318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:43,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:43,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411919678] [2024-11-09 10:05:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:43,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:43,240 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-09 10:05:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:43,692 INFO L93 Difference]: Finished difference Result 1541 states and 2015 transitions. [2024-11-09 10:05:43,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:43,694 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-09 10:05:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:43,699 INFO L225 Difference]: With dead ends: 1541 [2024-11-09 10:05:43,699 INFO L226 Difference]: Without dead ends: 1541 [2024-11-09 10:05:43,699 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-09 10:05:43,700 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 1182 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:43,700 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.4s Time] [2024-11-09 10:05:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-09 10:05:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1404. [2024-11-09 10:05:43,716 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-09 10:05:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1861 transitions. [2024-11-09 10:05:43,719 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1861 transitions. Word has length 19 [2024-11-09 10:05:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:43,719 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1861 transitions. [2024-11-09 10:05:43,720 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-09 10:05:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1861 transitions. [2024-11-09 10:05:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:05:43,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:43,720 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-09 10:05:43,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:05:43,721 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-09 10:05:43,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash -179577125, now seen corresponding path program 1 times [2024-11-09 10:05:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:43,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612429713] [2024-11-09 10:05:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:43,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612429713] [2024-11-09 10:05:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612429713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:43,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:43,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830186173] [2024-11-09 10:05:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:43,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:43,779 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-09 10:05:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:43,796 INFO L93 Difference]: Finished difference Result 1266 states and 1655 transitions. [2024-11-09 10:05:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:43,796 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-09 10:05:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:43,799 INFO L225 Difference]: With dead ends: 1266 [2024-11-09 10:05:43,800 INFO L226 Difference]: Without dead ends: 1266 [2024-11-09 10:05:43,800 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-09 10:05:43,800 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-09 10:05:43,801 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-09 10:05:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-09 10:05:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-09 10:05:43,812 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-09 10:05:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1655 transitions. [2024-11-09 10:05:43,814 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1655 transitions. Word has length 19 [2024-11-09 10:05:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:43,815 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1655 transitions. [2024-11-09 10:05:43,815 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-09 10:05:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1655 transitions. [2024-11-09 10:05:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:05:43,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:43,815 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-09 10:05:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:05:43,816 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-09 10:05:43,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -774768265, now seen corresponding path program 1 times [2024-11-09 10:05:43,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:43,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615676906] [2024-11-09 10:05:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:43,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615676906] [2024-11-09 10:05:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615676906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102804432] [2024-11-09 10:05:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:43,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:43,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:43,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:43,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:43,864 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-09 10:05:43,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:43,903 INFO L93 Difference]: Finished difference Result 1237 states and 1605 transitions. [2024-11-09 10:05:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:43,904 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-09 10:05:43,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:43,907 INFO L225 Difference]: With dead ends: 1237 [2024-11-09 10:05:43,907 INFO L226 Difference]: Without dead ends: 1237 [2024-11-09 10:05:43,907 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-09 10:05:43,908 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-09 10:05:43,908 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-09 10:05:43,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-09 10:05:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1231. [2024-11-09 10:05:43,920 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-09 10:05:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1599 transitions. [2024-11-09 10:05:43,921 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1599 transitions. Word has length 21 [2024-11-09 10:05:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1599 transitions. [2024-11-09 10:05:43,922 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-09 10:05:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1599 transitions. [2024-11-09 10:05:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:05:43,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:43,922 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-09 10:05:43,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:05:43,923 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-09 10:05:43,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -441307835, now seen corresponding path program 1 times [2024-11-09 10:05:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104922651] [2024-11-09 10:05:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104922651] [2024-11-09 10:05:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104922651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045281043] [2024-11-09 10:05:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:44,036 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-09 10:05:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:44,552 INFO L93 Difference]: Finished difference Result 1813 states and 2395 transitions. [2024-11-09 10:05:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:05:44,553 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-09 10:05:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:44,557 INFO L225 Difference]: With dead ends: 1813 [2024-11-09 10:05:44,557 INFO L226 Difference]: Without dead ends: 1813 [2024-11-09 10:05:44,558 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-09 10:05:44,558 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 658 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:44,558 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.5s Time] [2024-11-09 10:05:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-09 10:05:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1227. [2024-11-09 10:05:44,571 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-09 10:05:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1591 transitions. [2024-11-09 10:05:44,573 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1591 transitions. Word has length 35 [2024-11-09 10:05:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:44,573 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1591 transitions. [2024-11-09 10:05:44,574 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-09 10:05:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1591 transitions. [2024-11-09 10:05:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:05:44,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:44,575 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-09 10:05:44,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:05:44,575 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-09 10:05:44,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1141586281, now seen corresponding path program 1 times [2024-11-09 10:05:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:44,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590563562] [2024-11-09 10:05:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590563562] [2024-11-09 10:05:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590563562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:44,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196549774] [2024-11-09 10:05:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:44,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:44,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:44,667 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-09 10:05:44,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:44,698 INFO L93 Difference]: Finished difference Result 1209 states and 1561 transitions. [2024-11-09 10:05:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:05:44,699 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-09 10:05:44,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:44,701 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:05:44,701 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:05:44,702 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-09 10:05:44,702 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-09 10:05:44,702 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-09 10:05:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:05:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:05:44,713 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-09 10:05:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1561 transitions. [2024-11-09 10:05:44,714 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1561 transitions. Word has length 62 [2024-11-09 10:05:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1561 transitions. [2024-11-09 10:05:44,714 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-09 10:05:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1561 transitions. [2024-11-09 10:05:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:05:44,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:44,716 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-09 10:05:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:05:44,716 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-09 10:05:44,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash 116988697, now seen corresponding path program 1 times [2024-11-09 10:05:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055621361] [2024-11-09 10:05:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:44,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055621361] [2024-11-09 10:05:44,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055621361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:44,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:44,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745497105] [2024-11-09 10:05:44,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:44,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:05:44,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:05:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:05:44,794 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-09 10:05:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:44,827 INFO L93 Difference]: Finished difference Result 1209 states and 1553 transitions. [2024-11-09 10:05:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:05:44,827 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-09 10:05:44,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:44,830 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:05:44,830 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:05:44,830 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-09 10:05:44,830 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-09 10:05:44,831 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-09 10:05:44,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:05:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:05:44,841 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-09 10:05:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1553 transitions. [2024-11-09 10:05:44,842 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1553 transitions. Word has length 69 [2024-11-09 10:05:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:44,843 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1553 transitions. [2024-11-09 10:05:44,843 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-09 10:05:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1553 transitions. [2024-11-09 10:05:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 10:05:44,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:44,843 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-09 10:05:44,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:05:44,844 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-09 10:05:44,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1547714973, now seen corresponding path program 1 times [2024-11-09 10:05:44,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:44,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782006128] [2024-11-09 10:05:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782006128] [2024-11-09 10:05:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782006128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:44,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:05:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770573963] [2024-11-09 10:05:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:05:44,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:05:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:05:44,916 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-09 10:05:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:44,956 INFO L93 Difference]: Finished difference Result 1474 states and 1856 transitions. [2024-11-09 10:05:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:05:44,956 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-09 10:05:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:44,960 INFO L225 Difference]: With dead ends: 1474 [2024-11-09 10:05:44,961 INFO L226 Difference]: Without dead ends: 1474 [2024-11-09 10:05:44,961 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-09 10:05:44,962 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-09 10:05:44,963 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-09 10:05:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-09 10:05:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2024-11-09 10:05:44,977 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-09 10:05:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1852 transitions. [2024-11-09 10:05:44,978 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1852 transitions. Word has length 70 [2024-11-09 10:05:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:44,979 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1852 transitions. [2024-11-09 10:05:44,980 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-09 10:05:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1852 transitions. [2024-11-09 10:05:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:05:44,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:44,981 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-09 10:05:44,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:05:44,981 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-09 10:05:44,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 616886410, now seen corresponding path program 1 times [2024-11-09 10:05:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013562554] [2024-11-09 10:05:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013562554] [2024-11-09 10:05:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013562554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:05:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571264777] [2024-11-09 10:05:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:05:45,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:05:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:05:45,263 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-09 10:05:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:45,376 INFO L93 Difference]: Finished difference Result 2081 states and 2585 transitions. [2024-11-09 10:05:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:05:45,377 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-09 10:05:45,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:45,382 INFO L225 Difference]: With dead ends: 2081 [2024-11-09 10:05:45,382 INFO L226 Difference]: Without dead ends: 2078 [2024-11-09 10:05:45,382 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-09 10:05:45,383 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-09 10:05:45,383 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-09 10:05:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-09 10:05:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1362. [2024-11-09 10:05:45,399 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-09 10:05:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1724 transitions. [2024-11-09 10:05:45,401 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1724 transitions. Word has length 76 [2024-11-09 10:05:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:45,401 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1724 transitions. [2024-11-09 10:05:45,401 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-09 10:05:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1724 transitions. [2024-11-09 10:05:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:05:45,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:45,402 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-09 10:05:45,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:05:45,402 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-09 10:05:45,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414216, now seen corresponding path program 1 times [2024-11-09 10:05:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270211469] [2024-11-09 10:05:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270211469] [2024-11-09 10:05:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270211469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515026396] [2024-11-09 10:05:45,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:05:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:45,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:05:45,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:05:45,611 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-09 10:05:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:46,019 INFO L93 Difference]: Finished difference Result 1361 states and 1722 transitions. [2024-11-09 10:05:46,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:05:46,020 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-09 10:05:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:46,023 INFO L225 Difference]: With dead ends: 1361 [2024-11-09 10:05:46,023 INFO L226 Difference]: Without dead ends: 1361 [2024-11-09 10:05:46,023 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-09 10:05:46,024 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 2 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-09 10:05:46,024 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-09 10:05:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-09 10:05:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2024-11-09 10:05:46,036 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-09 10:05:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1722 transitions. [2024-11-09 10:05:46,038 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1722 transitions. Word has length 85 [2024-11-09 10:05:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:46,038 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1722 transitions. [2024-11-09 10:05:46,038 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-09 10:05:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1722 transitions. [2024-11-09 10:05:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:05:46,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:46,039 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-09 10:05:46,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:05:46,039 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-09 10:05:46,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:46,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414215, now seen corresponding path program 1 times [2024-11-09 10:05:46,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:46,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889873672] [2024-11-09 10:05:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:46,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889873672] [2024-11-09 10:05:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889873672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:46,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:05:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966294705] [2024-11-09 10:05:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:46,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:05:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:05:46,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:05:46,468 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-09 10:05:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:47,101 INFO L93 Difference]: Finished difference Result 1360 states and 1720 transitions. [2024-11-09 10:05:47,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:05:47,101 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-09 10:05:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:47,107 INFO L225 Difference]: With dead ends: 1360 [2024-11-09 10:05:47,108 INFO L226 Difference]: Without dead ends: 1360 [2024-11-09 10:05:47,108 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-09 10:05:47,108 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:47,111 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.6s Time] [2024-11-09 10:05:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-09 10:05:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2024-11-09 10:05:47,129 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-09 10:05:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1720 transitions. [2024-11-09 10:05:47,131 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1720 transitions. Word has length 85 [2024-11-09 10:05:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1720 transitions. [2024-11-09 10:05:47,132 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-09 10:05:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1720 transitions. [2024-11-09 10:05:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:05:47,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:47,133 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-09 10:05:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:05:47,133 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-09 10:05:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 919408255, now seen corresponding path program 1 times [2024-11-09 10:05:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020177770] [2024-11-09 10:05:47,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:47,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:47,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:47,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020177770] [2024-11-09 10:05:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020177770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:05:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162962507] [2024-11-09 10:05:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:05:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:05:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:05:47,360 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-09 10:05:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:48,015 INFO L93 Difference]: Finished difference Result 1378 states and 1746 transitions. [2024-11-09 10:05:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:05:48,015 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-09 10:05:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:48,025 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 10:05:48,025 INFO L226 Difference]: Without dead ends: 1378 [2024-11-09 10:05:48,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:05:48,026 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 10 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:48,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3598 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:05:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-09 10:05:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1369. [2024-11-09 10:05:48,053 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-09 10:05:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1736 transitions. [2024-11-09 10:05:48,059 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1736 transitions. Word has length 93 [2024-11-09 10:05:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:48,059 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1736 transitions. [2024-11-09 10:05:48,060 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-09 10:05:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1736 transitions. [2024-11-09 10:05:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:05:48,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:48,061 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-09 10:05:48,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:05:48,061 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-09 10:05:48,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 919408256, now seen corresponding path program 1 times [2024-11-09 10:05:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:48,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039360907] [2024-11-09 10:05:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:48,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039360907] [2024-11-09 10:05:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039360907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:05:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209604505] [2024-11-09 10:05:48,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:48,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:05:48,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:48,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:05:48,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:05:48,532 INFO L87 Difference]: Start difference. First operand 1369 states and 1736 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) 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-09 10:05:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:49,131 INFO L93 Difference]: Finished difference Result 1369 states and 1734 transitions. [2024-11-09 10:05:49,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:05:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) 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-09 10:05:49,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:49,134 INFO L225 Difference]: With dead ends: 1369 [2024-11-09 10:05:49,134 INFO L226 Difference]: Without dead ends: 1369 [2024-11-09 10:05:49,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:05:49,134 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 5 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:49,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2924 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:05:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-09 10:05:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-09 10:05:49,154 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-09 10:05:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1734 transitions. [2024-11-09 10:05:49,156 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1734 transitions. Word has length 93 [2024-11-09 10:05:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1734 transitions. [2024-11-09 10:05:49,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) 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-09 10:05:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1734 transitions. [2024-11-09 10:05:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:05:49,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:49,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:05:49,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:05:49,157 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-09 10:05:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -941676498, now seen corresponding path program 1 times [2024-11-09 10:05:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220400400] [2024-11-09 10:05:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:49,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:49,618 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-09 10:05:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220400400] [2024-11-09 10:05:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220400400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670711964] [2024-11-09 10:05:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:49,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:49,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:05:49,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:05:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:49,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:05:49,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:49,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:05:49,952 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:05:49,953 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-09 10:05:50,003 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-09 10:05:50,074 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-09 10:05:50,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:50,232 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-09 10:05:50,269 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-09 10:05:50,303 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-09 10:05:50,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670711964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:50,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:05:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162842195] [2024-11-09 10:05:50,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:50,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:05:50,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:50,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:05:50,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=315, Unknown=11, NotChecked=0, Total=380 [2024-11-09 10:05:50,377 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-09 10:05:51,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:51,995 INFO L93 Difference]: Finished difference Result 1376 states and 1740 transitions. [2024-11-09 10:05:51,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:05:51,996 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-09 10:05:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:51,999 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 10:05:51,999 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 10:05:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=501, Unknown=12, NotChecked=0, Total=600 [2024-11-09 10:05:51,999 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 709 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 5352 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:52,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 5352 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:05:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 10:05:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-09 10:05:52,012 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-09 10:05:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1734 transitions. [2024-11-09 10:05:52,014 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1734 transitions. Word has length 94 [2024-11-09 10:05:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:52,015 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1734 transitions. [2024-11-09 10:05:52,015 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-09 10:05:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1734 transitions. [2024-11-09 10:05:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:05:52,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:52,017 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-09 10:05:52,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:05:52,221 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-09 10:05:52,222 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-09 10:05:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -941676497, now seen corresponding path program 1 times [2024-11-09 10:05:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367113918] [2024-11-09 10:05:52,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:52,835 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-09 10:05:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367113918] [2024-11-09 10:05:52,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367113918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:52,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386973691] [2024-11-09 10:05:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:52,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:52,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:52,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:05:52,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:05:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:53,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:05:53,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:53,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:05:53,103 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:05:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:05:53,110 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-09 10:05:53,135 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-09 10:05:53,138 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-09 10:05:53,205 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-09 10:05:53,209 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-09 10:05:53,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:53,295 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-09 10:05:53,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:05:53,331 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-09 10:05:53,337 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-09 10:05:53,353 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-09 10:05:53,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:53,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_773 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:05:53,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386973691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:53,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:53,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:05:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923841234] [2024-11-09 10:05:53,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:05:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:05:53,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 10:05:53,434 INFO L87 Difference]: Start difference. First operand 1373 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-09 10:05:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:55,103 INFO L93 Difference]: Finished difference Result 1375 states and 1738 transitions. [2024-11-09 10:05:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:05:55,106 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-09 10:05:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:55,108 INFO L225 Difference]: With dead ends: 1375 [2024-11-09 10:05:55,108 INFO L226 Difference]: Without dead ends: 1375 [2024-11-09 10:05:55,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 10:05:55,109 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 707 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:55,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4687 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:05:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-09 10:05:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1363. [2024-11-09 10:05:55,123 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-09 10:05:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1721 transitions. [2024-11-09 10:05:55,125 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1721 transitions. Word has length 94 [2024-11-09 10:05:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:55,125 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1721 transitions. [2024-11-09 10:05:55,125 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-09 10:05:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1721 transitions. [2024-11-09 10:05:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:05:55,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:55,126 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-09 10:05:55,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:05:55,326 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-09 10:05:55,327 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-09 10:05:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513668, now seen corresponding path program 1 times [2024-11-09 10:05:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979750309] [2024-11-09 10:05:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:55,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:55,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:55,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979750309] [2024-11-09 10:05:55,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979750309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:55,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:55,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:05:55,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154129935] [2024-11-09 10:05:55,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:55,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:05:55,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:05:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:05:55,742 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-09 10:05:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:56,779 INFO L93 Difference]: Finished difference Result 1382 states and 1746 transitions. [2024-11-09 10:05:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:05:56,780 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-09 10:05:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:56,782 INFO L225 Difference]: With dead ends: 1382 [2024-11-09 10:05:56,782 INFO L226 Difference]: Without dead ends: 1382 [2024-11-09 10:05:56,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:05:56,783 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 725 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:56,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4404 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:05:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-09 10:05:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2024-11-09 10:05:56,794 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-09 10:05:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1740 transitions. [2024-11-09 10:05:56,796 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1740 transitions. Word has length 96 [2024-11-09 10:05:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:56,797 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1740 transitions. [2024-11-09 10:05:56,797 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-09 10:05:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1740 transitions. [2024-11-09 10:05:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:05:56,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:56,798 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-09 10:05:56,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:05:56,798 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-09 10:05:56,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:56,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513669, now seen corresponding path program 1 times [2024-11-09 10:05:56,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:56,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18963727] [2024-11-09 10:05:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:57,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:05:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18963727] [2024-11-09 10:05:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18963727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:05:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:05:57,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:05:57,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335756560] [2024-11-09 10:05:57,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:05:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:05:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:57,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:05:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:05:57,374 INFO L87 Difference]: Start difference. First operand 1378 states and 1740 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) 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-09 10:05:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:05:58,383 INFO L93 Difference]: Finished difference Result 1381 states and 1744 transitions. [2024-11-09 10:05:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:05:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) 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-09 10:05:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:05:58,387 INFO L225 Difference]: With dead ends: 1381 [2024-11-09 10:05:58,387 INFO L226 Difference]: Without dead ends: 1381 [2024-11-09 10:05:58,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:05:58,388 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 736 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:05:58,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2610 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:05:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-09 10:05:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-09 10:05:58,403 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-09 10:05:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1738 transitions. [2024-11-09 10:05:58,404 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1738 transitions. Word has length 96 [2024-11-09 10:05:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:05:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1738 transitions. [2024-11-09 10:05:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) 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-09 10:05:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1738 transitions. [2024-11-09 10:05:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:05:58,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:05:58,406 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-09 10:05:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:05:58,406 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-09 10:05:58,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:05:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461109, now seen corresponding path program 1 times [2024-11-09 10:05:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:05:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206660905] [2024-11-09 10:05:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:05:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:05:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:58,827 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-09 10:05:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:05:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206660905] [2024-11-09 10:05:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206660905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793767243] [2024-11-09 10:05:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:05:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:05:58,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:05:58,830 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:05:58,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:05:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:05:59,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:05:59,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:05:59,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:05:59,123 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:05:59,123 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-09 10:05:59,150 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-09 10:05:59,204 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-09 10:05:59,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:59,301 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-09 10:05:59,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:05:59,368 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-09 10:05:59,378 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-09 10:05:59,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-09 10:05:59,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:05:59,474 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1061 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 10:05:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793767243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:05:59,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:05:59,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:05:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228418843] [2024-11-09 10:05:59,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:05:59,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:05:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:05:59,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:05:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=464, Unknown=12, NotChecked=44, Total=600 [2024-11-09 10:05:59,477 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-09 10:06:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:01,552 INFO L93 Difference]: Finished difference Result 1380 states and 1742 transitions. [2024-11-09 10:06:01,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:06:01,553 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-09 10:06:01,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:01,555 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 10:06:01,555 INFO L226 Difference]: Without dead ends: 1380 [2024-11-09 10:06:01,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=640, Unknown=12, NotChecked=52, Total=812 [2024-11-09 10:06:01,555 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 702 mSDsluCounter, 6817 mSDsCounter, 0 mSdLazyCounter, 4608 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 7316 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:01,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 7316 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4608 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:06:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-09 10:06:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-09 10:06:01,569 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-09 10:06:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1736 transitions. [2024-11-09 10:06:01,571 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1736 transitions. Word has length 97 [2024-11-09 10:06:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:01,571 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1736 transitions. [2024-11-09 10:06:01,571 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-09 10:06:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1736 transitions. [2024-11-09 10:06:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:06:01,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:01,572 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-09 10:06:01,590 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-09 10:06:01,772 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-09 10:06:01,773 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-09 10:06:01,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:01,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461110, now seen corresponding path program 1 times [2024-11-09 10:06:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:01,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071452917] [2024-11-09 10:06:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:02,482 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-09 10:06:02,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071452917] [2024-11-09 10:06:02,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071452917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988480892] [2024-11-09 10:06:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:02,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:02,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:02,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:02,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:06:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:02,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:06:02,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:02,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:06:02,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:06:02,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:06:02,785 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-09 10:06:02,792 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-09 10:06:02,835 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-09 10:06:02,839 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-09 10:06:02,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:02,922 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-09 10:06:02,927 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-09 10:06:02,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:02,980 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-09 10:06:02,986 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-09 10:06:02,999 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-09 10:06:03,002 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-09 10:06:03,005 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-09 10:06:03,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:03,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-09 10:06:03,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 10:06:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988480892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:03,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:03,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-09 10:06:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002513456] [2024-11-09 10:06:03,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:06:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:06:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=340, Unknown=15, NotChecked=78, Total=506 [2024-11-09 10:06:03,132 INFO L87 Difference]: Start difference. First operand 1377 states and 1736 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:06:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:04,138 INFO L93 Difference]: Finished difference Result 1379 states and 1740 transitions. [2024-11-09 10:06:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:06:04,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-09 10:06:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:04,141 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:06:04,141 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:06:04,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=574, Unknown=15, NotChecked=102, Total=812 [2024-11-09 10:06:04,142 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 704 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:04,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3107 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:06:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:06:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1361. [2024-11-09 10:06:04,152 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-09 10:06:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1717 transitions. [2024-11-09 10:06:04,154 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1717 transitions. Word has length 97 [2024-11-09 10:06:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:04,154 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1717 transitions. [2024-11-09 10:06:04,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:06:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1717 transitions. [2024-11-09 10:06:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:06:04,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:04,155 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-09 10:06:04,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:06:04,355 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-09 10:06:04,356 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-09 10:06:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554310, now seen corresponding path program 1 times [2024-11-09 10:06:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:04,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783152944] [2024-11-09 10:06:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:04,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:04,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783152944] [2024-11-09 10:06:04,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783152944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:04,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:06:04,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585710868] [2024-11-09 10:06:04,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:04,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:06:04,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:04,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:06:04,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:06:04,771 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-09 10:06:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:06,091 INFO L93 Difference]: Finished difference Result 1386 states and 1748 transitions. [2024-11-09 10:06:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:06:06,092 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-09 10:06:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:06,094 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 10:06:06,094 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 10:06:06,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:06:06,094 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 724 mSDsluCounter, 5331 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:06,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 5830 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:06:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 10:06:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1382. [2024-11-09 10:06:06,104 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-09 10:06:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1742 transitions. [2024-11-09 10:06:06,105 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1742 transitions. Word has length 99 [2024-11-09 10:06:06,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:06,106 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1742 transitions. [2024-11-09 10:06:06,106 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-09 10:06:06,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1742 transitions. [2024-11-09 10:06:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:06:06,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:06,106 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-09 10:06:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:06:06,107 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-09 10:06:06,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:06,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554311, now seen corresponding path program 1 times [2024-11-09 10:06:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261439593] [2024-11-09 10:06:06,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261439593] [2024-11-09 10:06:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261439593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:06,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:06:06,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250628753] [2024-11-09 10:06:06,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:06,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:06:06,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:06,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:06:06,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:06:06,700 INFO L87 Difference]: Start difference. First operand 1382 states and 1742 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) 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-09 10:06:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:07,731 INFO L93 Difference]: Finished difference Result 1385 states and 1746 transitions. [2024-11-09 10:06:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:06:07,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) 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-09 10:06:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:07,734 INFO L225 Difference]: With dead ends: 1385 [2024-11-09 10:06:07,734 INFO L226 Difference]: Without dead ends: 1385 [2024-11-09 10:06:07,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:06:07,735 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 737 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:07,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2985 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:06:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-09 10:06:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2024-11-09 10:06:07,752 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-09 10:06:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1740 transitions. [2024-11-09 10:06:07,755 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1740 transitions. Word has length 99 [2024-11-09 10:06:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:07,756 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1740 transitions. [2024-11-09 10:06:07,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) 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-09 10:06:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1740 transitions. [2024-11-09 10:06:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:06:07,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:07,757 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-09 10:06:07,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 10:06:07,757 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-09 10:06:07,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash 131383797, now seen corresponding path program 1 times [2024-11-09 10:06:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464630892] [2024-11-09 10:06:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:08,215 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-09 10:06:08,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464630892] [2024-11-09 10:06:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464630892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130903611] [2024-11-09 10:06:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:08,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:06:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:08,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:06:08,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:08,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:08,499 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:06:08,500 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-09 10:06:08,518 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-09 10:06:08,574 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-09 10:06:08,671 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:08,672 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-09 10:06:08,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:08,724 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-09 10:06:08,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:08,762 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-09 10:06:08,771 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-09 10:06:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:08,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:08,847 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (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$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1539))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:06:08,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (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$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:06:08,876 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1543))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:06:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130903611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:08,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:08,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:06:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320346009] [2024-11-09 10:06:08,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:08,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:06:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:08,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:06:08,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=546, Unknown=17, NotChecked=150, Total=812 [2024-11-09 10:06:08,879 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-09 10:06:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:10,455 INFO L93 Difference]: Finished difference Result 1384 states and 1744 transitions. [2024-11-09 10:06:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:06:10,456 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-09 10:06:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:10,458 INFO L225 Difference]: With dead ends: 1384 [2024-11-09 10:06:10,458 INFO L226 Difference]: Without dead ends: 1384 [2024-11-09 10:06:10,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=738, Unknown=17, NotChecked=174, Total=1056 [2024-11-09 10:06:10,458 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 699 mSDsluCounter, 5352 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5850 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:10,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5850 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:06:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-09 10:06:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-09 10:06:10,470 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-09 10:06:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1738 transitions. [2024-11-09 10:06:10,471 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1738 transitions. Word has length 100 [2024-11-09 10:06:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:10,471 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1738 transitions. [2024-11-09 10:06:10,471 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-09 10:06:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1738 transitions. [2024-11-09 10:06:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:06:10,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:10,472 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-09 10:06:10,487 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-09 10:06:10,672 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-09 10:06:10,673 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-09 10:06:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 131383798, now seen corresponding path program 1 times [2024-11-09 10:06:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431637097] [2024-11-09 10:06:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:11,353 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-09 10:06:11,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431637097] [2024-11-09 10:06:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431637097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359970893] [2024-11-09 10:06:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:11,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:11,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:11,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:06:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:11,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:06:11,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:11,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:11,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:06:11,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:06:11,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:06:11,666 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-09 10:06:11,673 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-09 10:06:11,740 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-09 10:06:11,744 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-09 10:06:11,843 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:11,843 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-09 10:06:11,849 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-09 10:06:11,893 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:11,894 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-09 10:06:11,908 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-09 10:06:11,959 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:11,959 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-09 10:06:11,965 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-09 10:06:11,999 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-09 10:06:12,004 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-09 10:06:12,025 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-09 10:06:12,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:12,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1721))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1720) .cse5 v_ArrVal_1712))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1713))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1721))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1720) .cse8 v_ArrVal_1712))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))))) is different from false [2024-11-09 10:06:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359970893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:12,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-09 10:06:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547227986] [2024-11-09 10:06:12,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:12,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:06:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:06:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=745, Unknown=15, NotChecked=56, Total=930 [2024-11-09 10:06:12,431 INFO L87 Difference]: Start difference. First operand 1381 states and 1738 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-09 10:06:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:14,771 INFO L93 Difference]: Finished difference Result 1383 states and 1742 transitions. [2024-11-09 10:06:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:06:14,772 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-09 10:06:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:14,774 INFO L225 Difference]: With dead ends: 1383 [2024-11-09 10:06:14,774 INFO L226 Difference]: Without dead ends: 1383 [2024-11-09 10:06:14,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1130, Unknown=15, NotChecked=70, Total=1406 [2024-11-09 10:06:14,775 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 706 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 6079 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 6604 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:14,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 6604 Invalid, 6096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 6079 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:06:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-09 10:06:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1359. [2024-11-09 10:06:14,785 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-09 10:06:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1713 transitions. [2024-11-09 10:06:14,787 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1713 transitions. Word has length 100 [2024-11-09 10:06:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:14,787 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1713 transitions. [2024-11-09 10:06:14,787 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-09 10:06:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1713 transitions. [2024-11-09 10:06:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:06:14,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:14,788 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-09 10:06:14,805 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-09 10:06:14,988 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-09 10:06:14,989 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-09 10:06:14,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551445, now seen corresponding path program 1 times [2024-11-09 10:06:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:14,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966385464] [2024-11-09 10:06:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:15,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:15,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966385464] [2024-11-09 10:06:15,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966385464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:15,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:15,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:06:15,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203688811] [2024-11-09 10:06:15,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:15,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:06:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:15,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:06:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:06:15,407 INFO L87 Difference]: Start difference. First operand 1359 states and 1713 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:16,543 INFO L93 Difference]: Finished difference Result 1390 states and 1750 transitions. [2024-11-09 10:06:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:06:16,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:16,545 INFO L225 Difference]: With dead ends: 1390 [2024-11-09 10:06:16,545 INFO L226 Difference]: Without dead ends: 1390 [2024-11-09 10:06:16,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-09 10:06:16,546 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 744 mSDsluCounter, 4366 mSDsCounter, 0 mSdLazyCounter, 3019 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:16,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 4867 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3019 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:06:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-09 10:06:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1386. [2024-11-09 10:06:16,560 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-09 10:06:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1744 transitions. [2024-11-09 10:06:16,561 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1744 transitions. Word has length 102 [2024-11-09 10:06:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1744 transitions. [2024-11-09 10:06:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:16,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1744 transitions. [2024-11-09 10:06:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:06:16,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:16,563 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-09 10:06:16,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 10:06:16,563 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-09 10:06:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551444, now seen corresponding path program 1 times [2024-11-09 10:06:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992205970] [2024-11-09 10:06:16,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992205970] [2024-11-09 10:06:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992205970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:06:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355928201] [2024-11-09 10:06:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:06:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:17,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:06:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:06:17,271 INFO L87 Difference]: Start difference. First operand 1386 states and 1744 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:18,628 INFO L93 Difference]: Finished difference Result 1389 states and 1748 transitions. [2024-11-09 10:06:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:06:18,629 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:18,631 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 10:06:18,631 INFO L226 Difference]: Without dead ends: 1389 [2024-11-09 10:06:18,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:06:18,633 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 720 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:18,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3820 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:06:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-09 10:06:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2024-11-09 10:06:18,646 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-09 10:06:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1742 transitions. [2024-11-09 10:06:18,647 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1742 transitions. Word has length 102 [2024-11-09 10:06:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1742 transitions. [2024-11-09 10:06:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) 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-09 10:06:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2024-11-09 10:06:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:06:18,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:18,649 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-09 10:06:18,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 10:06:18,649 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-09 10:06:18,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139228, now seen corresponding path program 1 times [2024-11-09 10:06:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:18,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041603301] [2024-11-09 10:06:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:19,163 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-09 10:06:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041603301] [2024-11-09 10:06:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041603301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371739294] [2024-11-09 10:06:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:19,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:19,165 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:19,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:06:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:19,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:06:19,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:19,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:19,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:06:19,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:06:19,553 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-09 10:06:19,558 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-09 10:06:19,657 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:19,657 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 51 treesize of output 48 [2024-11-09 10:06:19,662 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-09 10:06:19,673 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 19 treesize of output 7 [2024-11-09 10:06:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:06:19,700 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 48 treesize of output 32 [2024-11-09 10:06:19,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:19,754 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 31 treesize of output 32 [2024-11-09 10:06:19,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:19,792 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-09 10:06:19,828 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-09 10:06:19,830 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-09 10:06:19,830 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:19,840 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:06:19,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:06:19,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 10:06:19,882 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2060)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 10:06:19,888 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 10:06:19,897 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 16) v_ArrVal_2058)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 10:06:19,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (let ((.cse1 (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#2.base| .cse4 (store (select |c_#memory_$Pointer$#2.base| .cse4) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) v_ArrVal_2058))))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 10:06:19,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int) (v_ArrVal_2067 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_2066 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2067))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) v_ArrVal_2058)))))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2060)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-09 10:06:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371739294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:19,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:19,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2024-11-09 10:06:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249292731] [2024-11-09 10:06:19,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 10:06:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 10:06:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=719, Unknown=14, NotChecked=354, Total=1190 [2024-11-09 10:06:19,959 INFO L87 Difference]: Start difference. First operand 1386 states and 1742 transitions. Second operand has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 10:06:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:22,016 INFO L93 Difference]: Finished difference Result 1683 states and 2114 transitions. [2024-11-09 10:06:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:06:22,017 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 10:06:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:22,019 INFO L225 Difference]: With dead ends: 1683 [2024-11-09 10:06:22,019 INFO L226 Difference]: Without dead ends: 1683 [2024-11-09 10:06:22,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1424, Unknown=14, NotChecked=498, Total=2162 [2024-11-09 10:06:22,020 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 952 mSDsluCounter, 8703 mSDsCounter, 0 mSdLazyCounter, 5575 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 9213 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:22,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 9213 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:06:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-09 10:06:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1385. [2024-11-09 10:06:22,031 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-09 10:06:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1740 transitions. [2024-11-09 10:06:22,032 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1740 transitions. Word has length 103 [2024-11-09 10:06:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:22,033 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1740 transitions. [2024-11-09 10:06:22,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 10:06:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1740 transitions. [2024-11-09 10:06:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:06:22,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:22,033 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-09 10:06:22,047 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-09 10:06:22,233 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-09 10:06:22,234 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-09 10:06:22,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139229, now seen corresponding path program 1 times [2024-11-09 10:06:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696699842] [2024-11-09 10:06:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:22,939 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-09 10:06:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696699842] [2024-11-09 10:06:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696699842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236982265] [2024-11-09 10:06:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:22,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:22,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:22,941 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:22,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 10:06:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:23,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 10:06:23,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:23,201 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:06:23,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:06:23,205 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-09 10:06:23,223 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-09 10:06:23,226 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-09 10:06:23,275 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-09 10:06:23,278 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-09 10:06:23,346 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:23,346 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-09 10:06:23,353 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-09 10:06:23,422 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:23,422 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-09 10:06:23,429 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-09 10:06:23,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:23,478 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-09 10:06:23,486 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-09 10:06:23,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:23,539 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-09 10:06:23,544 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-09 10:06:23,557 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-09 10:06:23,560 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-09 10:06:23,579 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-09 10:06:23,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:23,673 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2252 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:06:23,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2251))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2250) .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2250) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-09 10:06:23,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2249))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2251))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2248) .cse0 v_ArrVal_2250) .cse1 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2249))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2248) .cse5 v_ArrVal_2250) (select (select (store .cse6 .cse5 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2252))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-09 10:06:23,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2249))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2248) .cse1 v_ArrVal_2250) (select (select (store .cse2 .cse1 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2252))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2249))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2251))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2248) .cse4 v_ArrVal_2250) .cse5 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-09 10:06:23,859 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2259))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2249))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2258) .cse0 v_ArrVal_2248) .cse1 v_ArrVal_2250) (select (select (store .cse2 .cse1 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2252))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2259))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2249))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2251))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2258) .cse5 v_ArrVal_2248) .cse6 v_ArrVal_2250) .cse7 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-09 10:06:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236982265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:23,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-09 10:06:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474272419] [2024-11-09 10:06:23,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:23,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:06:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:06:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=695, Unknown=21, NotChecked=290, Total=1122 [2024-11-09 10:06:23,867 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), 24 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-09 10:06:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:26,452 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-11-09 10:06:26,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:06:26,452 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 24 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-09 10:06:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:26,454 INFO L225 Difference]: With dead ends: 1387 [2024-11-09 10:06:26,454 INFO L226 Difference]: Without dead ends: 1387 [2024-11-09 10:06:26,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1138, Unknown=21, NotChecked=370, Total=1722 [2024-11-09 10:06:26,455 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 701 mSDsluCounter, 6107 mSDsCounter, 0 mSdLazyCounter, 6076 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 6607 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:26,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 6607 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6076 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 10:06:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-09 10:06:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1357. [2024-11-09 10:06:26,464 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-09 10:06:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1709 transitions. [2024-11-09 10:06:26,465 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1709 transitions. Word has length 103 [2024-11-09 10:06:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:26,465 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1709 transitions. [2024-11-09 10:06:26,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 24 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-09 10:06:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1709 transitions. [2024-11-09 10:06:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:06:26,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:26,466 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-09 10:06:26,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 10:06:26,666 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-09 10:06:26,667 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-09 10:06:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -891994195, now seen corresponding path program 1 times [2024-11-09 10:06:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080300020] [2024-11-09 10:06:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:27,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080300020] [2024-11-09 10:06:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080300020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 10:06:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356911362] [2024-11-09 10:06:27,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:06:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:06:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:06:27,251 INFO L87 Difference]: Start difference. First operand 1357 states and 1709 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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-09 10:06:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:28,625 INFO L93 Difference]: Finished difference Result 1396 states and 1754 transitions. [2024-11-09 10:06:28,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:06:28,625 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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-09 10:06:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:28,627 INFO L225 Difference]: With dead ends: 1396 [2024-11-09 10:06:28,627 INFO L226 Difference]: Without dead ends: 1396 [2024-11-09 10:06:28,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:06:28,628 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 747 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 5813 SdHoareTripleChecker+Invalid, 3675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:28,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 5813 Invalid, 3675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:06:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-09 10:06:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1392. [2024-11-09 10:06:28,638 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-09 10:06:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1748 transitions. [2024-11-09 10:06:28,639 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1748 transitions. Word has length 106 [2024-11-09 10:06:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1748 transitions. [2024-11-09 10:06:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 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-09 10:06:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1748 transitions. [2024-11-09 10:06:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:06:28,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:28,640 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-09 10:06:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 10:06:28,641 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-09 10:06:28,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -891994194, now seen corresponding path program 1 times [2024-11-09 10:06:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574659851] [2024-11-09 10:06:28,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:29,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:29,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574659851] [2024-11-09 10:06:29,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574659851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:29,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:29,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:06:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085010554] [2024-11-09 10:06:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:29,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:06:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:29,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:06:29,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:06:29,517 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-09 10:06:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:30,997 INFO L93 Difference]: Finished difference Result 1395 states and 1752 transitions. [2024-11-09 10:06:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:06:31,001 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-09 10:06:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:31,003 INFO L225 Difference]: With dead ends: 1395 [2024-11-09 10:06:31,003 INFO L226 Difference]: Without dead ends: 1395 [2024-11-09 10:06:31,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-09 10:06:31,004 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 742 mSDsluCounter, 3341 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 3839 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:31,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3839 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:06:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-11-09 10:06:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1392. [2024-11-09 10:06:31,016 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-09 10:06:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1746 transitions. [2024-11-09 10:06:31,017 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1746 transitions. Word has length 106 [2024-11-09 10:06:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:31,017 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1746 transitions. [2024-11-09 10:06:31,017 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-09 10:06:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1746 transitions. [2024-11-09 10:06:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 10:06:31,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:31,018 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-09 10:06:31,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 10:06:31,018 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-09 10:06:31,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 374381150, now seen corresponding path program 1 times [2024-11-09 10:06:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338912377] [2024-11-09 10:06:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:31,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-09 10:06:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338912377] [2024-11-09 10:06:31,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338912377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798503734] [2024-11-09 10:06:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:31,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:31,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:31,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:06:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:31,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 10:06:31,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:31,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:32,034 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:06:32,034 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-09 10:06:32,068 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-09 10:06:32,136 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-09 10:06:32,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:32,235 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-09 10:06:32,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:32,313 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-09 10:06:32,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:32,361 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-09 10:06:32,407 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:32,407 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-09 10:06:32,448 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:32,449 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-09 10:06:32,458 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-09 10:06:32,502 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-09 10:06:32,502 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-09 10:06:32,507 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-09 10:06:32,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798503734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:33,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:33,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2024-11-09 10:06:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526412003] [2024-11-09 10:06:33,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:33,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 10:06:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 10:06:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1162, Unknown=53, NotChecked=0, Total=1406 [2024-11-09 10:06:33,079 INFO L87 Difference]: Start difference. First operand 1392 states and 1746 transitions. Second operand has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 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-09 10:06:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:34,658 INFO L93 Difference]: Finished difference Result 1394 states and 1750 transitions. [2024-11-09 10:06:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:06:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 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-09 10:06:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:34,662 INFO L225 Difference]: With dead ends: 1394 [2024-11-09 10:06:34,662 INFO L226 Difference]: Without dead ends: 1394 [2024-11-09 10:06:34,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=1446, Unknown=53, NotChecked=0, Total=1722 [2024-11-09 10:06:34,663 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 687 mSDsluCounter, 4859 mSDsCounter, 0 mSdLazyCounter, 3445 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 5355 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:34,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 5355 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3445 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 10:06:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-09 10:06:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1391. [2024-11-09 10:06:34,673 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-09 10:06:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 1744 transitions. [2024-11-09 10:06:34,674 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 1744 transitions. Word has length 107 [2024-11-09 10:06:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:34,674 INFO L471 AbstractCegarLoop]: Abstraction has 1391 states and 1744 transitions. [2024-11-09 10:06:34,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.25) internal successors, (174), 26 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-09 10:06:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 1744 transitions. [2024-11-09 10:06:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 10:06:34,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:34,675 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-09 10:06:34,691 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-09 10:06:34,875 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-09 10:06:34,876 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-09 10:06:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 374381151, now seen corresponding path program 1 times [2024-11-09 10:06:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:34,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041647274] [2024-11-09 10:06:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:35,848 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-09 10:06:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041647274] [2024-11-09 10:06:35,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041647274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112377133] [2024-11-09 10:06:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:35,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:35,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:35,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:35,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 10:06:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:36,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 10:06:36,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:36,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:36,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:06:36,179 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:06:36,180 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-09 10:06:36,212 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-09 10:06:36,223 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-09 10:06:36,295 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-09 10:06:36,298 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-09 10:06:36,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:36,434 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-09 10:06:36,439 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-09 10:06:36,521 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:36,522 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-09 10:06:36,528 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-09 10:06:36,582 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:36,582 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-09 10:06:36,589 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-09 10:06:36,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:36,640 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-09 10:06:36,645 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-09 10:06:36,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:36,698 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-09 10:06:36,705 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-09 10:06:36,717 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-09 10:06:36,721 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-09 10:06:36,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:06:36,758 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-09 10:06:36,769 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 10:06:36,769 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-09 10:06:36,773 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-09 10:06:36,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:37,342 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (or (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2838 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2834))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2833) .cse1 v_ArrVal_2835) (select (select (store .cse2 .cse1 v_ArrVal_2836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2838))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2839 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2834))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2836))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2833) .cse4 v_ArrVal_2835) .cse5 v_ArrVal_2838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2839) (select (select (store .cse6 .cse5 v_ArrVal_2837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-09 10:06:37,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0))) (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (v_ArrVal_2838 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2832))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2834))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2831) .cse0 v_ArrVal_2833) .cse1 v_ArrVal_2835) (select (select (store .cse2 .cse1 v_ArrVal_2836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2838))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2839 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2832))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2834))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2836))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2831) .cse5 v_ArrVal_2833) .cse6 v_ArrVal_2835) .cse7 v_ArrVal_2838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2839) (select (select (store .cse8 .cse7 v_ArrVal_2837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))))) is different from false [2024-11-09 10:06:37,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (v_ArrVal_2838 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2832))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2834))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2831) .cse1 v_ArrVal_2833) .cse2 v_ArrVal_2835) (select (select (store .cse3 .cse2 v_ArrVal_2836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2838))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2839 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2832))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2834))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2836))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2831) .cse6 v_ArrVal_2833) .cse7 v_ArrVal_2835) .cse8 v_ArrVal_2838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2839) (select (select (store .cse9 .cse8 v_ArrVal_2837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-09 10:06:37,456 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (v_ArrVal_2838 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2845))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2832))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2834))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2844) .cse0 v_ArrVal_2831) .cse1 v_ArrVal_2833) .cse2 v_ArrVal_2835) (select (select (store .cse3 .cse2 v_ArrVal_2836) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2838))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2836 (Array Int Int)) (v_ArrVal_2835 (Array Int Int)) (v_ArrVal_2845 (Array Int Int)) (v_ArrVal_2834 (Array Int Int)) (v_ArrVal_2844 (Array Int Int)) (v_ArrVal_2833 (Array Int Int)) (v_ArrVal_2832 (Array Int Int)) (v_ArrVal_2831 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2838 (Array Int Int)) (v_ArrVal_2837 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2839 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2845))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2832))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2834))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2836))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2844) .cse7 v_ArrVal_2831) .cse8 v_ArrVal_2833) .cse9 v_ArrVal_2835) .cse10 v_ArrVal_2838) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2839) (select (select (store .cse11 .cse10 v_ArrVal_2837) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-09 10:06:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112377133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:37,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2024-11-09 10:06:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089360036] [2024-11-09 10:06:37,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 10:06:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:37,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 10:06:37,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1030, Unknown=27, NotChecked=276, Total=1482 [2024-11-09 10:06:37,461 INFO L87 Difference]: Start difference. First operand 1391 states and 1744 transitions. Second operand has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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-09 10:06:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:39,846 INFO L93 Difference]: Finished difference Result 1393 states and 1748 transitions. [2024-11-09 10:06:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:06:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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-09 10:06:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:39,848 INFO L225 Difference]: With dead ends: 1393 [2024-11-09 10:06:39,848 INFO L226 Difference]: Without dead ends: 1393 [2024-11-09 10:06:39,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=1152, Unknown=27, NotChecked=292, Total=1640 [2024-11-09 10:06:39,849 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 678 mSDsluCounter, 5346 mSDsCounter, 0 mSdLazyCounter, 5255 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 5845 SdHoareTripleChecker+Invalid, 5268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:39,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 5845 Invalid, 5268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 5255 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:06:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-11-09 10:06:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1355. [2024-11-09 10:06:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1120 states have (on average 1.5133928571428572) internal successors, (1695), 1347 states have internal predecessors, (1695), 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-09 10:06:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1705 transitions. [2024-11-09 10:06:39,857 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1705 transitions. Word has length 107 [2024-11-09 10:06:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:39,857 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1705 transitions. [2024-11-09 10:06:39,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.208333333333333) internal successors, (173), 26 states have internal predecessors, (173), 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-09 10:06:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1705 transitions. [2024-11-09 10:06:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 10:06:39,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:39,858 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, 1, 1] [2024-11-09 10:06:39,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:06:40,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-09 10:06:40,058 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:06:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash -435738541, now seen corresponding path program 1 times [2024-11-09 10:06:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077157303] [2024-11-09 10:06:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:40,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:40,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077157303] [2024-11-09 10:06:40,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077157303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:40,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:40,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:06:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371696286] [2024-11-09 10:06:40,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:40,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:06:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:40,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:06:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:06:40,350 INFO L87 Difference]: Start difference. First operand 1355 states and 1705 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:40,916 INFO L93 Difference]: Finished difference Result 1360 states and 1714 transitions. [2024-11-09 10:06:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:06:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-09 10:06:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:40,918 INFO L225 Difference]: With dead ends: 1360 [2024-11-09 10:06:40,918 INFO L226 Difference]: Without dead ends: 1360 [2024-11-09 10:06:40,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:06:40,919 INFO L432 NwaCegarLoop]: 782 mSDtfsCounter, 6 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:40,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3541 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:06:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-09 10:06:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1354. [2024-11-09 10:06:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1120 states have (on average 1.511607142857143) internal successors, (1693), 1346 states have internal predecessors, (1693), 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-09 10:06:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1703 transitions. [2024-11-09 10:06:40,935 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1703 transitions. Word has length 109 [2024-11-09 10:06:40,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:40,935 INFO L471 AbstractCegarLoop]: Abstraction has 1354 states and 1703 transitions. [2024-11-09 10:06:40,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1703 transitions. [2024-11-09 10:06:40,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 10:06:40,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:40,936 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, 1, 1] [2024-11-09 10:06:40,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 10:06:40,936 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:06:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash -435738540, now seen corresponding path program 1 times [2024-11-09 10:06:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583352642] [2024-11-09 10:06:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:40,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:06:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583352642] [2024-11-09 10:06:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583352642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:06:41,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:06:41,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 10:06:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224094514] [2024-11-09 10:06:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:06:41,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:06:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:41,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:06:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-09 10:06:41,990 INFO L87 Difference]: Start difference. First operand 1354 states and 1703 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:06:43,710 INFO L93 Difference]: Finished difference Result 1398 states and 1752 transitions. [2024-11-09 10:06:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:06:43,710 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2024-11-09 10:06:43,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:06:43,712 INFO L225 Difference]: With dead ends: 1398 [2024-11-09 10:06:43,712 INFO L226 Difference]: Without dead ends: 1398 [2024-11-09 10:06:43,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2024-11-09 10:06:43,712 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 721 mSDsluCounter, 4183 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:06:43,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 4680 Invalid, 4083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:06:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-09 10:06:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1395. [2024-11-09 10:06:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1160 states have (on average 1.4948275862068965) internal successors, (1734), 1385 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-09 10:06:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1746 transitions. [2024-11-09 10:06:43,722 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1746 transitions. Word has length 109 [2024-11-09 10:06:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:06:43,722 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 1746 transitions. [2024-11-09 10:06:43,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 18 states have internal predecessors, (107), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:06:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1746 transitions. [2024-11-09 10:06:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 10:06:43,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:06:43,723 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, 1, 1, 1] [2024-11-09 10:06:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 10:06:43,723 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:06:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:06:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash -840563709, now seen corresponding path program 1 times [2024-11-09 10:06:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:06:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975826557] [2024-11-09 10:06:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:06:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:06:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:44,823 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-09 10:06:44,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:06:44,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975826557] [2024-11-09 10:06:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975826557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:44,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914852225] [2024-11-09 10:06:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:06:44,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:06:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:06:44,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:06:44,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 10:06:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:06:45,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 10:06:45,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:06:45,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:06:45,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:06:45,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:06:45,124 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-09 10:06:45,150 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-09 10:06:45,159 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-09 10:06:45,231 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-09 10:06:45,235 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-09 10:06:45,348 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,349 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-09 10:06:45,357 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-09 10:06:45,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,434 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-09 10:06:45,440 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-09 10:06:45,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,494 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-09 10:06:45,499 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-09 10:06:45,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,558 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-09 10:06:45,564 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-09 10:06:45,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,619 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-09 10:06:45,625 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-09 10:06:45,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:06:45,691 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 20 treesize of output 15 [2024-11-09 10:06:45,705 INFO L349 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2024-11-09 10:06:45,705 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 22 treesize of output 24 [2024-11-09 10:06:45,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:06:45,746 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 88 treesize of output 79 [2024-11-09 10:06:45,752 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 52 treesize of output 16 [2024-11-09 10:06:45,816 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 44 treesize of output 20 [2024-11-09 10:06:45,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 13 [2024-11-09 10:06:45,836 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-09 10:06:45,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:06:46,775 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3242 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3245 (Array Int Int)) (v_ArrVal_3247 Int) (v_ArrVal_3246 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.offset_10| Int) (v_ArrVal_3248 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#2.base| .cse6 v_ArrVal_3241))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3243))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#2.offset| .cse6 v_ArrVal_3242) .cse7 v_ArrVal_3244) .cse5 v_ArrVal_3246))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3245))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ 43 (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| |v_ULTIMATE.start_main_#t~malloc61#1.offset_10|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3247) (select (select (store .cse3 .cse1 v_ArrVal_3248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (< |v_ULTIMATE.start_main_#t~malloc61#1.offset_10| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))))))) is different from false [2024-11-09 10:06:46,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3247 Int) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int) (v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3245 (Array Int Int)) (v_ArrVal_3246 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.offset_10| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3239)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_3241))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_3243))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_3240) .cse6 v_ArrVal_3242) .cse7 v_ArrVal_3244) .cse5 v_ArrVal_3246))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3245))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| |v_ULTIMATE.start_main_#t~malloc61#1.offset_10|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3247) (select (select (store .cse3 .cse1 v_ArrVal_3248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (< |v_ULTIMATE.start_main_#t~malloc61#1.offset_10| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))))))) is different from false [2024-11-09 10:06:47,398 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_9| Int) (v_ArrVal_3247 Int) (|v_ULTIMATE.start_main_#t~mem60#1.offset_11| Int) (v_ArrVal_3240 (Array Int Int)) (v_ArrVal_3241 (Array Int Int)) (v_ArrVal_3242 (Array Int Int)) (v_ArrVal_3254 (Array Int Int)) (v_ArrVal_3243 (Array Int Int)) (v_ArrVal_3255 (Array Int Int)) (v_ArrVal_3244 (Array Int Int)) (v_ArrVal_3245 (Array Int Int)) (v_ArrVal_3246 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.offset_10| Int) (v_ArrVal_3248 (Array Int Int)) (v_ArrVal_3239 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3255)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_3239))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_3241))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse9 .cse8 v_ArrVal_3243))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_3254) .cse6 v_ArrVal_3240) .cse7 v_ArrVal_3242) .cse8 v_ArrVal_3244) .cse5 v_ArrVal_3246))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_3245))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem60#1.offset_11| |v_ULTIMATE.start_main_#t~malloc61#1.offset_10|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_9| v_ArrVal_3247) (select (select (store .cse3 .cse1 v_ArrVal_3248) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< |v_ULTIMATE.start_main_#t~mem60#1.offset_11| 0) (< |v_ULTIMATE.start_main_#t~malloc61#1.offset_10| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem60#1.offset_11|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_9|) 0))))))))))))) is different from false [2024-11-09 10:06:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914852225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:06:47,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:06:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-11-09 10:06:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325469132] [2024-11-09 10:06:47,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:06:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 10:06:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:06:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 10:06:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1576, Unknown=34, NotChecked=252, Total=2070 [2024-11-09 10:06:47,404 INFO L87 Difference]: Start difference. First operand 1395 states and 1746 transitions. Second operand has 32 states, 29 states have (on average 6.172413793103448) internal successors, (179), 31 states have internal predecessors, (179), 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)