./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-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_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:15:42,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:15:42,788 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:42,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:15:42,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:15:42,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:15:42,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:15:42,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:15:42,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:15:42,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:15:42,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:15:42,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:15:42,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:15:42,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:15:42,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:15:42,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:15:42,826 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:15:42,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:15:42,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:15:42,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:15:42,827 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:15:42,827 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:15:42,828 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:15:42,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:15:42,828 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:15:42,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:15:42,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:15:42,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:15:42,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:15:42,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:15:42,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:15:42,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:15:42,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:15:42,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:15:42,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:15:42,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:15:42,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:15:42,832 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2024-11-09 10:15:43,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:15:43,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:15:43,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:15:43,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:15:43,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:15:43,045 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_test1-1.i [2024-11-09 10:15:44,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:15:44,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:15:44,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test1-1.i [2024-11-09 10:15:44,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a151414d7/7e9aded10fa640fb98329a1c0c04231c/FLAG4aa6c82fc [2024-11-09 10:15:44,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a151414d7/7e9aded10fa640fb98329a1c0c04231c [2024-11-09 10:15:44,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:15:44,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:15:44,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:15:44,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:15:44,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:15:44,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:15:44" (1/1) ... [2024-11-09 10:15:44,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e0ba97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:44, skipping insertion in model container [2024-11-09 10:15:44,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:15:44" (1/1) ... [2024-11-09 10:15:44,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:15:44,906 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:44,939 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:44,946 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:44,951 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:44,957 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:44,972 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:44,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:15:44,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:15:45,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:15:45,103 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:15:45,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:45 WrapperNode [2024-11-09 10:15:45,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:15:45,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:15:45,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:15:45,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:15:45,111 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:45" (1/1) ... [2024-11-09 10:15:45,139 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:45" (1/1) ... [2024-11-09 10:15:45,173 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 805 [2024-11-09 10:15:45,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:15:45,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:15:45,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:15:45,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:15:45,182 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:45" (1/1) ... [2024-11-09 10:15:45,183 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:45" (1/1) ... [2024-11-09 10:15:45,200 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:45" (1/1) ... [2024-11-09 10:15:45,239 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-09 10:15:45,240 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:45" (1/1) ... [2024-11-09 10:15:45,240 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:45" (1/1) ... [2024-11-09 10:15:45,257 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:45" (1/1) ... [2024-11-09 10:15:45,266 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:45" (1/1) ... [2024-11-09 10:15:45,271 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:45" (1/1) ... [2024-11-09 10:15:45,277 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:45" (1/1) ... [2024-11-09 10:15:45,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:15:45,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:15:45,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:15:45,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:15:45,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:45" (1/1) ... [2024-11-09 10:15:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:15:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:15:45,314 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:45,317 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:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:15:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:15:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:15:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:15:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:15:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:15:45,359 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:15:45,360 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:15:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:15:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:15:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:15:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:15:45,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:15:45,494 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:15:45,496 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:15:45,498 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:15:45,539 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:15:46,571 INFO L? ?]: Removed 762 outVars from TransFormulas that were not future-live. [2024-11-09 10:15:46,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:15:46,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:15:46,604 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-09 10:15:46,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:15:46 BoogieIcfgContainer [2024-11-09 10:15:46,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:15:46,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:15:46,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:15:46,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:15:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:15:44" (1/3) ... [2024-11-09 10:15:46,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68443469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:15:46, skipping insertion in model container [2024-11-09 10:15:46,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:15:45" (2/3) ... [2024-11-09 10:15:46,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68443469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:15:46, skipping insertion in model container [2024-11-09 10:15:46,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:15:46" (3/3) ... [2024-11-09 10:15:46,613 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test1-1.i [2024-11-09 10:15:46,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:15:46,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-11-09 10:15:46,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:15:46,689 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;@194edc31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:15:46,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-11-09 10:15:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 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:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:15:46,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:46,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:15:46,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-09 10:15:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122457272] [2024-11-09 10:15:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:46,957 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:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122457272] [2024-11-09 10:15:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122457272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:46,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:15:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906008430] [2024-11-09 10:15:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:47,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:47,006 INFO L87 Difference]: Start difference. First operand has 737 states, 415 states have (on average 2.0626506024096387) internal successors, (856), 732 states have internal predecessors, (856), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:47,496 INFO L93 Difference]: Finished difference Result 680 states and 769 transitions. [2024-11-09 10:15:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:47,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:15:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:47,510 INFO L225 Difference]: With dead ends: 680 [2024-11-09 10:15:47,510 INFO L226 Difference]: Without dead ends: 678 [2024-11-09 10:15:47,512 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:47,514 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 678 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:47,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 469 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-09 10:15:47,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2024-11-09 10:15:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 409 states have (on average 1.8533007334963325) internal successors, (758), 671 states have internal predecessors, (758), 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:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 764 transitions. [2024-11-09 10:15:47,570 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 764 transitions. Word has length 5 [2024-11-09 10:15:47,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:47,570 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 764 transitions. [2024-11-09 10:15:47,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:47,571 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 764 transitions. [2024-11-09 10:15:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 10:15:47,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:47,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:15:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:15:47,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:47,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-09 10:15:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:47,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90154516] [2024-11-09 10:15:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:47,668 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:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90154516] [2024-11-09 10:15:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90154516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:47,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:15:47,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275635066] [2024-11-09 10:15:47,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:47,670 INFO L87 Difference]: Start difference. First operand 676 states and 764 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:48,077 INFO L93 Difference]: Finished difference Result 753 states and 847 transitions. [2024-11-09 10:15:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-09 10:15:48,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:48,082 INFO L225 Difference]: With dead ends: 753 [2024-11-09 10:15:48,082 INFO L226 Difference]: Without dead ends: 753 [2024-11-09 10:15:48,082 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:48,083 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 416 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:48,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 828 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-09 10:15:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 705. [2024-11-09 10:15:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 449 states have (on average 1.8396436525612472) internal successors, (826), 700 states have internal predecessors, (826), 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:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 832 transitions. [2024-11-09 10:15:48,111 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 832 transitions. Word has length 5 [2024-11-09 10:15:48,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:48,111 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 832 transitions. [2024-11-09 10:15:48,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 832 transitions. [2024-11-09 10:15:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:15:48,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:48,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:15:48,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:15:48,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:48,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:48,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1423342697, now seen corresponding path program 1 times [2024-11-09 10:15:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:48,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794520243] [2024-11-09 10:15:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:48,167 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:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794520243] [2024-11-09 10:15:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794520243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:48,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781161368] [2024-11-09 10:15:48,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:48,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:48,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:48,170 INFO L87 Difference]: Start difference. First operand 705 states and 832 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:48,196 INFO L93 Difference]: Finished difference Result 1386 states and 1639 transitions. [2024-11-09 10:15:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-09 10:15:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:48,200 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 10:15:48,200 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 10:15:48,200 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:15:48,201 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 721 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:48,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1498 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 10:15:48,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 706. [2024-11-09 10:15:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 450 states have (on average 1.8377777777777777) internal successors, (827), 701 states have internal predecessors, (827), 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:48,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 833 transitions. [2024-11-09 10:15:48,218 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 833 transitions. Word has length 6 [2024-11-09 10:15:48,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:48,218 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 833 transitions. [2024-11-09 10:15:48,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:48,218 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 833 transitions. [2024-11-09 10:15:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 10:15:48,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:48,219 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:15:48,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:48,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480742, now seen corresponding path program 1 times [2024-11-09 10:15:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836514916] [2024-11-09 10:15:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:48,299 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:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836514916] [2024-11-09 10:15:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836514916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540139045] [2024-11-09 10:15:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:48,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:48,301 INFO L87 Difference]: Start difference. First operand 706 states and 833 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:48,717 INFO L93 Difference]: Finished difference Result 732 states and 886 transitions. [2024-11-09 10:15:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-09 10:15:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:48,720 INFO L225 Difference]: With dead ends: 732 [2024-11-09 10:15:48,720 INFO L226 Difference]: Without dead ends: 732 [2024-11-09 10:15:48,720 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:15:48,721 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 942 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:48,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 730 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-11-09 10:15:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 683. [2024-11-09 10:15:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 450 states have (on average 1.7866666666666666) internal successors, (804), 678 states have internal predecessors, (804), 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:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 810 transitions. [2024-11-09 10:15:48,731 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 810 transitions. Word has length 15 [2024-11-09 10:15:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 810 transitions. [2024-11-09 10:15:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 810 transitions. [2024-11-09 10:15:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 10:15:48,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:48,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:15:48,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:48,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1612480743, now seen corresponding path program 1 times [2024-11-09 10:15:48,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525689693] [2024-11-09 10:15:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:48,780 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:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525689693] [2024-11-09 10:15:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525689693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017484268] [2024-11-09 10:15:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:48,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:48,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:48,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:48,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:48,783 INFO L87 Difference]: Start difference. First operand 683 states and 810 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:48,821 INFO L93 Difference]: Finished difference Result 608 states and 707 transitions. [2024-11-09 10:15:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-09 10:15:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:48,824 INFO L225 Difference]: With dead ends: 608 [2024-11-09 10:15:48,824 INFO L226 Difference]: Without dead ends: 608 [2024-11-09 10:15:48,824 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:15:48,825 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 61 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1177 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:15:48,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-09 10:15:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-11-09 10:15:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 387 states have (on average 1.8113695090439277) internal successors, (701), 603 states have internal predecessors, (701), 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:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 707 transitions. [2024-11-09 10:15:48,839 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 707 transitions. Word has length 15 [2024-11-09 10:15:48,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:48,840 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 707 transitions. [2024-11-09 10:15:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 707 transitions. [2024-11-09 10:15:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 10:15:48,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:48,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:15:48,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -889043613, now seen corresponding path program 1 times [2024-11-09 10:15:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528884841] [2024-11-09 10:15:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:48,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:48,899 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:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528884841] [2024-11-09 10:15:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528884841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703247520] [2024-11-09 10:15:48,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:48,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:48,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:48,901 INFO L87 Difference]: Start difference. First operand 608 states and 707 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:48,944 INFO L93 Difference]: Finished difference Result 590 states and 682 transitions. [2024-11-09 10:15:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:48,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-09 10:15:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:48,947 INFO L225 Difference]: With dead ends: 590 [2024-11-09 10:15:48,947 INFO L226 Difference]: Without dead ends: 590 [2024-11-09 10:15:48,947 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:15:48,948 INFO L432 NwaCegarLoop]: 580 mSDtfsCounter, 41 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1712 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:15:48,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1712 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-09 10:15:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2024-11-09 10:15:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 373 states have (on average 1.804289544235925) internal successors, (673), 582 states have internal predecessors, (673), 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:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 679 transitions. [2024-11-09 10:15:48,957 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 679 transitions. Word has length 17 [2024-11-09 10:15:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:48,957 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 679 transitions. [2024-11-09 10:15:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 679 transitions. [2024-11-09 10:15:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 10:15:48,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:48,958 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] [2024-11-09 10:15:48,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:15:48,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1279459759, now seen corresponding path program 1 times [2024-11-09 10:15:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599192931] [2024-11-09 10:15:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:49,093 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:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599192931] [2024-11-09 10:15:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599192931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:49,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:49,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461878605] [2024-11-09 10:15:49,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:49,096 INFO L87 Difference]: Start difference. First operand 587 states and 679 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:49,530 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-11-09 10:15:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-11-09 10:15:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:49,532 INFO L225 Difference]: With dead ends: 680 [2024-11-09 10:15:49,533 INFO L226 Difference]: Without dead ends: 680 [2024-11-09 10:15:49,533 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:15:49,533 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 417 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:49,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1011 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-09 10:15:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 583. [2024-11-09 10:15:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7935656836461127) internal successors, (669), 578 states have internal predecessors, (669), 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:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 675 transitions. [2024-11-09 10:15:49,546 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 675 transitions. Word has length 31 [2024-11-09 10:15:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 675 transitions. [2024-11-09 10:15:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 675 transitions. [2024-11-09 10:15:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 10:15:49,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:49,550 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] [2024-11-09 10:15:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:15:49,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1848554501, now seen corresponding path program 1 times [2024-11-09 10:15:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282600592] [2024-11-09 10:15:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:49,635 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:49,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:49,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282600592] [2024-11-09 10:15:49,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282600592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:49,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709301668] [2024-11-09 10:15:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:49,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:49,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:49,637 INFO L87 Difference]: Start difference. First operand 583 states and 675 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:49,675 INFO L93 Difference]: Finished difference Result 583 states and 671 transitions. [2024-11-09 10:15:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-09 10:15:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:49,676 INFO L225 Difference]: With dead ends: 583 [2024-11-09 10:15:49,677 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 10:15:49,677 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:15:49,677 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 21 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1694 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:15:49,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1694 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 10:15:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-11-09 10:15:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 373 states have (on average 1.7828418230563003) internal successors, (665), 578 states have internal predecessors, (665), 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:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 671 transitions. [2024-11-09 10:15:49,695 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 671 transitions. Word has length 65 [2024-11-09 10:15:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:49,696 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 671 transitions. [2024-11-09 10:15:49,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 671 transitions. [2024-11-09 10:15:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 10:15:49,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:49,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:49,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:15:49,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:49,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash -516543407, now seen corresponding path program 1 times [2024-11-09 10:15:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056997976] [2024-11-09 10:15:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:49,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:49,806 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:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056997976] [2024-11-09 10:15:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056997976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:49,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:49,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514471154] [2024-11-09 10:15:49,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:49,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:49,810 INFO L87 Difference]: Start difference. First operand 583 states and 671 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:49,842 INFO L93 Difference]: Finished difference Result 679 states and 794 transitions. [2024-11-09 10:15:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:49,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-09 10:15:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:49,844 INFO L225 Difference]: With dead ends: 679 [2024-11-09 10:15:49,844 INFO L226 Difference]: Without dead ends: 679 [2024-11-09 10:15:49,844 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:15:49,845 INFO L432 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:49,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-09 10:15:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-11-09 10:15:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 469 states have (on average 1.6801705756929637) internal successors, (788), 674 states have internal predecessors, (788), 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:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 794 transitions. [2024-11-09 10:15:49,855 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 794 transitions. Word has length 73 [2024-11-09 10:15:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:49,857 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 794 transitions. [2024-11-09 10:15:49,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 794 transitions. [2024-11-09 10:15:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:15:49,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:49,860 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:15:49,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:15:49,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 416038488, now seen corresponding path program 1 times [2024-11-09 10:15:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289309207] [2024-11-09 10:15:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:50,260 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:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:50,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289309207] [2024-11-09 10:15:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289309207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:15:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759235743] [2024-11-09 10:15:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:50,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:50,261 INFO L87 Difference]: Start difference. First operand 679 states and 794 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 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:15:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:50,837 INFO L93 Difference]: Finished difference Result 641 states and 756 transitions. [2024-11-09 10:15:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:50,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 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:15:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:50,839 INFO L225 Difference]: With dead ends: 641 [2024-11-09 10:15:50,840 INFO L226 Difference]: Without dead ends: 641 [2024-11-09 10:15:50,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:50,840 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 472 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:50,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 683 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:15:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-09 10:15:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 601. [2024-11-09 10:15:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 429 states have (on average 1.564102564102564) internal successors, (671), 596 states have internal predecessors, (671), 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:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 677 transitions. [2024-11-09 10:15:50,848 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 677 transitions. Word has length 76 [2024-11-09 10:15:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:50,849 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 677 transitions. [2024-11-09 10:15:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 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:15:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 677 transitions. [2024-11-09 10:15:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:15:50,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:50,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:50,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:15:50,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:50,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash 157004196, now seen corresponding path program 1 times [2024-11-09 10:15:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288809118] [2024-11-09 10:15:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:51,031 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:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288809118] [2024-11-09 10:15:51,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288809118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:51,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:51,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059162906] [2024-11-09 10:15:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:51,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:15:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:51,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:15:51,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:51,033 INFO L87 Difference]: Start difference. First operand 601 states and 677 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:51,420 INFO L93 Difference]: Finished difference Result 600 states and 676 transitions. [2024-11-09 10:15:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 10:15:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:51,423 INFO L225 Difference]: With dead ends: 600 [2024-11-09 10:15:51,423 INFO L226 Difference]: Without dead ends: 600 [2024-11-09 10:15:51,423 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:15:51,424 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 2 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:51,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-09 10:15:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-09 10:15:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 429 states have (on average 1.5617715617715617) internal successors, (670), 595 states have internal predecessors, (670), 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:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-09 10:15:51,432 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 81 [2024-11-09 10:15:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:51,432 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-09 10:15:51,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-09 10:15:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:15:51,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:51,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:51,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:15:51,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:51,434 INFO L85 PathProgramCache]: Analyzing trace with hash 157004197, now seen corresponding path program 1 times [2024-11-09 10:15:51,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:51,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321868457] [2024-11-09 10:15:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:51,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:51,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:15:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321868457] [2024-11-09 10:15:51,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321868457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:51,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547441268] [2024-11-09 10:15:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:15:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:15:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:51,752 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:52,195 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2024-11-09 10:15:52,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:52,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 10:15:52,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:52,197 INFO L225 Difference]: With dead ends: 599 [2024-11-09 10:15:52,197 INFO L226 Difference]: Without dead ends: 599 [2024-11-09 10:15:52,198 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:15:52,198 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:52,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1515 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 10:15:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2024-11-09 10:15:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2024-11-09 10:15:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 428 states have (on average 1.5630841121495327) internal successors, (669), 594 states have internal predecessors, (669), 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:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 675 transitions. [2024-11-09 10:15:52,208 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 675 transitions. Word has length 81 [2024-11-09 10:15:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:52,208 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 675 transitions. [2024-11-09 10:15:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 675 transitions. [2024-11-09 10:15:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:15:52,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:52,210 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] [2024-11-09 10:15:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:15:52,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 896889099, now seen corresponding path program 1 times [2024-11-09 10:15:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218986178] [2024-11-09 10:15:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:52,387 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:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:52,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218986178] [2024-11-09 10:15:52,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218986178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:52,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:52,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:15:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237069140] [2024-11-09 10:15:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:52,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:15:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:15:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:52,390 INFO L87 Difference]: Start difference. First operand 599 states and 675 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:15:52,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:52,911 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-09 10:15:52,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:15:52,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-09 10:15:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:52,915 INFO L225 Difference]: With dead ends: 611 [2024-11-09 10:15:52,915 INFO L226 Difference]: Without dead ends: 611 [2024-11-09 10:15:52,915 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:15:52,916 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 10 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:52,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:15:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-09 10:15:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2024-11-09 10:15:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 599 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 10:15:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 685 transitions. [2024-11-09 10:15:52,924 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 685 transitions. Word has length 89 [2024-11-09 10:15:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:52,924 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 685 transitions. [2024-11-09 10:15:52,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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:15:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 685 transitions. [2024-11-09 10:15:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:15:52,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:52,925 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] [2024-11-09 10:15:52,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:15:52,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:52,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash 896889100, now seen corresponding path program 1 times [2024-11-09 10:15:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522394346] [2024-11-09 10:15:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:53,293 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:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522394346] [2024-11-09 10:15:53,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522394346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:53,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:15:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430186160] [2024-11-09 10:15:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:53,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:15:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:53,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:15:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:53,295 INFO L87 Difference]: Start difference. First operand 605 states and 685 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:15:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:53,783 INFO L93 Difference]: Finished difference Result 605 states and 684 transitions. [2024-11-09 10:15:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:53,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-09 10:15:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:53,786 INFO L225 Difference]: With dead ends: 605 [2024-11-09 10:15:53,786 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 10:15:53,786 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:15:53,786 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 5 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:53,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1950 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:15:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 10:15:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-09 10:15:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 433 states have (on average 1.5588914549653579) internal successors, (675), 599 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 10:15:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2024-11-09 10:15:53,796 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 89 [2024-11-09 10:15:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2024-11-09 10:15:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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:15:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2024-11-09 10:15:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:15:53,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:53,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:53,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:15:53,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:53,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash -962114482, now seen corresponding path program 1 times [2024-11-09 10:15:53,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:53,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238636416] [2024-11-09 10:15:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:54,143 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:15:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238636416] [2024-11-09 10:15:54,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238636416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:15:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206203789] [2024-11-09 10:15:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:54,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:15:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:15:54,146 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:15:54,147 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:15:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:54,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:15:54,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:54,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:15:54,385 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:15:54,396 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:15:54,449 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:15:54,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:15:54,470 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:15:54,473 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:15:54,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:54,507 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:15:54,507 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:15:54,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206203789] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:15:54,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2024-11-09 10:15:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256791699] [2024-11-09 10:15:54,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:15:54,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:15:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=198, Unknown=4, NotChecked=0, Total=240 [2024-11-09 10:15:54,536 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:15:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:55,502 INFO L93 Difference]: Finished difference Result 604 states and 683 transitions. [2024-11-09 10:15:55,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:15:55,503 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-09 10:15:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:55,505 INFO L225 Difference]: With dead ends: 604 [2024-11-09 10:15:55,505 INFO L226 Difference]: Without dead ends: 604 [2024-11-09 10:15:55,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=454, Unknown=5, NotChecked=0, Total=552 [2024-11-09 10:15:55,507 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 483 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:55,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2776 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:15:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-09 10:15:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2024-11-09 10:15:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 433 states have (on average 1.556581986143187) internal successors, (674), 598 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 10:15:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 683 transitions. [2024-11-09 10:15:55,515 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 683 transitions. Word has length 90 [2024-11-09 10:15:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 683 transitions. [2024-11-09 10:15:55,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:15:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 683 transitions. [2024-11-09 10:15:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:15:55,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:55,516 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] [2024-11-09 10:15:55,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:15:55,720 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,SelfDestructingSolverStorable14 [2024-11-09 10:15:55,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:55,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -962114481, now seen corresponding path program 1 times [2024-11-09 10:15:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232860734] [2024-11-09 10:15:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:56,247 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:15:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232860734] [2024-11-09 10:15:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232860734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:15:56,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410635097] [2024-11-09 10:15:56,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:56,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:15:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:15:56,249 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:15:56,251 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:15:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:56,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 10:15:56,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:56,481 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:15:56,482 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:15:56,486 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:15:56,500 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:15:56,504 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:15:56,562 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:15:56,566 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:15:56,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:15:56,666 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:15:56,671 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:15:56,695 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:15:56,698 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:15:56,701 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:15:56,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:56,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_639 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_639 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:15:56,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410635097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:15:56,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:56,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-09 10:15:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669012106] [2024-11-09 10:15:56,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:56,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:15:56,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:56,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:15:56,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 10:15:56,769 INFO L87 Difference]: Start difference. First operand 604 states and 683 transitions. Second operand has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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:15:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:58,052 INFO L93 Difference]: Finished difference Result 611 states and 690 transitions. [2024-11-09 10:15:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:15:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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 90 [2024-11-09 10:15:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:58,054 INFO L225 Difference]: With dead ends: 611 [2024-11-09 10:15:58,054 INFO L226 Difference]: Without dead ends: 611 [2024-11-09 10:15:58,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-09 10:15:58,055 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 480 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:58,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 3042 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:15:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-09 10:15:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 602. [2024-11-09 10:15:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 432 states have (on average 1.5555555555555556) internal successors, (672), 596 states have internal predecessors, (672), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:15:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2024-11-09 10:15:58,064 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 90 [2024-11-09 10:15:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2024-11-09 10:15:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.384615384615385) internal successors, (109), 15 states have internal predecessors, (109), 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:15:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2024-11-09 10:15:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:15:58,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:58,066 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] [2024-11-09 10:15:58,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:58,269 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,SelfDestructingSolverStorable15 [2024-11-09 10:15:58,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash 232210623, now seen corresponding path program 1 times [2024-11-09 10:15:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:58,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399666725] [2024-11-09 10:15:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:58,624 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,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399666725] [2024-11-09 10:15:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399666725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:15:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093496478] [2024-11-09 10:15:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:58,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:15:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:58,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:15:58,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:15:58,627 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:15:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:59,501 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-09 10:15:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:15:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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 92 [2024-11-09 10:15:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:59,504 INFO L225 Difference]: With dead ends: 615 [2024-11-09 10:15:59,504 INFO L226 Difference]: Without dead ends: 615 [2024-11-09 10:15:59,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:15:59,505 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 489 mSDsluCounter, 2754 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:59,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3078 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:15:59,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-09 10:15:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 611. [2024-11-09 10:15:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.55) internal successors, (682), 604 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:15:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 689 transitions. [2024-11-09 10:15:59,512 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 689 transitions. Word has length 92 [2024-11-09 10:15:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:59,512 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 689 transitions. [2024-11-09 10:15:59,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:15:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 689 transitions. [2024-11-09 10:15:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:15:59,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:59,514 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] [2024-11-09 10:15:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:15:59,514 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:15:59,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 232210624, now seen corresponding path program 1 times [2024-11-09 10:15:59,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:15:59,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495156705] [2024-11-09 10:15:59,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:59,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:15:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:15:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:59,983 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,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:15:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495156705] [2024-11-09 10:15:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495156705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:15:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108912324] [2024-11-09 10:15:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:15:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:15:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:15:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:15:59,986 INFO L87 Difference]: Start difference. First operand 611 states and 689 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:00,760 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-09 10:16:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:16:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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 92 [2024-11-09 10:16:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:00,763 INFO L225 Difference]: With dead ends: 614 [2024-11-09 10:16:00,763 INFO L226 Difference]: Without dead ends: 614 [2024-11-09 10:16:00,763 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:00,763 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 500 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:00,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1880 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:16:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-09 10:16:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-09 10:16:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 440 states have (on average 1.5477272727272726) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-09 10:16:00,771 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 92 [2024-11-09 10:16:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:00,771 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-09 10:16:00,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-09 10:16:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:16:00,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:00,772 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:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:16:00,772 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156324, now seen corresponding path program 1 times [2024-11-09 10:16:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:00,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701550840] [2024-11-09 10:16:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:00,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:01,102 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:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701550840] [2024-11-09 10:16:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701550840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42536911] [2024-11-09 10:16:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:01,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:01,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:01,105 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:01,106 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:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:01,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 10:16:01,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:01,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:01,346 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:01,351 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:01,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:01,416 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:01,465 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:01,466 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:01,474 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:01,476 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:01,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:01,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:16:01,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_894) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:16:01,531 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 10:16:01,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-09 10:16:01,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42536911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:01,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:01,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 17 [2024-11-09 10:16:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965318442] [2024-11-09 10:16:01,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:01,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:16:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:16:01,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=8, NotChecked=70, Total=420 [2024-11-09 10:16:01,561 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:16:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:02,610 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-09 10:16:02,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:02,611 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-09 10:16:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:02,613 INFO L225 Difference]: With dead ends: 613 [2024-11-09 10:16:02,613 INFO L226 Difference]: Without dead ends: 613 [2024-11-09 10:16:02,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=8, NotChecked=102, Total=812 [2024-11-09 10:16:02,614 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 479 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 2807 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 3741 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:02,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 3741 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:16:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-09 10:16:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 610. [2024-11-09 10:16:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 440 states have (on average 1.5454545454545454) internal successors, (680), 603 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 687 transitions. [2024-11-09 10:16:02,621 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 687 transitions. Word has length 93 [2024-11-09 10:16:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:02,621 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 687 transitions. [2024-11-09 10:16:02,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:16:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 687 transitions. [2024-11-09 10:16:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:16:02,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:02,622 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:02,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:16:02,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:02,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:02,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156323, now seen corresponding path program 1 times [2024-11-09 10:16:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:02,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220921681] [2024-11-09 10:16:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:03,355 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:03,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:03,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220921681] [2024-11-09 10:16:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220921681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:03,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076765068] [2024-11-09 10:16:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:03,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:03,358 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:03,358 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:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:03,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 10:16:03,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:03,578 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:03,578 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:03,598 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:03,601 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:03,743 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:03,743 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:03,747 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:03,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:03,802 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:03,809 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:03,820 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:03,824 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:03,825 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:03,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:03,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1037 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:16:03,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:16:03,978 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 84 treesize of output 88 [2024-11-09 10:16:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076765068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:04,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2024-11-09 10:16:04,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936068017] [2024-11-09 10:16:04,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:04,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:16:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:04,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:16:04,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=509, Unknown=13, NotChecked=46, Total=650 [2024-11-09 10:16:04,057 INFO L87 Difference]: Start difference. First operand 610 states and 687 transitions. Second operand has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:05,062 INFO L93 Difference]: Finished difference Result 612 states and 691 transitions. [2024-11-09 10:16:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:16:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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 93 [2024-11-09 10:16:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:05,064 INFO L225 Difference]: With dead ends: 612 [2024-11-09 10:16:05,064 INFO L226 Difference]: Without dead ends: 612 [2024-11-09 10:16:05,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=783, Unknown=14, NotChecked=58, Total=992 [2024-11-09 10:16:05,065 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 496 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:05,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2834 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:16:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-11-09 10:16:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2024-11-09 10:16:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 594 states have internal predecessors, (670), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:16:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 676 transitions. [2024-11-09 10:16:05,072 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 676 transitions. Word has length 93 [2024-11-09 10:16:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 676 transitions. [2024-11-09 10:16:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.611111111111111) internal successors, (119), 19 states have internal predecessors, (119), 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:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 676 transitions. [2024-11-09 10:16:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:16:05,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:05,073 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:05,088 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:05,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:05,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026382, now seen corresponding path program 1 times [2024-11-09 10:16:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:05,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536327373] [2024-11-09 10:16:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:05,673 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,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536327373] [2024-11-09 10:16:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536327373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:05,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:16:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735804683] [2024-11-09 10:16:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:05,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:16:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:16:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:16:05,675 INFO L87 Difference]: Start difference. First operand 600 states and 676 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:06,667 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-09 10:16:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:16:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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 95 [2024-11-09 10:16:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:06,669 INFO L225 Difference]: With dead ends: 616 [2024-11-09 10:16:06,669 INFO L226 Difference]: Without dead ends: 616 [2024-11-09 10:16:06,669 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:06,670 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 502 mSDsluCounter, 3050 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:06,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 3373 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:16:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-09 10:16:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 612. [2024-11-09 10:16:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5417607223476297) internal successors, (683), 605 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 690 transitions. [2024-11-09 10:16:06,676 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 690 transitions. Word has length 95 [2024-11-09 10:16:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:06,676 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 690 transitions. [2024-11-09 10:16:06,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 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:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 690 transitions. [2024-11-09 10:16:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:16:06,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:06,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 10:16:06,677 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:06,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1405026381, now seen corresponding path program 1 times [2024-11-09 10:16:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654916965] [2024-11-09 10:16:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:07,180 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,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:07,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654916965] [2024-11-09 10:16:07,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654916965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:07,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:07,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:16:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25517365] [2024-11-09 10:16:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:07,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:16:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:16:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:16:07,183 INFO L87 Difference]: Start difference. First operand 612 states and 690 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:08,148 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-09 10:16:08,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:16:08,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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 95 [2024-11-09 10:16:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:08,151 INFO L225 Difference]: With dead ends: 615 [2024-11-09 10:16:08,151 INFO L226 Difference]: Without dead ends: 615 [2024-11-09 10:16:08,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:16:08,152 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 483 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2480 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:16:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-09 10:16:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-09 10:16:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 443 states have (on average 1.5395033860045146) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-09 10:16:08,164 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 95 [2024-11-09 10:16:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:08,164 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-09 10:16:08,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 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:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-09 10:16:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:16:08,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:08,165 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:08,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 10:16:08,165 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080267, now seen corresponding path program 1 times [2024-11-09 10:16:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191138617] [2024-11-09 10:16:08,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:08,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:08,637 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:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191138617] [2024-11-09 10:16:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191138617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112393974] [2024-11-09 10:16:08,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:08,640 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:08,642 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:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:08,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:16:08,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:08,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:08,874 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:08,879 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:08,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:08,926 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:08,961 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:08,961 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:09,000 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:09,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:09,009 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:09,012 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:09,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:09,162 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-09 10:16:09,162 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 57 treesize of output 56 [2024-11-09 10:16:09,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1322 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1326))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 10:16:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112393974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:09,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2024-11-09 10:16:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486541030] [2024-11-09 10:16:09,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:09,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:16:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:09,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:16:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=397, Unknown=36, NotChecked=42, Total=552 [2024-11-09 10:16:09,169 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:16:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:10,117 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-09 10:16:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:16:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:10,120 INFO L225 Difference]: With dead ends: 614 [2024-11-09 10:16:10,120 INFO L226 Difference]: Without dead ends: 614 [2024-11-09 10:16:10,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=796, Unknown=45, NotChecked=60, Total=1056 [2024-11-09 10:16:10,121 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 493 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:10,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 3411 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:16:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-09 10:16:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2024-11-09 10:16:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 443 states have (on average 1.5372460496613995) internal successors, (681), 604 states have internal predecessors, (681), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 688 transitions. [2024-11-09 10:16:10,128 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 688 transitions. Word has length 96 [2024-11-09 10:16:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:10,128 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 688 transitions. [2024-11-09 10:16:10,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:16:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 688 transitions. [2024-11-09 10:16:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:16:10,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:10,129 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:10,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:10,333 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,SelfDestructingSolverStorable22 [2024-11-09 10:16:10,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:10,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1583080266, now seen corresponding path program 1 times [2024-11-09 10:16:10,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996290177] [2024-11-09 10:16:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:10,905 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:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996290177] [2024-11-09 10:16:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996290177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728114728] [2024-11-09 10:16:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:10,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:10,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:10,908 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:10,909 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:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:11,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:16:11,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:11,160 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:11,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:11,164 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:11,176 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:11,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:11,245 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:11,277 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 10:16:11,278 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 69 treesize of output 41 [2024-11-09 10:16:11,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:16:11,373 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 10:16:11,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2024-11-09 10:16:11,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-09 10:16:11,381 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 51 treesize of output 32 [2024-11-09 10:16:11,413 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 39 treesize of output 21 [2024-11-09 10:16:11,416 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 34 treesize of output 16 [2024-11-09 10:16:11,434 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,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:11,663 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 891 treesize of output 855 [2024-11-09 10:16:11,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 643 treesize of output 635 [2024-11-09 10:16:11,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 635 treesize of output 627 [2024-11-09 10:16:11,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 627 treesize of output 619 [2024-11-09 10:16:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 619 treesize of output 611 [2024-11-09 10:16:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728114728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:11,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:11,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-09 10:16:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133278224] [2024-11-09 10:16:11,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:11,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:16:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:16:11,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=814, Unknown=5, NotChecked=0, Total=930 [2024-11-09 10:16:11,816 INFO L87 Difference]: Start difference. First operand 611 states and 688 transitions. Second operand has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:13,061 INFO L93 Difference]: Finished difference Result 613 states and 692 transitions. [2024-11-09 10:16:13,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:16:13,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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 96 [2024-11-09 10:16:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:13,063 INFO L225 Difference]: With dead ends: 613 [2024-11-09 10:16:13,063 INFO L226 Difference]: Without dead ends: 613 [2024-11-09 10:16:13,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1209, Unknown=5, NotChecked=0, Total=1406 [2024-11-09 10:16:13,064 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 495 mSDsluCounter, 3055 mSDsCounter, 0 mSdLazyCounter, 3177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:13,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3381 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3177 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:16:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-09 10:16:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 598. [2024-11-09 10:16:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 432 states have (on average 1.5462962962962963) internal successors, (668), 592 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:16:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 674 transitions. [2024-11-09 10:16:13,070 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 674 transitions. Word has length 96 [2024-11-09 10:16:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:13,070 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 674 transitions. [2024-11-09 10:16:13,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 24 states have internal predecessors, (127), 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:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 674 transitions. [2024-11-09 10:16:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:16:13,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:13,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:13,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:13,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:13,271 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:13,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:13,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945286, now seen corresponding path program 1 times [2024-11-09 10:16:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308578273] [2024-11-09 10:16:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:13,687 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:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308578273] [2024-11-09 10:16:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308578273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:13,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:13,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:16:13,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537645631] [2024-11-09 10:16:13,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:13,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:16:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:13,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:16:13,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:16:13,689 INFO L87 Difference]: Start difference. First operand 598 states and 674 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:14,611 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-09 10:16:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:16:14,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:16:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:14,613 INFO L225 Difference]: With dead ends: 617 [2024-11-09 10:16:14,613 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 10:16:14,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:16:14,614 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 507 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:14,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 3091 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:16:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 10:16:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2024-11-09 10:16:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 606 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 691 transitions. [2024-11-09 10:16:14,620 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 691 transitions. Word has length 98 [2024-11-09 10:16:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:14,620 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 691 transitions. [2024-11-09 10:16:14,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 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:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 691 transitions. [2024-11-09 10:16:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 10:16:14,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:14,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:16:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 10:16:14,625 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:14,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1610945287, now seen corresponding path program 1 times [2024-11-09 10:16:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396897475] [2024-11-09 10:16:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:15,161 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:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396897475] [2024-11-09 10:16:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396897475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:16:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113798591] [2024-11-09 10:16:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:16:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:15,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:16:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:16:15,165 INFO L87 Difference]: Start difference. First operand 613 states and 691 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:16,022 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-09 10:16:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:16:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-09 10:16:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:16,025 INFO L225 Difference]: With dead ends: 616 [2024-11-09 10:16:16,025 INFO L226 Difference]: Without dead ends: 616 [2024-11-09 10:16:16,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:16:16,025 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 483 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:16,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 2115 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:16:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-09 10:16:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 613. [2024-11-09 10:16:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 446 states have (on average 1.531390134529148) internal successors, (683), 606 states have internal predecessors, (683), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 690 transitions. [2024-11-09 10:16:16,031 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 690 transitions. Word has length 98 [2024-11-09 10:16:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:16,031 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 690 transitions. [2024-11-09 10:16:16,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 690 transitions. [2024-11-09 10:16:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:16:16,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:16,032 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:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 10:16:16,032 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:16,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267811, now seen corresponding path program 1 times [2024-11-09 10:16:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:16,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841651839] [2024-11-09 10:16:16,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:16,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:16,475 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,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841651839] [2024-11-09 10:16:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841651839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482398274] [2024-11-09 10:16:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:16,478 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:16,478 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:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:16,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 10:16:16,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:16,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:16,695 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,699 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,746 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:16,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:16:16,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:16,779 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:16,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:16,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 42 treesize of output 41 [2024-11-09 10:16:16,857 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:16,857 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:16,866 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,870 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,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:16,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1788) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:16:16,904 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:16:16,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1787 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1787))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1788)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:16:17,002 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-09 10:16:17,002 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 105 treesize of output 104 [2024-11-09 10:16:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482398274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:17,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2024-11-09 10:16:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764525532] [2024-11-09 10:16:17,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 10:16:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 10:16:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=478, Unknown=39, NotChecked=144, Total=756 [2024-11-09 10:16:17,041 INFO L87 Difference]: Start difference. First operand 613 states and 690 transitions. Second operand has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:16:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:17,934 INFO L93 Difference]: Finished difference Result 615 states and 694 transitions. [2024-11-09 10:16:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:16:17,934 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 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:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:17,936 INFO L225 Difference]: With dead ends: 615 [2024-11-09 10:16:17,936 INFO L226 Difference]: Without dead ends: 615 [2024-11-09 10:16:17,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=970, Unknown=46, NotChecked=204, Total=1406 [2024-11-09 10:16:17,936 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 475 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:17,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 3069 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:16:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-09 10:16:17,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 612. [2024-11-09 10:16:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 446 states have (on average 1.5291479820627802) internal successors, (682), 605 states have internal predecessors, (682), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 689 transitions. [2024-11-09 10:16:17,942 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 689 transitions. Word has length 99 [2024-11-09 10:16:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:17,942 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 689 transitions. [2024-11-09 10:16:17,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:16:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 689 transitions. [2024-11-09 10:16:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:16:17,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:17,942 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:17,957 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:18,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:18,143 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:18,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:18,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1492267812, now seen corresponding path program 1 times [2024-11-09 10:16:18,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:18,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066122775] [2024-11-09 10:16:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:18,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:18,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:18,709 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:18,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066122775] [2024-11-09 10:16:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066122775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:18,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601897611] [2024-11-09 10:16:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:18,712 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:18,712 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:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:18,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 10:16:18,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:18,932 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:18,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:18,938 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:18,957 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:18,961 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:19,011 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:19,016 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:19,083 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:19,083 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:19,086 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:19,142 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:19,142 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:19,148 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:19,186 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:19,187 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:19,190 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:19,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:19,223 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:19,225 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:19,236 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:19,239 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:19,251 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:19,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:19,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int))) (<= (+ 24 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1961 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem55#1.base| v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:16:19,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1958))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1959) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:16:19,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) .cse1 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1959) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-09 10:16:19,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1956) .cse0 v_ArrVal_1959) (select (select (store .cse1 .cse0 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1957))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1958))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1956) .cse3 v_ArrVal_1959) .cse4 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:16:19,397 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1956) .cse1 v_ArrVal_1959) (select (select (store .cse2 .cse1 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1957))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1958))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1956) .cse4 v_ArrVal_1959) .cse5 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-09 10:16:19,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1957))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1958))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse0 v_ArrVal_1956) .cse1 v_ArrVal_1959) .cse2 v_ArrVal_1961) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1960) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1967 (Array Int Int)) (v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1966 (Array Int Int)) (v_ArrVal_1961 (Array Int Int)) (v_ArrVal_1959 (Array Int Int)) (v_ArrVal_1958 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1966))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1957))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_1967) .cse7 v_ArrVal_1956) .cse8 v_ArrVal_1959) (select (select (store .cse9 .cse8 v_ArrVal_1958) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1961))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-09 10:16:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601897611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:19,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-09 10:16:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803671665] [2024-11-09 10:16:19,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:16:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:16:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=650, Unknown=15, NotChecked=342, Total=1122 [2024-11-09 10:16:19,456 INFO L87 Difference]: Start difference. First operand 612 states and 689 transitions. Second operand has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:20,818 INFO L93 Difference]: Finished difference Result 614 states and 693 transitions. [2024-11-09 10:16:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:16:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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 99 [2024-11-09 10:16:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:20,820 INFO L225 Difference]: With dead ends: 614 [2024-11-09 10:16:20,820 INFO L226 Difference]: Without dead ends: 614 [2024-11-09 10:16:20,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1078, Unknown=15, NotChecked=438, Total=1722 [2024-11-09 10:16:20,821 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 477 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 3360 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:20,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3180 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3360 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:16:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-09 10:16:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 596. [2024-11-09 10:16:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 432 states have (on average 1.5416666666666667) internal successors, (666), 590 states have internal predecessors, (666), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:16:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2024-11-09 10:16:20,827 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 99 [2024-11-09 10:16:20,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:20,827 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2024-11-09 10:16:20,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.045454545454546) internal successors, (133), 24 states have internal predecessors, (133), 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:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2024-11-09 10:16:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:16:20,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:20,829 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:20,842 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:21,029 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,SelfDestructingSolverStorable27 [2024-11-09 10:16:21,029 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:21,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -490544312, now seen corresponding path program 1 times [2024-11-09 10:16:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229185402] [2024-11-09 10:16:21,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:21,539 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,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:21,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229185402] [2024-11-09 10:16:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229185402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:16:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424370577] [2024-11-09 10:16:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:21,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:16:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:16:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:16:21,542 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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:22,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:22,384 INFO L93 Difference]: Finished difference Result 619 states and 698 transitions. [2024-11-09 10:16:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:16:22,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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:22,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:22,386 INFO L225 Difference]: With dead ends: 619 [2024-11-09 10:16:22,386 INFO L226 Difference]: Without dead ends: 619 [2024-11-09 10:16:22,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:16:22,387 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 504 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:22,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2774 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:16:22,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-09 10:16:22,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 615. [2024-11-09 10:16:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5244444444444445) internal successors, (686), 608 states have internal predecessors, (686), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 693 transitions. [2024-11-09 10:16:22,392 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 693 transitions. Word has length 102 [2024-11-09 10:16:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 693 transitions. [2024-11-09 10:16:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 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:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 693 transitions. [2024-11-09 10:16:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:16:22,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:22,393 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:22,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 10:16:22,394 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash -490544311, now seen corresponding path program 1 times [2024-11-09 10:16:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:22,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314065636] [2024-11-09 10:16:22,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:22,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:23,163 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:23,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:23,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314065636] [2024-11-09 10:16:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314065636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:16:23,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:16:23,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:16:23,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742132728] [2024-11-09 10:16:23,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:16:23,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:16:23,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:23,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:16:23,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:16:23,164 INFO L87 Difference]: Start difference. First operand 615 states and 693 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 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:24,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:24,664 INFO L93 Difference]: Finished difference Result 618 states and 697 transitions. [2024-11-09 10:16:24,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:16:24,664 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 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:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:24,666 INFO L225 Difference]: With dead ends: 618 [2024-11-09 10:16:24,666 INFO L226 Difference]: Without dead ends: 618 [2024-11-09 10:16:24,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-09 10:16:24,666 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 487 mSDsluCounter, 3051 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:24,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 3373 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:16:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-09 10:16:24,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2024-11-09 10:16:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 450 states have (on average 1.5222222222222221) internal successors, (685), 608 states have internal predecessors, (685), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 692 transitions. [2024-11-09 10:16:24,671 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 692 transitions. Word has length 102 [2024-11-09 10:16:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:24,672 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 692 transitions. [2024-11-09 10:16:24,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 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:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 692 transitions. [2024-11-09 10:16:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:16:24,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:24,672 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:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 10:16:24,673 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492837, now seen corresponding path program 1 times [2024-11-09 10:16:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:24,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459618278] [2024-11-09 10:16:24,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:25,170 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:25,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459618278] [2024-11-09 10:16:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459618278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782780122] [2024-11-09 10:16:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:25,171 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:16:25,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:16:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:25,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:16:25,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:25,411 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:25,411 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:25,420 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:25,479 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:25,480 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:25,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:25,510 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:25,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:25,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:16:25,566 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:25,566 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:25,597 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:25,597 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:25,603 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:25,613 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 10:16:25,613 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 19 treesize of output 16 [2024-11-09 10:16:25,615 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:25,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:26,051 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2024-11-09 10:16:26,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 597 treesize of output 794 [2024-11-09 10:16:26,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2308 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem51#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2308))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2301)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2302)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2303)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2304)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 10:16:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782780122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:26,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 23 [2024-11-09 10:16:26,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981554504] [2024-11-09 10:16:26,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:26,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:16:26,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:16:26,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=932, Unknown=43, NotChecked=64, Total=1190 [2024-11-09 10:16:26,072 INFO L87 Difference]: Start difference. First operand 615 states and 692 transitions. Second operand has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:16:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:16:27,118 INFO L93 Difference]: Finished difference Result 617 states and 696 transitions. [2024-11-09 10:16:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 10:16:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-09 10:16:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:16:27,120 INFO L225 Difference]: With dead ends: 617 [2024-11-09 10:16:27,120 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 10:16:27,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1663, Unknown=43, NotChecked=86, Total=2070 [2024-11-09 10:16:27,121 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 474 mSDsluCounter, 3334 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:16:27,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 3655 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:16:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 10:16:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2024-11-09 10:16:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 450 states have (on average 1.52) internal successors, (684), 607 states have internal predecessors, (684), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 10:16:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2024-11-09 10:16:27,126 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 103 [2024-11-09 10:16:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:16:27,126 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2024-11-09 10:16:27,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:16:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2024-11-09 10:16:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:16:27,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:16:27,127 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:27,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:16:27,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:27,327 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:16:27,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:16:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1639492838, now seen corresponding path program 1 times [2024-11-09 10:16:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:16:27,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777484909] [2024-11-09 10:16:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:27,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:16:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:16:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:28,135 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,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:16:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777484909] [2024-11-09 10:16:28,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777484909] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:28,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238069075] [2024-11-09 10:16:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:16:28,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:16:28,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:16:28,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:16:28,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 10:16:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:16:28,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 10:16:28,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:16:28,385 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:28,385 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:28,388 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:28,393 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,396 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,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:16:28,432 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,532 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:16:28,537 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,589 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:16:28,592 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,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:16:28,656 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,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:16:28,740 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,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:28,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 10:16:28,797 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,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-09 10:16:28,812 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,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:16:28,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-11-09 10:16:28,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:16:28,827 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:28,829 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,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:29,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2490))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2491))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2489) .cse0 v_ArrVal_2492) .cse1 v_ArrVal_2493) (select (select (store .cse2 .cse1 v_ArrVal_2494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2496))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2497 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2490))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2491))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2494))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2489) .cse5 v_ArrVal_2492) .cse6 v_ArrVal_2493) .cse7 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse8 .cse7 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0)))))) is different from false [2024-11-09 10:16:29,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (< 0 (+ (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) (select (select (store .cse3 .cse2 v_ArrVal_2494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2496))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_2490 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (or (forall ((v_ArrVal_2497 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2490))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_2491))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2494))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2489) .cse6 v_ArrVal_2492) .cse7 v_ArrVal_2493) .cse8 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse9 .cse8 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc58#1.base_7|) 0))))))) is different from false [2024-11-09 10:16:29,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:16:29,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 604 treesize of output 622 [2024-11-09 10:16:34,573 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc58#1.base_7| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc58#1.base_7| |c_ULTIMATE.start_main_#t~mem51#1.base|) (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2497 Int) (v_ArrVal_2496 (Array Int Int)) (v_ArrVal_2495 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2493 (Array Int Int)) (v_ArrVal_2492 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2502))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2490))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2491))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2494))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ 3 (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_ArrVal_2503) .cse0 v_ArrVal_2489) .cse1 v_ArrVal_2492) .cse2 v_ArrVal_2493) .cse3 v_ArrVal_2496) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc58#1.base_7| v_ArrVal_2497) (select (select (store .cse5 .cse3 v_ArrVal_2495) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))) (forall ((v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_16 (Array Int Int))) (< 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_19))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_prenex_16))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_prenex_25))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem51#1.base| v_prenex_18) .cse9 v_prenex_20) .cse10 v_prenex_24) .cse11 v_prenex_23) (select (select (store .cse12 .cse11 v_prenex_22) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_prenex_21))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))))) is different from false [2024-11-09 10:16:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238069075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:34,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:16:34,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25 [2024-11-09 10:16:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95371381] [2024-11-09 10:16:34,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:16:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:16:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:16:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:16:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1019, Unknown=32, NotChecked=204, Total=1406 [2024-11-09 10:16:34,604 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:17:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:17:01,910 INFO L93 Difference]: Finished difference Result 616 states and 695 transitions. [2024-11-09 10:17:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 10:17:01,911 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2024-11-09 10:17:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:17:01,912 INFO L225 Difference]: With dead ends: 616 [2024-11-09 10:17:01,912 INFO L226 Difference]: Without dead ends: 616 [2024-11-09 10:17:01,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=289, Invalid=2043, Unknown=32, NotChecked=288, Total=2652 [2024-11-09 10:17:01,913 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 495 mSDsluCounter, 4074 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 4393 SdHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:17:01,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 4393 Invalid, 5251 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 24.9s Time] [2024-11-09 10:17:01,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-09 10:17:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 594. [2024-11-09 10:17:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 432 states have (on average 1.537037037037037) internal successors, (664), 588 states have internal predecessors, (664), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:17:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 670 transitions. [2024-11-09 10:17:01,918 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 670 transitions. Word has length 103 [2024-11-09 10:17:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:17:01,918 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 670 transitions. [2024-11-09 10:17:01,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.375) internal successors, (129), 24 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:17:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 670 transitions. [2024-11-09 10:17:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 10:17:01,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:17:01,919 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] [2024-11-09 10:17:01,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 10:17:02,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-09 10:17:02,119 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-11-09 10:17:02,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:17:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1968749023, now seen corresponding path program 1 times [2024-11-09 10:17:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:17:02,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427347082] [2024-11-09 10:17:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:17:02,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:17:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 10:17:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:17:03,683 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:03,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:17:03,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427347082] [2024-11-09 10:17:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427347082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:17:03,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:17:03,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:17:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194467275] [2024-11-09 10:17:03,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:17:03,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:17:03,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:17:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:17:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:17:03,685 INFO L87 Difference]: Start difference. First operand 594 states and 670 transitions. Second operand has 16 states, 15 states have (on average 6.866666666666666) internal successors, (103), 15 states have internal predecessors, (103), 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)