./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_SFH_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:15:51,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:15:51,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:15:51,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:15:51,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:15:51,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:15:51,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:15:51,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:15:51,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:15:51,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:15:51,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:15:51,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:15:51,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:15:51,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:15:51,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:15:51,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:15:51,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:15:51,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:15:51,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:15:51,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:15:51,581 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:15:51,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:15:51,585 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:15:51,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:15:51,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:15:51,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:15:51,586 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:15:51,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:15:51,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:15:51,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:15:51,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:15:51,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:15:51,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:15:51,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:15:51,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:15:51,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:15:51,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:15:51,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:15:51,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:15:51,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:15:51,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:15:51,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:15:51,592 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:15:51,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:15:51,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:15:51,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:15:51,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:15:51,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:15:51,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-09 10:15:53,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:15:53,561 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:15:53,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-1.i [2024-11-09 10:15:53,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4020eae57/b6eaae96d9f04cb4a29f07e4704c0e2f/FLAG22b3b039b [2024-11-09 10:15:53,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4020eae57/b6eaae96d9f04cb4a29f07e4704c0e2f [2024-11-09 10:15:53,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:15:53,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:15:53,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:15:53,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:15:53,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:15:53,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:15:53" (1/1) ... [2024-11-09 10:15:53,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339d821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:53, skipping insertion in model container [2024-11-09 10:15:53,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:15:53" (1/1) ... [2024-11-09 10:15:53,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:15:54,355 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:15:54,400 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:15:54,405 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:15:54,408 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:15:54,419 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:15:54,445 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:15:54,446 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:15:54,448 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:15:54,449 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:15:54,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:15:54,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:15:54,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:15:54,615 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:15:54,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54 WrapperNode [2024-11-09 10:15:54,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:15:54,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:15:54,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:15:54,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:15:54,624 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:15:54" (1/1) ... [2024-11-09 10:15:54,651 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:15:54" (1/1) ... [2024-11-09 10:15:54,773 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1289 [2024-11-09 10:15:54,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:15:54,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:15:54,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:15:54,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:15:54,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,870 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:15:54,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:15:54,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:15:54,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:15:54,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:15:54,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (1/1) ... [2024-11-09 10:15:54,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:15:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:15:55,003 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:15:55,010 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:15:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:15:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:15:55,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:15:55,059 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:15:55,059 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:15:55,059 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:15:55,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:15:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:15:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:15:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:15:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:15:55,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:15:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:15:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:15:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:15:55,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:15:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:15:55,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:15:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:15:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:15:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:15:55,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:15:55,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:15:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:15:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:15:55,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:15:55,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:15:55,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:15:55,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:15:55,264 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:15:55,307 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:15:55,335 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:15:57,230 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-09 10:15:57,230 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:15:57,261 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:15:57,262 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:15:57,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:15:57 BoogieIcfgContainer [2024-11-09 10:15:57,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:15:57,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:15:57,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:15:57,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:15:57,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:15:53" (1/3) ... [2024-11-09 10:15:57,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9c500c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:15:57, skipping insertion in model container [2024-11-09 10:15:57,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:54" (2/3) ... [2024-11-09 10:15:57,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9c500c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:15:57, skipping insertion in model container [2024-11-09 10:15:57,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:15:57" (3/3) ... [2024-11-09 10:15:57,273 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-1.i [2024-11-09 10:15:57,289 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:15:57,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 10:15:57,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:15:57,365 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;@64b028e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:15:57,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 10:15:57,373 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:15:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:15:57,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:57,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:15:57,381 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:15:57,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1758832, now seen corresponding path program 1 times [2024-11-09 10:15:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:57,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594227125] [2024-11-09 10:15:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:57,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:57,701 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:15:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:57,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594227125] [2024-11-09 10:15:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594227125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:57,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080956655] [2024-11-09 10:15:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:57,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:57,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:57,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:57,743 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:15:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:58,766 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-09 10:15:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:58,768 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:15:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:58,791 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 10:15:58,791 INFO L226 Difference]: Without dead ends: 1345 [2024-11-09 10:15:58,793 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:15:58,795 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:58,796 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.9s Time] [2024-11-09 10:15:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-09 10:15:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-09 10:15:58,881 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:15:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-09 10:15:58,887 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-09 10:15:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:58,887 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-09 10:15:58,888 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:15:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-09 10:15:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:15:58,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:58,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:15:58,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:15:58,889 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:15:58,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 10:15:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113364521] [2024-11-09 10:15:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:58,960 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:15:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113364521] [2024-11-09 10:15:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113364521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:15:58,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408938138] [2024-11-09 10:15:58,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:58,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:58,963 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:15:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:59,463 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-09 10:15:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:59,464 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:15:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:59,469 INFO L225 Difference]: With dead ends: 1257 [2024-11-09 10:15:59,469 INFO L226 Difference]: Without dead ends: 1257 [2024-11-09 10:15:59,469 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:15:59,470 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:59,471 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.5s Time] [2024-11-09 10:15:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-09 10:15:59,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-09 10:15:59,493 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:15:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-09 10:15:59,496 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-09 10:15:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:59,497 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-09 10:15:59,497 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:15:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-09 10:15:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:15:59,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:59,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:15:59,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:15:59,498 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:15:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 10:15:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22185591] [2024-11-09 10:15:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:59,590 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:15:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22185591] [2024-11-09 10:15:59,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22185591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:59,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:59,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:15:59,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852186055] [2024-11-09 10:15:59,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:59,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:59,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:59,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:59,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:59,593 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:16:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:00,461 INFO L93 Difference]: Finished difference Result 2016 states and 2490 transitions. [2024-11-09 10:16:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:00,462 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:16:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:00,469 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 10:16:00,469 INFO L226 Difference]: Without dead ends: 2016 [2024-11-09 10:16:00,470 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:16:00,471 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 903 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:00,471 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.8s Time] [2024-11-09 10:16:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-09 10:16:00,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1754. [2024-11-09 10:16:00,502 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:16:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2479 transitions. [2024-11-09 10:16:00,508 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2479 transitions. Word has length 4 [2024-11-09 10:16:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:00,508 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2479 transitions. [2024-11-09 10:16:00,508 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:16:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2479 transitions. [2024-11-09 10:16:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:16:00,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:00,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:00,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:16:00,509 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:16:00,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:00,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 10:16:00,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:00,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766010517] [2024-11-09 10:16:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:16:00,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:00,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766010517] [2024-11-09 10:16:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766010517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:00,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:00,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:16:00,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510565060] [2024-11-09 10:16:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:00,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:00,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:00,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:00,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:00,580 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:16:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:01,144 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2024-11-09 10:16:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:01,146 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:16:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:01,152 INFO L225 Difference]: With dead ends: 1792 [2024-11-09 10:16:01,153 INFO L226 Difference]: Without dead ends: 1792 [2024-11-09 10:16:01,154 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:16:01,155 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:16:01,155 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:16:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-09 10:16:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1707. [2024-11-09 10:16:01,183 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:16:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2408 transitions. [2024-11-09 10:16:01,188 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2408 transitions. Word has length 9 [2024-11-09 10:16:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:01,189 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2408 transitions. [2024-11-09 10:16:01,189 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:16:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2408 transitions. [2024-11-09 10:16:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:16:01,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:01,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:01,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:16:01,190 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:16:01,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 10:16:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:01,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094273579] [2024-11-09 10:16:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:01,320 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:16:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:01,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094273579] [2024-11-09 10:16:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094273579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:16:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745376251] [2024-11-09 10:16:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:01,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:01,324 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:16:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:01,838 INFO L93 Difference]: Finished difference Result 2000 states and 2752 transitions. [2024-11-09 10:16:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:01,839 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:16:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:01,846 INFO L225 Difference]: With dead ends: 2000 [2024-11-09 10:16:01,846 INFO L226 Difference]: Without dead ends: 2000 [2024-11-09 10:16:01,847 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:16:01,849 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:16:01,850 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:16:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-09 10:16:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1682. [2024-11-09 10:16:01,884 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:16:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2024-11-09 10:16:01,888 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 9 [2024-11-09 10:16:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:01,891 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2024-11-09 10:16:01,892 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:16:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2024-11-09 10:16:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:16:01,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:01,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:01,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:16:01,894 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:16:01,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -186143240, now seen corresponding path program 1 times [2024-11-09 10:16:01,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442723471] [2024-11-09 10:16:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:01,961 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:16:01,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:01,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442723471] [2024-11-09 10:16:01,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442723471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:01,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:01,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:01,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396552194] [2024-11-09 10:16:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:01,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:01,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:01,963 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:16:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:02,548 INFO L93 Difference]: Finished difference Result 1806 states and 2518 transitions. [2024-11-09 10:16:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:16:02,549 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:16:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:02,558 INFO L225 Difference]: With dead ends: 1806 [2024-11-09 10:16:02,558 INFO L226 Difference]: Without dead ends: 1806 [2024-11-09 10:16:02,559 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:16:02,560 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1286 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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:16:02,561 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:16:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-09 10:16:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1659. [2024-11-09 10:16:02,588 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:16:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2290 transitions. [2024-11-09 10:16:02,593 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2290 transitions. Word has length 14 [2024-11-09 10:16:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:02,594 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2290 transitions. [2024-11-09 10:16:02,594 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:16:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2290 transitions. [2024-11-09 10:16:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:16:02,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:02,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:02,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:16:02,595 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:16:02,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash -186143239, now seen corresponding path program 1 times [2024-11-09 10:16:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198559351] [2024-11-09 10:16:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:02,718 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:16:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198559351] [2024-11-09 10:16:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198559351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:02,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103243897] [2024-11-09 10:16:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:02,720 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:16:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:03,499 INFO L93 Difference]: Finished difference Result 2160 states and 2773 transitions. [2024-11-09 10:16:03,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:16:03,499 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:16:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:03,505 INFO L225 Difference]: With dead ends: 2160 [2024-11-09 10:16:03,505 INFO L226 Difference]: Without dead ends: 2160 [2024-11-09 10:16:03,506 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:16:03,506 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:16:03,506 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:16:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-09 10:16:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1755. [2024-11-09 10:16:03,536 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:16:03,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2424 transitions. [2024-11-09 10:16:03,541 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2424 transitions. Word has length 14 [2024-11-09 10:16:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:03,541 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2424 transitions. [2024-11-09 10:16:03,541 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:16:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2424 transitions. [2024-11-09 10:16:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:16:03,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:03,543 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:16:03,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:16:03,543 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:16:03,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1505170837, now seen corresponding path program 1 times [2024-11-09 10:16:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:03,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775794128] [2024-11-09 10:16:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:03,608 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:16:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:03,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775794128] [2024-11-09 10:16:03,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775794128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:03,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:03,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804633786] [2024-11-09 10:16:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:03,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:03,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:03,610 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:16:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:03,671 INFO L93 Difference]: Finished difference Result 1427 states and 1907 transitions. [2024-11-09 10:16:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:16:03,672 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:16:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:03,676 INFO L225 Difference]: With dead ends: 1427 [2024-11-09 10:16:03,676 INFO L226 Difference]: Without dead ends: 1427 [2024-11-09 10:16:03,676 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:16:03,677 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:16:03,678 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:16:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-09 10:16:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-09 10:16:03,701 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:16:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1907 transitions. [2024-11-09 10:16:03,705 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1907 transitions. Word has length 16 [2024-11-09 10:16:03,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:03,705 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1907 transitions. [2024-11-09 10:16:03,705 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:16:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1907 transitions. [2024-11-09 10:16:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:16:03,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:03,706 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:16:03,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:16:03,708 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:16:03,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 10:16:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:03,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638037794] [2024-11-09 10:16:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:03,767 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:16:03,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638037794] [2024-11-09 10:16:03,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638037794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:03,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:03,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505785374] [2024-11-09 10:16:03,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:03,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:03,769 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:16:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:04,293 INFO L93 Difference]: Finished difference Result 1541 states and 2015 transitions. [2024-11-09 10:16:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:16:04,294 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:16:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:04,298 INFO L225 Difference]: With dead ends: 1541 [2024-11-09 10:16:04,298 INFO L226 Difference]: Without dead ends: 1541 [2024-11-09 10:16:04,298 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:16:04,299 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:04,299 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.5s Time] [2024-11-09 10:16:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-09 10:16:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1404. [2024-11-09 10:16:04,316 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:16:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1861 transitions. [2024-11-09 10:16:04,319 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1861 transitions. Word has length 19 [2024-11-09 10:16:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:04,319 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1861 transitions. [2024-11-09 10:16:04,320 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:16:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1861 transitions. [2024-11-09 10:16:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:16:04,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:04,320 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:16:04,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:16:04,321 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:16:04,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash -179577125, now seen corresponding path program 1 times [2024-11-09 10:16:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401605803] [2024-11-09 10:16:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:04,385 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:16:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401605803] [2024-11-09 10:16:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401605803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:04,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549863139] [2024-11-09 10:16:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:04,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:04,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:04,388 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:16:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:04,412 INFO L93 Difference]: Finished difference Result 1266 states and 1655 transitions. [2024-11-09 10:16:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:04,413 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:16:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:04,416 INFO L225 Difference]: With dead ends: 1266 [2024-11-09 10:16:04,416 INFO L226 Difference]: Without dead ends: 1266 [2024-11-09 10:16:04,417 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:16:04,417 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:16:04,417 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:16:04,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-09 10:16:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-09 10:16:04,432 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:16:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1655 transitions. [2024-11-09 10:16:04,435 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1655 transitions. Word has length 19 [2024-11-09 10:16:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1655 transitions. [2024-11-09 10:16:04,435 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:16:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1655 transitions. [2024-11-09 10:16:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:16:04,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:04,436 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:16:04,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:16:04,437 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:16:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -774768265, now seen corresponding path program 1 times [2024-11-09 10:16:04,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771890215] [2024-11-09 10:16:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:04,490 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:16:04,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771890215] [2024-11-09 10:16:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771890215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772800116] [2024-11-09 10:16:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:04,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:04,492 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:16:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:04,548 INFO L93 Difference]: Finished difference Result 1237 states and 1605 transitions. [2024-11-09 10:16:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:16:04,548 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:16:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:04,552 INFO L225 Difference]: With dead ends: 1237 [2024-11-09 10:16:04,552 INFO L226 Difference]: Without dead ends: 1237 [2024-11-09 10:16:04,553 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:16:04,553 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:16:04,553 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:16:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-09 10:16:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1231. [2024-11-09 10:16:04,567 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:16:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1599 transitions. [2024-11-09 10:16:04,570 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1599 transitions. Word has length 21 [2024-11-09 10:16:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1599 transitions. [2024-11-09 10:16:04,570 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:16:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1599 transitions. [2024-11-09 10:16:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:16:04,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:04,571 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:16:04,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:16:04,571 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:16:04,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:04,572 INFO L85 PathProgramCache]: Analyzing trace with hash -441307835, now seen corresponding path program 1 times [2024-11-09 10:16:04,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:04,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891971238] [2024-11-09 10:16:04,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:04,710 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:16:04,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:04,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891971238] [2024-11-09 10:16:04,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891971238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:04,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:04,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:04,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199231018] [2024-11-09 10:16:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:04,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:04,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:04,713 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:16:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:05,357 INFO L93 Difference]: Finished difference Result 1813 states and 2395 transitions. [2024-11-09 10:16:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:16:05,357 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:16:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:05,363 INFO L225 Difference]: With dead ends: 1813 [2024-11-09 10:16:05,363 INFO L226 Difference]: Without dead ends: 1813 [2024-11-09 10:16:05,363 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:16:05,363 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 658 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:05,364 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.6s Time] [2024-11-09 10:16:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-09 10:16:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1227. [2024-11-09 10:16:05,381 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:16:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1591 transitions. [2024-11-09 10:16:05,383 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1591 transitions. Word has length 35 [2024-11-09 10:16:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:05,383 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1591 transitions. [2024-11-09 10:16:05,383 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:16:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1591 transitions. [2024-11-09 10:16:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:16:05,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:05,388 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:16:05,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:16:05,388 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:16:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1141586281, now seen corresponding path program 1 times [2024-11-09 10:16:05,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:05,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782683468] [2024-11-09 10:16:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:05,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:05,462 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:16:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782683468] [2024-11-09 10:16:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782683468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240504992] [2024-11-09 10:16:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:05,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:05,464 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:16:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:05,511 INFO L93 Difference]: Finished difference Result 1209 states and 1561 transitions. [2024-11-09 10:16:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:16:05,511 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:16:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:05,515 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:16:05,515 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:16:05,515 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:16:05,516 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:16:05,516 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:16:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:16:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:16:05,529 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:16:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1561 transitions. [2024-11-09 10:16:05,531 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1561 transitions. Word has length 62 [2024-11-09 10:16:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1561 transitions. [2024-11-09 10:16:05,531 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:16:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1561 transitions. [2024-11-09 10:16:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:16:05,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:05,533 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:16:05,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:16:05,533 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:16:05,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 116988697, now seen corresponding path program 1 times [2024-11-09 10:16:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432376847] [2024-11-09 10:16:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:05,647 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:16:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432376847] [2024-11-09 10:16:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432376847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900092457] [2024-11-09 10:16:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:05,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:16:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:05,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:16:05,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:16:05,651 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:16:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:05,698 INFO L93 Difference]: Finished difference Result 1209 states and 1553 transitions. [2024-11-09 10:16:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:16:05,698 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:16:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:05,701 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:16:05,701 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:16:05,701 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:16:05,701 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:16:05,701 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:16:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:16:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:16:05,713 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:16:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1553 transitions. [2024-11-09 10:16:05,715 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1553 transitions. Word has length 69 [2024-11-09 10:16:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:05,716 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1553 transitions. [2024-11-09 10:16:05,716 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:16:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1553 transitions. [2024-11-09 10:16:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 10:16:05,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:05,717 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:16:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:16:05,717 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:16:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1547714973, now seen corresponding path program 1 times [2024-11-09 10:16:05,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:05,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387253384] [2024-11-09 10:16:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:05,795 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:16:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:05,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387253384] [2024-11-09 10:16:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387253384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:05,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:16:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096445381] [2024-11-09 10:16:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:05,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:16:05,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:05,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:16:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:16:05,797 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:16:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:05,850 INFO L93 Difference]: Finished difference Result 1474 states and 1856 transitions. [2024-11-09 10:16:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:16:05,851 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:16:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:05,855 INFO L225 Difference]: With dead ends: 1474 [2024-11-09 10:16:05,855 INFO L226 Difference]: Without dead ends: 1474 [2024-11-09 10:16:05,855 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:16:05,856 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:16:05,856 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:16:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-09 10:16:05,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2024-11-09 10:16:05,871 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:16:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1852 transitions. [2024-11-09 10:16:05,873 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1852 transitions. Word has length 70 [2024-11-09 10:16:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:05,873 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1852 transitions. [2024-11-09 10:16:05,874 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:16:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1852 transitions. [2024-11-09 10:16:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:16:05,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:05,875 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:16:05,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:16:05,875 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:16:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 616886410, now seen corresponding path program 1 times [2024-11-09 10:16:05,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:05,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454850838] [2024-11-09 10:16:05,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:05,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:06,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:16:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454850838] [2024-11-09 10:16:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454850838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:16:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162318608] [2024-11-09 10:16:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:16:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:06,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:16:06,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:16:06,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:16:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:06,413 INFO L93 Difference]: Finished difference Result 2081 states and 2585 transitions. [2024-11-09 10:16:06,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:16:06,414 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:16:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:06,422 INFO L225 Difference]: With dead ends: 2081 [2024-11-09 10:16:06,422 INFO L226 Difference]: Without dead ends: 2078 [2024-11-09 10:16:06,422 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:16:06,423 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:16:06,424 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:16:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-09 10:16:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1362. [2024-11-09 10:16:06,446 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:16:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1724 transitions. [2024-11-09 10:16:06,448 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1724 transitions. Word has length 76 [2024-11-09 10:16:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:06,448 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1724 transitions. [2024-11-09 10:16:06,448 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:16:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1724 transitions. [2024-11-09 10:16:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:16:06,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:06,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:06,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:16:06,449 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:16:06,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414216, now seen corresponding path program 1 times [2024-11-09 10:16:06,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:06,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116756573] [2024-11-09 10:16:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:06,748 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:16:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116756573] [2024-11-09 10:16:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116756573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:06,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:06,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:06,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228619194] [2024-11-09 10:16:06,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:06,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:16:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:16:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:16:06,750 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:16:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:07,314 INFO L93 Difference]: Finished difference Result 1361 states and 1722 transitions. [2024-11-09 10:16:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:16:07,314 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:16:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:07,318 INFO L225 Difference]: With dead ends: 1361 [2024-11-09 10:16:07,319 INFO L226 Difference]: Without dead ends: 1361 [2024-11-09 10:16:07,319 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:16:07,320 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 2 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:07,320 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.5s Time] [2024-11-09 10:16:07,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-09 10:16:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2024-11-09 10:16:07,336 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:16:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1722 transitions. [2024-11-09 10:16:07,338 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1722 transitions. Word has length 85 [2024-11-09 10:16:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1722 transitions. [2024-11-09 10:16:07,339 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:16:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1722 transitions. [2024-11-09 10:16:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:16:07,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:07,340 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:16:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:16:07,340 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:16:07,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414215, now seen corresponding path program 1 times [2024-11-09 10:16:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359871424] [2024-11-09 10:16:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:07,878 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:16:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359871424] [2024-11-09 10:16:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359871424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:16:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60013532] [2024-11-09 10:16:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:16:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:16:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:16:07,880 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:16:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:08,536 INFO L93 Difference]: Finished difference Result 1360 states and 1720 transitions. [2024-11-09 10:16:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:16:08,537 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:16:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:08,544 INFO L225 Difference]: With dead ends: 1360 [2024-11-09 10:16:08,544 INFO L226 Difference]: Without dead ends: 1360 [2024-11-09 10:16:08,545 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:16:08,545 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:16:08,545 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:16:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-09 10:16:08,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2024-11-09 10:16:08,566 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:16:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1720 transitions. [2024-11-09 10:16:08,568 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1720 transitions. Word has length 85 [2024-11-09 10:16:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:08,568 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1720 transitions. [2024-11-09 10:16:08,568 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:16:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1720 transitions. [2024-11-09 10:16:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:16:08,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:08,569 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:16:08,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:16:08,570 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:16:08,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash 919408255, now seen corresponding path program 1 times [2024-11-09 10:16:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:08,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844186319] [2024-11-09 10:16:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:08,864 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:16:08,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:08,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844186319] [2024-11-09 10:16:08,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844186319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:08,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:16:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085464614] [2024-11-09 10:16:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:16:08,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:08,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:16:08,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:16:08,867 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:16:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:09,673 INFO L93 Difference]: Finished difference Result 1378 states and 1746 transitions. [2024-11-09 10:16:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:16:09,674 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:16:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:09,679 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 10:16:09,679 INFO L226 Difference]: Without dead ends: 1378 [2024-11-09 10:16:09,679 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:16:09,680 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 10 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:09,680 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.8s Time] [2024-11-09 10:16:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-09 10:16:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1369. [2024-11-09 10:16:09,705 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:16:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1736 transitions. [2024-11-09 10:16:09,710 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1736 transitions. Word has length 93 [2024-11-09 10:16:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:09,711 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1736 transitions. [2024-11-09 10:16:09,711 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:16:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1736 transitions. [2024-11-09 10:16:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:16:09,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:09,712 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:16:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:16:09,713 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:16:09,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 919408256, now seen corresponding path program 1 times [2024-11-09 10:16:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125751342] [2024-11-09 10:16:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:10,297 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:16:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:10,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125751342] [2024-11-09 10:16:10,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125751342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:10,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:10,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:16:10,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925691082] [2024-11-09 10:16:10,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:10,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:16:10,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:16:10,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:16:10,300 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:16:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:11,078 INFO L93 Difference]: Finished difference Result 1369 states and 1734 transitions. [2024-11-09 10:16:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:16:11,079 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:16:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:11,082 INFO L225 Difference]: With dead ends: 1369 [2024-11-09 10:16:11,082 INFO L226 Difference]: Without dead ends: 1369 [2024-11-09 10:16:11,083 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:16:11,084 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 5 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:11,084 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.7s Time] [2024-11-09 10:16:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-09 10:16:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-09 10:16:11,103 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:16:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1734 transitions. [2024-11-09 10:16:11,105 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1734 transitions. Word has length 93 [2024-11-09 10:16:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:11,105 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1734 transitions. [2024-11-09 10:16:11,105 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:16:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1734 transitions. [2024-11-09 10:16:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:16:11,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:11,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] [2024-11-09 10:16:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:16:11,107 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:16:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -941676498, now seen corresponding path program 1 times [2024-11-09 10:16:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764514407] [2024-11-09 10:16:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:11,695 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:16:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764514407] [2024-11-09 10:16:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764514407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825745052] [2024-11-09 10:16:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:11,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:11,699 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:16:11,700 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:16:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:11,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:16:11,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:11,997 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:16:12,150 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:16:12,151 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:16:12,201 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:16:12,297 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:16:12,508 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:12,508 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:16:12,555 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:16:12,591 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:16:12,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:12,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825745052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:12,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:12,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:16:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909330438] [2024-11-09 10:16:12,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:16:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:16:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=315, Unknown=11, NotChecked=0, Total=380 [2024-11-09 10:16:12,670 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:16:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:14,657 INFO L93 Difference]: Finished difference Result 1376 states and 1740 transitions. [2024-11-09 10:16:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:14,657 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:16:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:14,679 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 10:16:14,680 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 10:16:14,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=501, Unknown=12, NotChecked=0, Total=600 [2024-11-09 10:16:14,681 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 709 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:14,681 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.8s Time] [2024-11-09 10:16:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 10:16:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-09 10:16:14,705 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:16:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1734 transitions. [2024-11-09 10:16:14,708 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1734 transitions. Word has length 94 [2024-11-09 10:16:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:14,708 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1734 transitions. [2024-11-09 10:16:14,709 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:16:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1734 transitions. [2024-11-09 10:16:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:16:14,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:14,712 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:16:14,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:14,912 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:16:14,913 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:16:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -941676497, now seen corresponding path program 1 times [2024-11-09 10:16:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426395127] [2024-11-09 10:16:14,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:15,741 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:16:15,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:15,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426395127] [2024-11-09 10:16:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426395127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623820574] [2024-11-09 10:16:15,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:15,746 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:16:15,748 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:16:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:15,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:16:15,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:15,974 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:16:16,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:16,094 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:16:16,103 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:16:16,134 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:16:16,140 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:16:16,229 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:16:16,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:16:16,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:16,343 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:16:16,350 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:16:16,385 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:16:16,392 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:16:16,411 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:16:16,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:16,508 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:16:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623820574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:16,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:16:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132472760] [2024-11-09 10:16:16,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:16:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:16:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 10:16:16,512 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:16:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:18,477 INFO L93 Difference]: Finished difference Result 1375 states and 1738 transitions. [2024-11-09 10:16:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:16:18,477 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:16:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:18,480 INFO L225 Difference]: With dead ends: 1375 [2024-11-09 10:16:18,480 INFO L226 Difference]: Without dead ends: 1375 [2024-11-09 10:16:18,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 10:16:18,481 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 707 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:18,481 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.8s Time] [2024-11-09 10:16:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-09 10:16:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1363. [2024-11-09 10:16:18,498 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:16:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1721 transitions. [2024-11-09 10:16:18,500 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1721 transitions. Word has length 94 [2024-11-09 10:16:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:18,500 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1721 transitions. [2024-11-09 10:16:18,500 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:16:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1721 transitions. [2024-11-09 10:16:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:16:18,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:18,501 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:16:18,521 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:16:18,705 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:16:18,706 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:16:18,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:18,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513668, now seen corresponding path program 1 times [2024-11-09 10:16:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:18,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579347638] [2024-11-09 10:16:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:18,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:19,374 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:16:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:19,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579347638] [2024-11-09 10:16:19,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579347638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:19,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:19,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:16:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298525137] [2024-11-09 10:16:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:19,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:16:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:16:19,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:16:19,377 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:16:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:20,720 INFO L93 Difference]: Finished difference Result 1382 states and 1746 transitions. [2024-11-09 10:16:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:16:20,722 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:16:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:20,726 INFO L225 Difference]: With dead ends: 1382 [2024-11-09 10:16:20,726 INFO L226 Difference]: Without dead ends: 1382 [2024-11-09 10:16:20,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:16:20,728 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 725 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:20,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4404 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:16:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-09 10:16:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2024-11-09 10:16:20,745 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:16:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1740 transitions. [2024-11-09 10:16:20,749 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1740 transitions. Word has length 96 [2024-11-09 10:16:20,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:20,750 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1740 transitions. [2024-11-09 10:16:20,750 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:16:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1740 transitions. [2024-11-09 10:16:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:16:20,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:20,751 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:16:20,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:16:20,751 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:16:20,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513669, now seen corresponding path program 1 times [2024-11-09 10:16:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:20,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182060689] [2024-11-09 10:16:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:21,505 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:16:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182060689] [2024-11-09 10:16:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182060689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:21,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:16:21,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185115463] [2024-11-09 10:16:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:21,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:16:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:16:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:16:21,509 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:16:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:22,683 INFO L93 Difference]: Finished difference Result 1381 states and 1744 transitions. [2024-11-09 10:16:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:16:22,684 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:16:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:22,687 INFO L225 Difference]: With dead ends: 1381 [2024-11-09 10:16:22,687 INFO L226 Difference]: Without dead ends: 1381 [2024-11-09 10:16:22,687 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:16:22,688 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 736 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:22,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2610 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:16:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-09 10:16:22,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-09 10:16:22,703 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:16:22,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1738 transitions. [2024-11-09 10:16:22,705 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1738 transitions. Word has length 96 [2024-11-09 10:16:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:22,706 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1738 transitions. [2024-11-09 10:16:22,706 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:16:22,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1738 transitions. [2024-11-09 10:16:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:16:22,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:22,707 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:16:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:16:22,707 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:16:22,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461109, now seen corresponding path program 1 times [2024-11-09 10:16:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:22,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482703358] [2024-11-09 10:16:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:23,255 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:16:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482703358] [2024-11-09 10:16:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482703358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216552050] [2024-11-09 10:16:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:23,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:23,259 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:16:23,261 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:16:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:23,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:16:23,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:23,529 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:16:23,673 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:16:23,673 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:16:23,707 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:16:23,777 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:16:23,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:23,911 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:16:23,999 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:24,000 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:16:24,014 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:16:24,044 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:16:24,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:24,145 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:16:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216552050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:24,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 10:16:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463113175] [2024-11-09 10:16:24,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 10:16:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 10:16:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=464, Unknown=12, NotChecked=44, Total=600 [2024-11-09 10:16:24,148 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:16:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:26,440 INFO L93 Difference]: Finished difference Result 1380 states and 1742 transitions. [2024-11-09 10:16:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:26,440 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:16:26,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:26,443 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 10:16:26,443 INFO L226 Difference]: Without dead ends: 1380 [2024-11-09 10:16:26,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=640, Unknown=12, NotChecked=52, Total=812 [2024-11-09 10:16:26,444 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 702 mSDsluCounter, 6817 mSDsCounter, 0 mSdLazyCounter, 4608 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:26,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 7316 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4608 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:16:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-09 10:16:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-09 10:16:26,458 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:16:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1736 transitions. [2024-11-09 10:16:26,460 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1736 transitions. Word has length 97 [2024-11-09 10:16:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:26,461 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1736 transitions. [2024-11-09 10:16:26,461 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:16:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1736 transitions. [2024-11-09 10:16:26,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:16:26,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:26,462 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:16:26,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:26,666 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:16:26,667 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:16:26,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461110, now seen corresponding path program 1 times [2024-11-09 10:16:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:26,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448811780] [2024-11-09 10:16:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:27,642 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:16:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448811780] [2024-11-09 10:16:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448811780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516404885] [2024-11-09 10:16:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:27,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:27,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:27,645 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:16:27,646 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:16:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:27,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 10:16:27,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:27,886 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:16:27,979 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:16:27,988 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:27,989 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:16:27,999 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:16:28,008 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:16:28,065 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:16:28,070 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:16:28,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,173 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:16:28,182 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:16:28,238 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:16:28,247 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:16:28,262 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:16:28,266 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:16:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:16:28,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:28,331 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:16:28,433 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:16:28,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516404885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:28,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:28,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-09 10:16:28,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378848387] [2024-11-09 10:16:28,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:28,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:16:28,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:28,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:16:28,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=340, Unknown=15, NotChecked=78, Total=506 [2024-11-09 10:16:28,437 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:16:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:29,665 INFO L93 Difference]: Finished difference Result 1379 states and 1740 transitions. [2024-11-09 10:16:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:16:29,666 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:16:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:29,668 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:16:29,669 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:16:29,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=574, Unknown=15, NotChecked=102, Total=812 [2024-11-09 10:16:29,670 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 704 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:29,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3107 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:16:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:16:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1361. [2024-11-09 10:16:29,685 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:16:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1717 transitions. [2024-11-09 10:16:29,688 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1717 transitions. Word has length 97 [2024-11-09 10:16:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:29,688 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1717 transitions. [2024-11-09 10:16:29,688 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:16:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1717 transitions. [2024-11-09 10:16:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:16:29,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:29,690 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:16:29,710 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:16:29,893 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:16:29,894 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:16:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554310, now seen corresponding path program 1 times [2024-11-09 10:16:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686601643] [2024-11-09 10:16:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:30,482 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:16:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:30,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686601643] [2024-11-09 10:16:30,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686601643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:30,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:16:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368445928] [2024-11-09 10:16:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:30,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:16:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:16:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:16:30,484 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:16:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:32,066 INFO L93 Difference]: Finished difference Result 1386 states and 1748 transitions. [2024-11-09 10:16:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:32,066 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:16:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:32,069 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 10:16:32,069 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 10:16:32,069 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:16:32,069 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 724 mSDsluCounter, 5331 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:32,070 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.4s Time] [2024-11-09 10:16:32,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 10:16:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1382. [2024-11-09 10:16:32,086 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:16:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1742 transitions. [2024-11-09 10:16:32,088 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1742 transitions. Word has length 99 [2024-11-09 10:16:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:32,088 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1742 transitions. [2024-11-09 10:16:32,089 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:16:32,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1742 transitions. [2024-11-09 10:16:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:16:32,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:32,090 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:16:32,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:16:32,090 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:16:32,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:32,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554311, now seen corresponding path program 1 times [2024-11-09 10:16:32,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:32,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360728580] [2024-11-09 10:16:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:32,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:32,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:32,884 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:16:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360728580] [2024-11-09 10:16:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360728580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:16:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766008828] [2024-11-09 10:16:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:16:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:32,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:16:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:16:32,886 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:16:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:34,234 INFO L93 Difference]: Finished difference Result 1385 states and 1746 transitions. [2024-11-09 10:16:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:16:34,234 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:16:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:34,237 INFO L225 Difference]: With dead ends: 1385 [2024-11-09 10:16:34,237 INFO L226 Difference]: Without dead ends: 1385 [2024-11-09 10:16:34,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:16:34,238 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 737 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:34,238 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.2s Time] [2024-11-09 10:16:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-09 10:16:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2024-11-09 10:16:34,261 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:16:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1740 transitions. [2024-11-09 10:16:34,265 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1740 transitions. Word has length 99 [2024-11-09 10:16:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:34,266 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1740 transitions. [2024-11-09 10:16:34,266 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:16:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1740 transitions. [2024-11-09 10:16:34,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:16:34,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:34,267 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:16:34,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 10:16:34,268 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:16:34,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 131383797, now seen corresponding path program 1 times [2024-11-09 10:16:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299711924] [2024-11-09 10:16:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:34,926 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:16:34,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299711924] [2024-11-09 10:16:34,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299711924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:34,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870254699] [2024-11-09 10:16:34,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:34,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:34,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:34,929 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:16:34,931 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:16:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:35,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 10:16:35,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:35,196 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:16:35,297 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:16:35,298 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:16:35,361 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:16:35,435 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:16:35,565 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:35,565 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:16:35,649 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:35,650 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:16:35,698 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:35,699 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:16:35,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 31 treesize of output 13 [2024-11-09 10:16:35,752 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:16:35,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:35,820 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:16:35,826 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:16:35,853 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:16:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870254699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:35,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:16:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32426725] [2024-11-09 10:16:35,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:35,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:16:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:35,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:16:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=546, Unknown=17, NotChecked=150, Total=812 [2024-11-09 10:16:35,857 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:16:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:37,707 INFO L93 Difference]: Finished difference Result 1384 states and 1744 transitions. [2024-11-09 10:16:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:16:37,708 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:16:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:37,711 INFO L225 Difference]: With dead ends: 1384 [2024-11-09 10:16:37,711 INFO L226 Difference]: Without dead ends: 1384 [2024-11-09 10:16:37,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=738, Unknown=17, NotChecked=174, Total=1056 [2024-11-09 10:16:37,713 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 699 mSDsluCounter, 5352 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:37,713 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.7s Time] [2024-11-09 10:16:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-09 10:16:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-09 10:16:37,729 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:16:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1738 transitions. [2024-11-09 10:16:37,731 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1738 transitions. Word has length 100 [2024-11-09 10:16:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:37,732 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1738 transitions. [2024-11-09 10:16:37,732 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:16:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1738 transitions. [2024-11-09 10:16:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:16:37,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:37,733 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:16:37,754 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:16:37,937 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:16:37,938 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:16:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash 131383798, now seen corresponding path program 1 times [2024-11-09 10:16:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:37,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277163088] [2024-11-09 10:16:37,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:37,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:38,874 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:16:38,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:38,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277163088] [2024-11-09 10:16:38,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277163088] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:38,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985195559] [2024-11-09 10:16:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:38,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:38,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:38,877 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:16:38,879 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:16:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:39,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:16:39,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:39,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:16:39,223 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:16:39,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:39,231 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:16:39,260 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:16:39,268 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:16:39,326 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:16:39,329 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:16:39,411 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:39,412 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:16:39,419 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:16:39,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:39,492 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:16:39,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:16:39,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:39,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:16:39,571 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:16:39,617 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:16:39,619 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:16:39,646 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:16:39,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:40,111 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:16:40,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985195559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:40,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-09 10:16:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602635409] [2024-11-09 10:16:40,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:16:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:16:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=745, Unknown=15, NotChecked=56, Total=930 [2024-11-09 10:16:40,117 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:16:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:43,112 INFO L93 Difference]: Finished difference Result 1383 states and 1742 transitions. [2024-11-09 10:16:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:43,112 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:16:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:43,115 INFO L225 Difference]: With dead ends: 1383 [2024-11-09 10:16:43,115 INFO L226 Difference]: Without dead ends: 1383 [2024-11-09 10:16:43,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1130, Unknown=15, NotChecked=70, Total=1406 [2024-11-09 10:16:43,117 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 706 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 6079 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:43,117 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.7s Time] [2024-11-09 10:16:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-09 10:16:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1359. [2024-11-09 10:16:43,132 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:16:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1713 transitions. [2024-11-09 10:16:43,134 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1713 transitions. Word has length 100 [2024-11-09 10:16:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:43,135 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1713 transitions. [2024-11-09 10:16:43,135 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:16:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1713 transitions. [2024-11-09 10:16:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:16:43,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:43,136 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:16:43,157 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:16:43,337 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:16:43,338 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:16:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:43,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551445, now seen corresponding path program 1 times [2024-11-09 10:16:43,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:43,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263113082] [2024-11-09 10:16:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:43,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:43,930 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:16:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263113082] [2024-11-09 10:16:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263113082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:43,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:43,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:16:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105282671] [2024-11-09 10:16:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:43,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:16:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:43,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:16:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:16:43,932 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:16:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:45,155 INFO L93 Difference]: Finished difference Result 1390 states and 1750 transitions. [2024-11-09 10:16:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:16:45,156 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:16:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:45,158 INFO L225 Difference]: With dead ends: 1390 [2024-11-09 10:16:45,158 INFO L226 Difference]: Without dead ends: 1390 [2024-11-09 10:16:45,159 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:16:45,159 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:45,159 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.1s Time] [2024-11-09 10:16:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-09 10:16:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1386. [2024-11-09 10:16:45,174 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:16:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1744 transitions. [2024-11-09 10:16:45,176 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1744 transitions. Word has length 102 [2024-11-09 10:16:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1744 transitions. [2024-11-09 10:16:45,177 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:16:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1744 transitions. [2024-11-09 10:16:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:16:45,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:45,178 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:16:45,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 10:16:45,179 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:16:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551444, now seen corresponding path program 1 times [2024-11-09 10:16:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307349759] [2024-11-09 10:16:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:46,083 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:16:46,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:46,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307349759] [2024-11-09 10:16:46,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307349759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:46,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:46,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:16:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964145168] [2024-11-09 10:16:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:46,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:16:46,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:16:46,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:16:46,086 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:16:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:47,640 INFO L93 Difference]: Finished difference Result 1389 states and 1748 transitions. [2024-11-09 10:16:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:16:47,641 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:16:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:47,643 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 10:16:47,643 INFO L226 Difference]: Without dead ends: 1389 [2024-11-09 10:16:47,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:16:47,644 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 720 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:47,644 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.4s Time] [2024-11-09 10:16:47,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-09 10:16:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2024-11-09 10:16:47,656 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:16:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1742 transitions. [2024-11-09 10:16:47,658 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1742 transitions. Word has length 102 [2024-11-09 10:16:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:47,658 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1742 transitions. [2024-11-09 10:16:47,658 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:16:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2024-11-09 10:16:47,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:16:47,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:47,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:47,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 10:16:47,660 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:16:47,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139228, now seen corresponding path program 1 times [2024-11-09 10:16:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626640283] [2024-11-09 10:16:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:48,333 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:16:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626640283] [2024-11-09 10:16:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626640283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547442358] [2024-11-09 10:16:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:48,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:48,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:48,336 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:16:48,338 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:16:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:48,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:16:48,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:48,642 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:16:48,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:48,867 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:16:48,895 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:16:48,902 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:16:49,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:49,043 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:16:49,048 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:16:49,064 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:16:49,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:16:49,101 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:16:49,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:49,175 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:16:49,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:49,229 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:16:49,279 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:16:49,283 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:16:49,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:49,297 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:16:49,298 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:16:49,336 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:16:49,342 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:16:49,347 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:16:49,360 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:16:49,379 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:16:49,439 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:16:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547442358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:49,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:49,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2024-11-09 10:16:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241825104] [2024-11-09 10:16:49,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:49,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 10:16:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 10:16:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=719, Unknown=14, NotChecked=354, Total=1190 [2024-11-09 10:16:49,444 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:16:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:51,885 INFO L93 Difference]: Finished difference Result 1683 states and 2114 transitions. [2024-11-09 10:16:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:16:51,885 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:16:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:51,887 INFO L225 Difference]: With dead ends: 1683 [2024-11-09 10:16:51,887 INFO L226 Difference]: Without dead ends: 1683 [2024-11-09 10:16:51,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1424, Unknown=14, NotChecked=498, Total=2162 [2024-11-09 10:16:51,889 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 952 mSDsluCounter, 8703 mSDsCounter, 0 mSdLazyCounter, 5575 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:51,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 9213 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 10:16:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-09 10:16:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1385. [2024-11-09 10:16:51,906 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:16:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1740 transitions. [2024-11-09 10:16:51,908 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1740 transitions. Word has length 103 [2024-11-09 10:16:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:51,908 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1740 transitions. [2024-11-09 10:16:51,909 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:16:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1740 transitions. [2024-11-09 10:16:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:16:51,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:51,909 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:16:51,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:52,110 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:16:52,110 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:16:52,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:52,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139229, now seen corresponding path program 1 times [2024-11-09 10:16:52,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:52,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141789327] [2024-11-09 10:16:52,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:53,119 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:16:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141789327] [2024-11-09 10:16:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141789327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415099022] [2024-11-09 10:16:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:53,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:53,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:53,122 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:16:53,125 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:16:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:53,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 10:16:53,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:53,382 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:16:53,461 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:53,461 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:16:53,470 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:16:53,495 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:16:53,498 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:16:53,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 22 treesize of output 10 [2024-11-09 10:16:53,561 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:16:53,648 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:53,648 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:16:53,655 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:16:53,717 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:53,717 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:16:53,727 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:16:53,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:53,767 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:16:53,773 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:16:53,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:53,819 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:16:53,823 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:16:53,840 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:16:53,843 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:16:53,859 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:16:53,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:53,964 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:16:53,977 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:16:54,058 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:16:54,101 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:16:54,178 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:16:54,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415099022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:54,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:54,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-09 10:16:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800361826] [2024-11-09 10:16:54,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:54,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:16:54,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:54,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:16:54,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=695, Unknown=21, NotChecked=290, Total=1122 [2024-11-09 10:16:54,184 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:16:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:57,248 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-11-09 10:16:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:16:57,248 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:16:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:57,251 INFO L225 Difference]: With dead ends: 1387 [2024-11-09 10:16:57,251 INFO L226 Difference]: Without dead ends: 1387 [2024-11-09 10:16:57,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1138, Unknown=21, NotChecked=370, Total=1722 [2024-11-09 10:16:57,252 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 701 mSDsluCounter, 6107 mSDsCounter, 0 mSdLazyCounter, 6076 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:57,252 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.8s Time] [2024-11-09 10:16:57,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-09 10:16:57,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1357. [2024-11-09 10:16:57,262 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:16:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1709 transitions. [2024-11-09 10:16:57,264 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1709 transitions. Word has length 103 [2024-11-09 10:16:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:57,264 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1709 transitions. [2024-11-09 10:16:57,265 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:16:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1709 transitions. [2024-11-09 10:16:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:16:57,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:57,266 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:16:57,287 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:16:57,469 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:16:57,470 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:16:57,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash -891994195, now seen corresponding path program 1 times [2024-11-09 10:16:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163065219] [2024-11-09 10:16:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:16:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:58,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:16:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:58,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163065219] [2024-11-09 10:16:58,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163065219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:58,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:58,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 10:16:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126687410] [2024-11-09 10:16:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:16:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:16:58,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:16:58,263 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:16:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:59,961 INFO L93 Difference]: Finished difference Result 1396 states and 1754 transitions. [2024-11-09 10:16:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:16:59,962 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:16:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:59,965 INFO L225 Difference]: With dead ends: 1396 [2024-11-09 10:16:59,965 INFO L226 Difference]: Without dead ends: 1396 [2024-11-09 10:16:59,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:16:59,966 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 747 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:59,966 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.5s Time] [2024-11-09 10:16:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-09 10:16:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1392. [2024-11-09 10:16:59,980 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:16:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1748 transitions. [2024-11-09 10:16:59,983 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1748 transitions. Word has length 106 [2024-11-09 10:16:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1748 transitions. [2024-11-09 10:16:59,984 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:16:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1748 transitions. [2024-11-09 10:16:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:16:59,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:59,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:59,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 10:16:59,985 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:16:59,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:59,986 INFO L85 PathProgramCache]: Analyzing trace with hash -891994194, now seen corresponding path program 1 times [2024-11-09 10:16:59,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:59,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040052125] [2024-11-09 10:16:59,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:59,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:17:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:01,111 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:17:01,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040052125] [2024-11-09 10:17:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040052125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:17:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135390358] [2024-11-09 10:17:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:01,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:17:01,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:17:01,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:17:01,113 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)