./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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_BER_test4-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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:58:35,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:58:35,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 08:58:35,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:58:35,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:58:35,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:58:35,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:58:35,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:58:35,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:58:35,892 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:58:35,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:58:35,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:58:35,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:58:35,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:58:35,898 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:58:35,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:58:35,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:58:35,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:58:35,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:58:35,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:58:35,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:58:35,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:58:35,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:58:35,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:58:35,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:58:35,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:58:35,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:58:35,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:58:35,907 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:58:35,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:58:35,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:58:35,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:58:35,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:58:35,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:58:35,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:58:35,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:58:35,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:58:35,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:58:35,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:58:35,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:58:35,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:58:35,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:58:35,910 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2 [2024-11-19 08:58:36,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:58:36,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:58:36,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:58:36,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:58:36,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:58:36,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-19 08:58:37,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:58:38,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:58:38,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i [2024-11-19 08:58:38,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90cb774b/27c272211e1245f997cd55d1dd5866cc/FLAG45816a4ef [2024-11-19 08:58:38,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a90cb774b/27c272211e1245f997cd55d1dd5866cc [2024-11-19 08:58:38,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:58:38,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:58:38,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:38,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:58:38,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:58:38,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:38" (1/1) ... [2024-11-19 08:58:38,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16843ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:38, skipping insertion in model container [2024-11-19 08:58:38,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:38" (1/1) ... [2024-11-19 08:58:38,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:58:38,903 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-19 08:58:38,937 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-19 08:58:38,944 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-19 08:58:38,948 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-19 08:58:38,954 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-19 08:58:39,001 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-19 08:58:39,003 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-19 08:58:39,006 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-19 08:58:39,010 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-19 08:58:39,032 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-19 08:58:39,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:39,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:58:39,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:39,228 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:58:39,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39 WrapperNode [2024-11-19 08:58:39,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:39,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:58:39,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:58:39,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:58:39,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,285 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,357 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1603 [2024-11-19 08:58:39,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:58:39,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:58:39,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:58:39,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:58:39,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,529 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-19 08:58:39,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:58:39,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:58:39,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:58:39,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:58:39,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (1/1) ... [2024-11-19 08:58:39,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:58:39,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:39,668 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-19 08:58:39,675 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-19 08:58:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 08:58:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 08:58:39,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 08:58:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 08:58:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 08:58:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 08:58:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 08:58:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 08:58:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 08:58:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 08:58:39,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:58:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:58:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:58:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:58:39,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:58:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:58:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:58:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 08:58:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 08:58:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:58:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:58:39,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:58:39,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:58:40,000 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:58:40,045 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:58:42,482 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-19 08:58:42,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:58:42,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:58:42,551 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-19 08:58:42,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:58:42 BoogieIcfgContainer [2024-11-19 08:58:42,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:58:42,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:58:42,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:58:42,559 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:58:42,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:58:38" (1/3) ... [2024-11-19 08:58:42,560 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6281d3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:58:42, skipping insertion in model container [2024-11-19 08:58:42,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:39" (2/3) ... [2024-11-19 08:58:42,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6281d3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:58:42, skipping insertion in model container [2024-11-19 08:58:42,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:58:42" (3/3) ... [2024-11-19 08:58:42,564 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i [2024-11-19 08:58:42,581 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:58:42,582 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-19 08:58:42,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:58:42,666 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;@26f9b9fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:58:42,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-19 08:58:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:58:42,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:42,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:58:42,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-19 08:58:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210654532] [2024-11-19 08:58:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:42,941 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-19 08:58:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210654532] [2024-11-19 08:58:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210654532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157095754] [2024-11-19 08:58:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:42,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:42,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:42,987 INFO L87 Difference]: Start difference. First operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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-19 08:58:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:44,062 INFO L93 Difference]: Finished difference Result 1341 states and 1536 transitions. [2024-11-19 08:58:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:44,065 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-19 08:58:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:44,107 INFO L225 Difference]: With dead ends: 1341 [2024-11-19 08:58:44,107 INFO L226 Difference]: Without dead ends: 1339 [2024-11-19 08:58:44,113 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-19 08:58:44,117 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 1366 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:44,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 935 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:58:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-19 08:58:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2024-11-19 08:58:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 801 states have (on average 1.8714107365792758) internal successors, (1499), 1328 states have internal predecessors, (1499), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1531 transitions. [2024-11-19 08:58:44,226 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1531 transitions. Word has length 5 [2024-11-19 08:58:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:44,226 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1531 transitions. [2024-11-19 08:58:44,227 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-19 08:58:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1531 transitions. [2024-11-19 08:58:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 08:58:44,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:44,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 08:58:44,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 08:58:44,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:44,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:44,229 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-19 08:58:44,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:44,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300557823] [2024-11-19 08:58:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:44,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:44,354 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-19 08:58:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:44,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300557823] [2024-11-19 08:58:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300557823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:44,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674158772] [2024-11-19 08:58:44,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:44,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:44,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:44,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:44,358 INFO L87 Difference]: Start difference. First operand 1337 states and 1531 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-19 08:58:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:45,412 INFO L93 Difference]: Finished difference Result 1753 states and 2025 transitions. [2024-11-19 08:58:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:45,412 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-19 08:58:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:45,420 INFO L225 Difference]: With dead ends: 1753 [2024-11-19 08:58:45,420 INFO L226 Difference]: Without dead ends: 1753 [2024-11-19 08:58:45,420 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-19 08:58:45,422 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 820 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:45,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1947 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:58:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-19 08:58:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1600. [2024-11-19 08:58:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1074 states have (on average 1.8370577281191807) internal successors, (1973), 1591 states have internal predecessors, (1973), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2024-11-19 08:58:45,462 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 5 [2024-11-19 08:58:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:45,462 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2024-11-19 08:58:45,462 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-19 08:58:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2024-11-19 08:58:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 08:58:45,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:45,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 08:58:45,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 08:58:45,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:45,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1424554157, now seen corresponding path program 1 times [2024-11-19 08:58:45,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:45,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698806214] [2024-11-19 08:58:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:45,512 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-19 08:58:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698806214] [2024-11-19 08:58:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698806214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:45,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387335403] [2024-11-19 08:58:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:45,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:45,516 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 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-19 08:58:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:45,573 INFO L93 Difference]: Finished difference Result 3150 states and 3940 transitions. [2024-11-19 08:58:45,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:45,574 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-19 08:58:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:45,586 INFO L225 Difference]: With dead ends: 3150 [2024-11-19 08:58:45,586 INFO L226 Difference]: Without dead ends: 3150 [2024-11-19 08:58:45,587 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-19 08:58:45,588 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 1438 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:45,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3546 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2024-11-19 08:58:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1601. [2024-11-19 08:58:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1075 states have (on average 1.8362790697674418) internal successors, (1974), 1592 states have internal predecessors, (1974), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2006 transitions. [2024-11-19 08:58:45,692 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2006 transitions. Word has length 6 [2024-11-19 08:58:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2006 transitions. [2024-11-19 08:58:45,693 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-19 08:58:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2006 transitions. [2024-11-19 08:58:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:58:45,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:45,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:45,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 08:58:45,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:45,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:45,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-19 08:58:45,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:45,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334992183] [2024-11-19 08:58:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:45,808 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-19 08:58:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334992183] [2024-11-19 08:58:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334992183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:45,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:45,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037046858] [2024-11-19 08:58:45,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:45,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:45,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:45,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:45,810 INFO L87 Difference]: Start difference. First operand 1601 states and 2006 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:46,878 INFO L93 Difference]: Finished difference Result 1627 states and 2059 transitions. [2024-11-19 08:58:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:46,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 08:58:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:46,887 INFO L225 Difference]: With dead ends: 1627 [2024-11-19 08:58:46,887 INFO L226 Difference]: Without dead ends: 1627 [2024-11-19 08:58:46,887 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-19 08:58:46,890 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1634 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:46,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1633 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 08:58:46,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-19 08:58:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1578. [2024-11-19 08:58:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1075 states have (on average 1.8148837209302326) internal successors, (1951), 1569 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1983 transitions. [2024-11-19 08:58:46,932 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1983 transitions. Word has length 11 [2024-11-19 08:58:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:46,933 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 1983 transitions. [2024-11-19 08:58:46,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1983 transitions. [2024-11-19 08:58:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:58:46,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:46,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:46,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 08:58:46,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:46,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:46,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-19 08:58:46,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95101975] [2024-11-19 08:58:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:47,017 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-19 08:58:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95101975] [2024-11-19 08:58:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95101975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:47,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513590580] [2024-11-19 08:58:47,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:47,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:47,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:47,020 INFO L87 Difference]: Start difference. First operand 1578 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:47,079 INFO L93 Difference]: Finished difference Result 1503 states and 1880 transitions. [2024-11-19 08:58:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 08:58:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:47,085 INFO L225 Difference]: With dead ends: 1503 [2024-11-19 08:58:47,086 INFO L226 Difference]: Without dead ends: 1503 [2024-11-19 08:58:47,086 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-19 08:58:47,087 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 61 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2713 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-19 08:58:47,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2024-11-19 08:58:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2024-11-19 08:58:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1012 states have (on average 1.826086956521739) internal successors, (1848), 1494 states have internal predecessors, (1848), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1880 transitions. [2024-11-19 08:58:47,122 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1880 transitions. Word has length 11 [2024-11-19 08:58:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:47,123 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1880 transitions. [2024-11-19 08:58:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1880 transitions. [2024-11-19 08:58:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 08:58:47,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:47,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:47,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 08:58:47,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:47,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-19 08:58:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204424368] [2024-11-19 08:58:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:47,198 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-19 08:58:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204424368] [2024-11-19 08:58:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204424368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682717496] [2024-11-19 08:58:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:47,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:47,200 INFO L87 Difference]: Start difference. First operand 1503 states and 1880 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-19 08:58:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:47,276 INFO L93 Difference]: Finished difference Result 1485 states and 1855 transitions. [2024-11-19 08:58:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-19 08:58:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:47,282 INFO L225 Difference]: With dead ends: 1485 [2024-11-19 08:58:47,283 INFO L226 Difference]: Without dead ends: 1485 [2024-11-19 08:58:47,283 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-19 08:58:47,284 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 41 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4016 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-19 08:58:47,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4016 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-19 08:58:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2024-11-19 08:58:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 998 states have (on average 1.8236472945891784) internal successors, (1820), 1473 states have internal predecessors, (1820), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1852 transitions. [2024-11-19 08:58:47,318 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1852 transitions. Word has length 13 [2024-11-19 08:58:47,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:47,319 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1852 transitions. [2024-11-19 08:58:47,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-19 08:58:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1852 transitions. [2024-11-19 08:58:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 08:58:47,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:47,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:47,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 08:58:47,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:47,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-19 08:58:47,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676037403] [2024-11-19 08:58:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:47,486 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-19 08:58:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676037403] [2024-11-19 08:58:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676037403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627004063] [2024-11-19 08:58:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:47,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:47,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:47,489 INFO L87 Difference]: Start difference. First operand 1482 states and 1852 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:48,676 INFO L93 Difference]: Finished difference Result 1680 states and 1944 transitions. [2024-11-19 08:58:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:48,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 08:58:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:48,681 INFO L225 Difference]: With dead ends: 1680 [2024-11-19 08:58:48,681 INFO L226 Difference]: Without dead ends: 1680 [2024-11-19 08:58:48,682 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-19 08:58:48,682 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 825 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:48,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2596 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:58:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-19 08:58:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1478. [2024-11-19 08:58:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8196392785571143) internal successors, (1816), 1469 states have internal predecessors, (1816), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1848 transitions. [2024-11-19 08:58:48,712 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1848 transitions. Word has length 27 [2024-11-19 08:58:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:48,713 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1848 transitions. [2024-11-19 08:58:48,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-19 08:58:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1848 transitions. [2024-11-19 08:58:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 08:58:48,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:48,714 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] [2024-11-19 08:58:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 08:58:48,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:48,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-19 08:58:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:48,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484512162] [2024-11-19 08:58:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:48,818 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-19 08:58:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484512162] [2024-11-19 08:58:48,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484512162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:48,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:48,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:48,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347056793] [2024-11-19 08:58:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:48,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:48,821 INFO L87 Difference]: Start difference. First operand 1478 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-19 08:58:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:48,880 INFO L93 Difference]: Finished difference Result 1478 states and 1844 transitions. [2024-11-19 08:58:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:48,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-19 08:58:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:48,886 INFO L225 Difference]: With dead ends: 1478 [2024-11-19 08:58:48,887 INFO L226 Difference]: Without dead ends: 1478 [2024-11-19 08:58:48,887 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-19 08:58:48,888 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 21 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3998 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-19 08:58:48,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3998 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-11-19 08:58:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2024-11-19 08:58:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8156312625250501) internal successors, (1812), 1469 states have internal predecessors, (1812), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1844 transitions. [2024-11-19 08:58:48,920 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1844 transitions. Word has length 61 [2024-11-19 08:58:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:48,921 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1844 transitions. [2024-11-19 08:58:48,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-19 08:58:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1844 transitions. [2024-11-19 08:58:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 08:58:48,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:48,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:58:48,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 08:58:48,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-19 08:58:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460114307] [2024-11-19 08:58:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:48,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:49,062 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-19 08:58:49,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460114307] [2024-11-19 08:58:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460114307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152415476] [2024-11-19 08:58:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:49,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:49,065 INFO L87 Difference]: Start difference. First operand 1478 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:49,107 INFO L93 Difference]: Finished difference Result 1570 states and 1963 transitions. [2024-11-19 08:58:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:49,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-19 08:58:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:49,117 INFO L225 Difference]: With dead ends: 1570 [2024-11-19 08:58:49,117 INFO L226 Difference]: Without dead ends: 1570 [2024-11-19 08:58:49,117 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-19 08:58:49,119 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 54 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2689 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:49,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2689 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-19 08:58:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-19 08:58:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1090 states have (on average 1.771559633027523) internal successors, (1931), 1561 states have internal predecessors, (1931), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1963 transitions. [2024-11-19 08:58:49,152 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1963 transitions. Word has length 69 [2024-11-19 08:58:49,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:49,152 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1963 transitions. [2024-11-19 08:58:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:58:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1963 transitions. [2024-11-19 08:58:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 08:58:49,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:49,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:49,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 08:58:49,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-19 08:58:49,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:49,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586847880] [2024-11-19 08:58:49,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:49,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:49,640 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-19 08:58:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:49,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586847880] [2024-11-19 08:58:49,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586847880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:49,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:49,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:58:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182036061] [2024-11-19 08:58:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:49,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:58:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:58:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:58:49,642 INFO L87 Difference]: Start difference. First operand 1570 states and 1963 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-19 08:58:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:50,890 INFO L93 Difference]: Finished difference Result 1486 states and 1879 transitions. [2024-11-19 08:58:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2024-11-19 08:58:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:50,896 INFO L225 Difference]: With dead ends: 1486 [2024-11-19 08:58:50,896 INFO L226 Difference]: Without dead ends: 1486 [2024-11-19 08:58:50,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:58:50,897 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 2272 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:50,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 1223 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 08:58:50,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-19 08:58:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1213. [2024-11-19 08:58:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 817 states have (on average 1.6682986536107711) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1395 transitions. [2024-11-19 08:58:50,921 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1395 transitions. Word has length 72 [2024-11-19 08:58:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:50,922 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1395 transitions. [2024-11-19 08:58:50,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 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-19 08:58:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1395 transitions. [2024-11-19 08:58:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 08:58:50,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:50,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] [2024-11-19 08:58:50,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 08:58:50,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:50,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-19 08:58:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886974503] [2024-11-19 08:58:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:51,222 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-19 08:58:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:51,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886974503] [2024-11-19 08:58:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886974503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187234079] [2024-11-19 08:58:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:51,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:51,225 INFO L87 Difference]: Start difference. First operand 1213 states and 1395 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-19 08:58:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:52,164 INFO L93 Difference]: Finished difference Result 1212 states and 1394 transitions. [2024-11-19 08:58:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-19 08:58:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:52,169 INFO L225 Difference]: With dead ends: 1212 [2024-11-19 08:58:52,169 INFO L226 Difference]: Without dead ends: 1212 [2024-11-19 08:58:52,169 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-19 08:58:52,170 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 2 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:52,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3620 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 08:58:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-19 08:58:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-19 08:58:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 817 states have (on average 1.6670746634026927) internal successors, (1362), 1203 states have internal predecessors, (1362), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-19 08:58:52,192 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 77 [2024-11-19 08:58:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:52,192 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-19 08:58:52,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-19 08:58:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-19 08:58:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 08:58:52,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:52,193 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] [2024-11-19 08:58:52,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 08:58:52,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-19 08:58:52,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:52,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902489888] [2024-11-19 08:58:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:52,695 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-19 08:58:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902489888] [2024-11-19 08:58:52,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902489888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:52,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:52,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233986174] [2024-11-19 08:58:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:52,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:52,698 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-19 08:58:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:53,559 INFO L93 Difference]: Finished difference Result 1211 states and 1393 transitions. [2024-11-19 08:58:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-19 08:58:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:53,564 INFO L225 Difference]: With dead ends: 1211 [2024-11-19 08:58:53,564 INFO L226 Difference]: Without dead ends: 1211 [2024-11-19 08:58:53,564 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-19 08:58:53,565 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 1 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:53,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3635 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:58:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-19 08:58:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-19 08:58:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6678921568627452) internal successors, (1361), 1202 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:58:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1393 transitions. [2024-11-19 08:58:53,586 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1393 transitions. Word has length 77 [2024-11-19 08:58:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:53,587 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1393 transitions. [2024-11-19 08:58:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-19 08:58:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1393 transitions. [2024-11-19 08:58:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 08:58:53,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:53,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:53,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 08:58:53,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1975894987, now seen corresponding path program 1 times [2024-11-19 08:58:53,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:53,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874270683] [2024-11-19 08:58:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:53,928 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-19 08:58:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874270683] [2024-11-19 08:58:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874270683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:58:53,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498959430] [2024-11-19 08:58:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:53,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:58:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:58:53,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:58:53,932 INFO L87 Difference]: Start difference. First operand 1211 states and 1393 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-19 08:58:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:55,326 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2024-11-19 08:58:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:58:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-19 08:58:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:55,332 INFO L225 Difference]: With dead ends: 1223 [2024-11-19 08:58:55,332 INFO L226 Difference]: Without dead ends: 1223 [2024-11-19 08:58:55,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:58:55,333 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 12 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5591 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:55,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5591 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 08:58:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-19 08:58:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1217. [2024-11-19 08:58:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.66626065773447) internal successors, (1368), 1207 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:58:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1406 transitions. [2024-11-19 08:58:55,356 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1406 transitions. Word has length 85 [2024-11-19 08:58:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:55,357 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1406 transitions. [2024-11-19 08:58:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-19 08:58:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1406 transitions. [2024-11-19 08:58:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 08:58:55,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:55,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 08:58:55,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1975894988, now seen corresponding path program 1 times [2024-11-19 08:58:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428328376] [2024-11-19 08:58:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:55,859 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-19 08:58:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428328376] [2024-11-19 08:58:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428328376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:58:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197643572] [2024-11-19 08:58:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:55,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:58:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:58:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:58:55,861 INFO L87 Difference]: Start difference. First operand 1217 states and 1406 transitions. Second operand has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-19 08:58:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:57,011 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-19 08:58:57,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:57,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-19 08:58:57,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:57,016 INFO L225 Difference]: With dead ends: 1217 [2024-11-19 08:58:57,016 INFO L226 Difference]: Without dead ends: 1217 [2024-11-19 08:58:57,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:58:57,017 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 7 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:57,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4608 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:58:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-19 08:58:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-19 08:58:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.6650426309378807) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:58:57,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-19 08:58:57,037 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 85 [2024-11-19 08:58:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:57,038 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-19 08:58:57,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-19 08:58:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-19 08:58:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 08:58:57,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:57,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:57,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 08:58:57,039 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:58:57,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1271351474, now seen corresponding path program 1 times [2024-11-19 08:58:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:58:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438688514] [2024-11-19 08:58:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:58:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:57,529 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-19 08:58:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:58:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438688514] [2024-11-19 08:58:57,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438688514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:57,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488810662] [2024-11-19 08:58:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:57,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:58:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:57,532 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-19 08:58:57,533 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-19 08:58:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:57,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 08:58:57,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:57,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:58:57,938 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:58:57,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-19 08:58:57,954 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-19 08:58:58,019 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:58:58,020 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-19 08:58:58,051 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-19 08:58:58,055 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-19 08:58:58,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:58,111 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 08:58:58,112 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-19 08:58:58,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)))) is different from false [2024-11-19 08:58:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488810662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:58:58,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-19 08:58:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440744688] [2024-11-19 08:58:58,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:58:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:58:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:58:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2024-11-19 08:58:58,130 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 transitions. Second operand has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:00,515 INFO L93 Difference]: Finished difference Result 1216 states and 1404 transitions. [2024-11-19 08:59:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:59:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-11-19 08:59:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:00,520 INFO L225 Difference]: With dead ends: 1216 [2024-11-19 08:59:00,521 INFO L226 Difference]: Without dead ends: 1216 [2024-11-19 08:59:00,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2024-11-19 08:59:00,522 INFO L432 NwaCegarLoop]: 780 mSDtfsCounter, 1168 mSDsluCounter, 5956 mSDsCounter, 0 mSdLazyCounter, 4696 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6736 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:00,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6736 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4696 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 08:59:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-19 08:59:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2024-11-19 08:59:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 821 states have (on average 1.6638246041412912) internal successors, (1366), 1206 states have internal predecessors, (1366), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:59:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1404 transitions. [2024-11-19 08:59:00,542 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1404 transitions. Word has length 86 [2024-11-19 08:59:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:00,543 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1404 transitions. [2024-11-19 08:59:00,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.25) internal successors, (123), 13 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1404 transitions. [2024-11-19 08:59:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 08:59:00,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:00,544 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] [2024-11-19 08:59:00,565 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-19 08:59:00,744 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-19 08:59:00,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:00,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:00,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1271351475, now seen corresponding path program 1 times [2024-11-19 08:59:00,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:00,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505108437] [2024-11-19 08:59:00,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:00,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:01,450 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-19 08:59:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505108437] [2024-11-19 08:59:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505108437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085977242] [2024-11-19 08:59:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:01,452 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-19 08:59:01,454 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-19 08:59:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:01,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 08:59:01,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:01,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:01,817 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:01,818 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-19 08:59:01,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:59:01,856 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-19 08:59:02,034 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:02,035 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 70 treesize of output 65 [2024-11-19 08:59:02,044 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 49 treesize of output 30 [2024-11-19 08:59:02,087 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-19 08:59:02,093 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 32 treesize of output 14 [2024-11-19 08:59:02,121 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-19 08:59:02,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:02,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:59:02,248 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 48 treesize of output 52 [2024-11-19 08:59:02,307 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2024-11-19 08:59:02,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085977242] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:02,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:02,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-19 08:59:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135281820] [2024-11-19 08:59:02,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:02,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 08:59:02,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 08:59:02,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-19 08:59:02,312 INFO L87 Difference]: Start difference. First operand 1216 states and 1404 transitions. Second operand has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:59:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:04,935 INFO L93 Difference]: Finished difference Result 1215 states and 1403 transitions. [2024-11-19 08:59:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 08:59:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-19 08:59:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:04,939 INFO L225 Difference]: With dead ends: 1215 [2024-11-19 08:59:04,939 INFO L226 Difference]: Without dead ends: 1215 [2024-11-19 08:59:04,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2024-11-19 08:59:04,940 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1169 mSDsluCounter, 5272 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 6051 SdHoareTripleChecker+Invalid, 5427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:04,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 6051 Invalid, 5427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 08:59:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-19 08:59:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1209. [2024-11-19 08:59:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 816 states have (on average 1.6654411764705883) internal successors, (1359), 1200 states have internal predecessors, (1359), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:59:04,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1391 transitions. [2024-11-19 08:59:04,957 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1391 transitions. Word has length 86 [2024-11-19 08:59:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:04,957 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1391 transitions. [2024-11-19 08:59:04,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.4375) internal successors, (135), 19 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:59:04,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1391 transitions. [2024-11-19 08:59:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 08:59:04,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:59:04,977 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-19 08:59:05,162 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-19 08:59:05,163 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:05,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1361370809, now seen corresponding path program 1 times [2024-11-19 08:59:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062758153] [2024-11-19 08:59:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:59:05,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062758153] [2024-11-19 08:59:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062758153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:05,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 08:59:05,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170747669] [2024-11-19 08:59:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:59:05,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:59:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:59:05,690 INFO L87 Difference]: Start difference. First operand 1209 states and 1391 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-19 08:59:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:08,007 INFO L93 Difference]: Finished difference Result 1219 states and 1407 transitions. [2024-11-19 08:59:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:59:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-19 08:59:08,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:08,010 INFO L225 Difference]: With dead ends: 1219 [2024-11-19 08:59:08,010 INFO L226 Difference]: Without dead ends: 1219 [2024-11-19 08:59:08,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-19 08:59:08,014 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1175 mSDsluCounter, 6660 mSDsCounter, 0 mSdLazyCounter, 5243 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 7439 SdHoareTripleChecker+Invalid, 5273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:08,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 7439 Invalid, 5273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5243 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 08:59:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2024-11-19 08:59:08,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1218. [2024-11-19 08:59:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6614077669902914) internal successors, (1369), 1208 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:59:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1407 transitions. [2024-11-19 08:59:08,041 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1407 transitions. Word has length 88 [2024-11-19 08:59:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1407 transitions. [2024-11-19 08:59:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-19 08:59:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1407 transitions. [2024-11-19 08:59:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 08:59:08,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:08,046 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] [2024-11-19 08:59:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 08:59:08,047 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1361370810, now seen corresponding path program 1 times [2024-11-19 08:59:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057268391] [2024-11-19 08:59:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:08,696 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-19 08:59:08,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057268391] [2024-11-19 08:59:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057268391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 08:59:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902457549] [2024-11-19 08:59:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 08:59:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 08:59:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:59:08,699 INFO L87 Difference]: Start difference. First operand 1218 states and 1407 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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-19 08:59:10,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:10,487 INFO L93 Difference]: Finished difference Result 1218 states and 1406 transitions. [2024-11-19 08:59:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 08:59:10,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-19 08:59:10,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:10,490 INFO L225 Difference]: With dead ends: 1218 [2024-11-19 08:59:10,490 INFO L226 Difference]: Without dead ends: 1218 [2024-11-19 08:59:10,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 08:59:10,491 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 1190 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:10,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 3999 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 08:59:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-19 08:59:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-19 08:59:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 824 states have (on average 1.6601941747572815) internal successors, (1368), 1208 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:59:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1406 transitions. [2024-11-19 08:59:10,514 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1406 transitions. Word has length 88 [2024-11-19 08:59:10,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:10,515 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1406 transitions. [2024-11-19 08:59:10,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 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-19 08:59:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1406 transitions. [2024-11-19 08:59:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:59:10,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:10,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] [2024-11-19 08:59:10,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 08:59:10,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:10,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1810750578, now seen corresponding path program 1 times [2024-11-19 08:59:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440404356] [2024-11-19 08:59:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:11,019 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-19 08:59:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440404356] [2024-11-19 08:59:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440404356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443933406] [2024-11-19 08:59:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:11,022 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-19 08:59:11,025 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-19 08:59:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:11,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 08:59:11,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:11,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:11,368 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:11,368 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-19 08:59:11,376 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-19 08:59:11,458 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:11,459 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-19 08:59:11,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:11,507 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-19 08:59:11,519 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-19 08:59:11,523 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-19 08:59:11,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:11,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-19 08:59:11,542 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (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_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 08:59:11,583 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 08:59:11,583 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-19 08:59:11,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_882))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 08:59:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443933406] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:11,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-19 08:59:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114110729] [2024-11-19 08:59:11,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:59:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:59:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2024-11-19 08:59:11,594 INFO L87 Difference]: Start difference. First operand 1218 states and 1406 transitions. Second operand has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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-19 08:59:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:14,608 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-19 08:59:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:59:14,608 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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-19 08:59:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:14,611 INFO L225 Difference]: With dead ends: 1217 [2024-11-19 08:59:14,611 INFO L226 Difference]: Without dead ends: 1217 [2024-11-19 08:59:14,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2024-11-19 08:59:14,612 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1162 mSDsluCounter, 8871 mSDsCounter, 0 mSdLazyCounter, 6774 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 9650 SdHoareTripleChecker+Invalid, 6804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 6774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:14,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 9650 Invalid, 6804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 6774 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 08:59:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-19 08:59:14,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-19 08:59:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 824 states have (on average 1.6589805825242718) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-19 08:59:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-19 08:59:14,630 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 89 [2024-11-19 08:59:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-19 08:59:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.142857142857142) internal successors, (128), 15 states have internal predecessors, (128), 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-19 08:59:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-19 08:59:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 08:59:14,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:14,631 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-19 08:59:14,651 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-19 08:59:14,835 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-19 08:59:14,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1810750579, now seen corresponding path program 1 times [2024-11-19 08:59:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347101683] [2024-11-19 08:59:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:15,589 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-19 08:59:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347101683] [2024-11-19 08:59:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347101683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496746237] [2024-11-19 08:59:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:15,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:15,592 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-19 08:59:15,595 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-19 08:59:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:15,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 08:59:15,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:15,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:15,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:15,950 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-19 08:59:15,956 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-19 08:59:15,983 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-19 08:59:15,986 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-19 08:59:16,071 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-19 08:59:16,075 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-19 08:59:16,202 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:16,203 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-19 08:59:16,208 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-19 08:59:16,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:16,297 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-19 08:59:16,304 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-19 08:59:16,324 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-19 08:59:16,328 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-19 08:59:16,350 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-19 08:59:16,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:16,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |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~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:59:16,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025))) (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~mem50#1.base| v_ArrVal_1026) .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 08:59:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496746237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:16,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:16,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-19 08:59:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609758509] [2024-11-19 08:59:16,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:59:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:59:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=424, Unknown=11, NotChecked=86, Total=600 [2024-11-19 08:59:16,532 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 transitions. Second operand has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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-19 08:59:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:20,071 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2024-11-19 08:59:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 08:59:20,072 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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 89 [2024-11-19 08:59:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:20,075 INFO L225 Difference]: With dead ends: 1224 [2024-11-19 08:59:20,075 INFO L226 Difference]: Without dead ends: 1224 [2024-11-19 08:59:20,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=627, Unknown=11, NotChecked=106, Total=870 [2024-11-19 08:59:20,076 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1166 mSDsluCounter, 6809 mSDsCounter, 0 mSdLazyCounter, 7616 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 7593 SdHoareTripleChecker+Invalid, 7649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 7593 Invalid, 7649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 7616 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 08:59:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-19 08:59:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1212. [2024-11-19 08:59:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 820 states have (on average 1.6609756097560975) internal successors, (1362), 1202 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:59:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-19 08:59:20,092 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 89 [2024-11-19 08:59:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:20,098 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-19 08:59:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.294117647058824) internal successors, (141), 20 states have internal predecessors, (141), 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-19 08:59:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-19 08:59:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 08:59:20,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:20,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:59:20,138 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-19 08:59:20,303 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-19 08:59:20,304 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:20,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -777793486, now seen corresponding path program 1 times [2024-11-19 08:59:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626529750] [2024-11-19 08:59:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:20,872 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-19 08:59:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626529750] [2024-11-19 08:59:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626529750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:20,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 08:59:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136575860] [2024-11-19 08:59:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:20,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 08:59:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 08:59:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 08:59:20,876 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-19 08:59:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:23,127 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-19 08:59:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:59:23,128 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-19 08:59:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:23,130 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 08:59:23,130 INFO L226 Difference]: Without dead ends: 1228 [2024-11-19 08:59:23,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:59:23,131 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1192 mSDsluCounter, 5958 mSDsCounter, 0 mSdLazyCounter, 4717 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 6736 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:23,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 6736 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4717 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 08:59:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-19 08:59:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2024-11-19 08:59:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.654632972322503) internal successors, (1375), 1213 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1408 transitions. [2024-11-19 08:59:23,149 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1408 transitions. Word has length 91 [2024-11-19 08:59:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:23,150 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1408 transitions. [2024-11-19 08:59:23,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-19 08:59:23,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1408 transitions. [2024-11-19 08:59:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 08:59:23,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:23,151 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] [2024-11-19 08:59:23,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 08:59:23,151 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:23,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:23,152 INFO L85 PathProgramCache]: Analyzing trace with hash -777793485, now seen corresponding path program 1 times [2024-11-19 08:59:23,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:23,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646447949] [2024-11-19 08:59:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:59:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646447949] [2024-11-19 08:59:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646447949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:23,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 08:59:23,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773451385] [2024-11-19 08:59:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 08:59:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 08:59:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 08:59:23,963 INFO L87 Difference]: Start difference. First operand 1224 states and 1408 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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-19 08:59:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:26,335 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-19 08:59:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:59:26,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-19 08:59:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:26,338 INFO L225 Difference]: With dead ends: 1227 [2024-11-19 08:59:26,338 INFO L226 Difference]: Without dead ends: 1227 [2024-11-19 08:59:26,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-19 08:59:26,340 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1172 mSDsluCounter, 4353 mSDsCounter, 0 mSdLazyCounter, 5014 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 5138 SdHoareTripleChecker+Invalid, 5043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:26,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 5138 Invalid, 5043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5014 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 08:59:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-19 08:59:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-19 08:59:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.6534296028880866) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-19 08:59:26,358 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 91 [2024-11-19 08:59:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:26,359 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-19 08:59:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 12 states have internal predecessors, (89), 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-19 08:59:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-19 08:59:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:59:26,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:26,360 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-19 08:59:26,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 08:59:26,360 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:26,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash -718156839, now seen corresponding path program 1 times [2024-11-19 08:59:26,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:26,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712346170] [2024-11-19 08:59:26,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:26,938 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-19 08:59:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:26,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712346170] [2024-11-19 08:59:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712346170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050203432] [2024-11-19 08:59:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:26,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:26,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:26,941 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-19 08:59:26,942 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-19 08:59:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:27,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 08:59:27,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:27,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:27,295 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:27,295 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-19 08:59:27,305 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-19 08:59:27,355 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:27,356 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-19 08:59:27,397 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:27,397 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-19 08:59:27,441 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:27,442 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-19 08:59:27,453 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-19 08:59:27,456 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-19 08:59:27,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:27,497 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (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_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-19 08:59:27,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (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_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:59:27,585 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-19 08:59:27,585 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-19 08:59:27,592 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (Array Int Int)) (v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_1303))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1299)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-19 08:59:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050203432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:27,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-19 08:59:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757740258] [2024-11-19 08:59:27,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:59:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:27,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:59:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=304, Unknown=22, NotChecked=114, Total=506 [2024-11-19 08:59:27,595 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 transitions. Second operand has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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-19 08:59:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:30,031 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-19 08:59:30,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:59:30,031 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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-19 08:59:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:30,033 INFO L225 Difference]: With dead ends: 1226 [2024-11-19 08:59:30,034 INFO L226 Difference]: Without dead ends: 1226 [2024-11-19 08:59:30,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=618, Unknown=22, NotChecked=162, Total=930 [2024-11-19 08:59:30,035 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1164 mSDsluCounter, 7379 mSDsCounter, 0 mSdLazyCounter, 5772 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 8157 SdHoareTripleChecker+Invalid, 5802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:30,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 8157 Invalid, 5802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5772 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 08:59:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-19 08:59:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1223. [2024-11-19 08:59:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 831 states have (on average 1.6522262334536704) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1406 transitions. [2024-11-19 08:59:30,061 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1406 transitions. Word has length 92 [2024-11-19 08:59:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1406 transitions. [2024-11-19 08:59:30,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.3125) internal successors, (133), 17 states have internal predecessors, (133), 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-19 08:59:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1406 transitions. [2024-11-19 08:59:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 08:59:30,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:30,063 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-19 08:59:30,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 08:59:30,267 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-19 08:59:30,268 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash -718156838, now seen corresponding path program 1 times [2024-11-19 08:59:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:30,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410971746] [2024-11-19 08:59:30,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:31,124 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-19 08:59:31,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:31,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410971746] [2024-11-19 08:59:31,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410971746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:31,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96284816] [2024-11-19 08:59:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:31,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:31,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:31,128 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-19 08:59:31,129 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-19 08:59:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:31,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 08:59:31,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:31,433 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-19 08:59:31,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:31,440 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-19 08:59:31,449 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-19 08:59:31,454 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-19 08:59:31,501 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-19 08:59:31,505 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-19 08:59:31,596 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:31,596 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-19 08:59:31,602 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-19 08:59:31,659 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:31,659 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-19 08:59:31,667 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-19 08:59:31,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:31,721 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-19 08:59:31,724 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-19 08:59:31,741 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-19 08:59:31,749 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-19 08:59:31,750 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-19 08:59:31,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:31,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:59:31,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))) is different from false [2024-11-19 08:59:31,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (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~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-19 08:59:31,848 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_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452))) (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_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8)))))) is different from false [2024-11-19 08:59:31,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1452))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460) .cse0 v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460) .cse5 v_ArrVal_1453) (select (select (store .cse6 .cse5 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))))) is different from false [2024-11-19 08:59:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96284816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:31,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-19 08:59:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756381349] [2024-11-19 08:59:31,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 08:59:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 08:59:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2024-11-19 08:59:31,896 INFO L87 Difference]: Start difference. First operand 1223 states and 1406 transitions. Second operand has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 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-19 08:59:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:35,303 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-19 08:59:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 08:59:35,304 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 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 92 [2024-11-19 08:59:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:35,306 INFO L225 Difference]: With dead ends: 1225 [2024-11-19 08:59:35,306 INFO L226 Difference]: Without dead ends: 1225 [2024-11-19 08:59:35,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2024-11-19 08:59:35,307 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1164 mSDsluCounter, 6053 mSDsCounter, 0 mSdLazyCounter, 7108 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 7155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 7108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:35,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 6836 Invalid, 7155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 7108 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 08:59:35,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-19 08:59:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1210. [2024-11-19 08:59:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 820 states have (on average 1.6585365853658536) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 08:59:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1392 transitions. [2024-11-19 08:59:35,320 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1392 transitions. Word has length 92 [2024-11-19 08:59:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:35,320 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1392 transitions. [2024-11-19 08:59:35,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 18 states have internal predecessors, (138), 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-19 08:59:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1392 transitions. [2024-11-19 08:59:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 08:59:35,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:35,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:59:35,342 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-19 08:59:35,522 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-19 08:59:35,523 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 103439168, now seen corresponding path program 1 times [2024-11-19 08:59:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:35,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747909015] [2024-11-19 08:59:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:36,141 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-19 08:59:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747909015] [2024-11-19 08:59:36,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747909015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:36,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:36,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 08:59:36,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81453662] [2024-11-19 08:59:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:36,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 08:59:36,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 08:59:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 08:59:36,143 INFO L87 Difference]: Start difference. First operand 1210 states and 1392 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:59:38,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:38,234 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-19 08:59:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 08:59:38,235 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-19 08:59:38,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:38,237 INFO L225 Difference]: With dead ends: 1229 [2024-11-19 08:59:38,237 INFO L226 Difference]: Without dead ends: 1229 [2024-11-19 08:59:38,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-19 08:59:38,238 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1195 mSDsluCounter, 5950 mSDsCounter, 0 mSdLazyCounter, 4714 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 6727 Invalid, 4744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4714 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 08:59:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-19 08:59:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2024-11-19 08:59:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6498800959232613) internal successors, (1376), 1214 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1409 transitions. [2024-11-19 08:59:38,253 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1409 transitions. Word has length 94 [2024-11-19 08:59:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:38,254 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1409 transitions. [2024-11-19 08:59:38,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:59:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1409 transitions. [2024-11-19 08:59:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 08:59:38,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:38,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:59:38,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 08:59:38,255 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:38,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash 103439169, now seen corresponding path program 1 times [2024-11-19 08:59:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487492013] [2024-11-19 08:59:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:39,206 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-19 08:59:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:39,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487492013] [2024-11-19 08:59:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487492013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:59:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:59:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 08:59:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075169214] [2024-11-19 08:59:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:59:39,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 08:59:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 08:59:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:59:39,209 INFO L87 Difference]: Start difference. First operand 1225 states and 1409 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:59:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:41,447 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-19 08:59:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 08:59:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-19 08:59:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:41,453 INFO L225 Difference]: With dead ends: 1228 [2024-11-19 08:59:41,453 INFO L226 Difference]: Without dead ends: 1228 [2024-11-19 08:59:41,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-19 08:59:41,454 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1173 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 4856 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 5285 SdHoareTripleChecker+Invalid, 4885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:41,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 5285 Invalid, 4885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4856 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 08:59:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-19 08:59:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2024-11-19 08:59:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6486810551558753) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1408 transitions. [2024-11-19 08:59:41,471 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1408 transitions. Word has length 94 [2024-11-19 08:59:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:41,471 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1408 transitions. [2024-11-19 08:59:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 13 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:59:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1408 transitions. [2024-11-19 08:59:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:59:41,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:41,473 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-19 08:59:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 08:59:41,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1377670599, now seen corresponding path program 1 times [2024-11-19 08:59:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75501511] [2024-11-19 08:59:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:42,076 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-19 08:59:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75501511] [2024-11-19 08:59:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75501511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:42,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807519030] [2024-11-19 08:59:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:42,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:42,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:42,078 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-19 08:59:42,079 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-19 08:59:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:42,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 08:59:42,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:42,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:42,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:42,446 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-19 08:59:42,453 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-19 08:59:42,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:42,517 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-19 08:59:42,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:42,551 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-19 08:59:42,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:42,587 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-19 08:59:42,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:42,620 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-19 08:59:42,629 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-19 08:59:42,631 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-19 08:59:42,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:42,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (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_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:59:42,733 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-19 08:59:42,800 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-19 08:59:42,800 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-19 08:59:42,806 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-19 08:59:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807519030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:42,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-19 08:59:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595766399] [2024-11-19 08:59:42,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:42,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:59:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:59:42,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=520, Unknown=44, NotChecked=150, Total=812 [2024-11-19 08:59:42,809 INFO L87 Difference]: Start difference. First operand 1225 states and 1408 transitions. Second operand has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:59:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:45,742 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-19 08:59:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 08:59:45,742 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2024-11-19 08:59:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:45,744 INFO L225 Difference]: With dead ends: 1227 [2024-11-19 08:59:45,744 INFO L226 Difference]: Without dead ends: 1227 [2024-11-19 08:59:45,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=965, Unknown=53, NotChecked=204, Total=1406 [2024-11-19 08:59:45,745 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1164 mSDsluCounter, 9643 mSDsCounter, 0 mSdLazyCounter, 7262 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 10420 SdHoareTripleChecker+Invalid, 7307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 7262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:45,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 10420 Invalid, 7307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 7262 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 08:59:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-19 08:59:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-19 08:59:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 834 states have (on average 1.6474820143884892) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-19 08:59:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-19 08:59:45,757 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 95 [2024-11-19 08:59:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:45,758 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-19 08:59:45,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.631578947368421) internal successors, (145), 22 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:59:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-19 08:59:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 08:59:45,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:45,759 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-19 08:59:45,779 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-19 08:59:45,963 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-19 08:59:45,964 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-19 08:59:45,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1377670598, now seen corresponding path program 1 times [2024-11-19 08:59:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:59:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593439235] [2024-11-19 08:59:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:59:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:46,877 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-19 08:59:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:59:46,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593439235] [2024-11-19 08:59:46,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593439235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:46,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427208770] [2024-11-19 08:59:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:59:46,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:59:46,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:59:46,881 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-19 08:59:46,882 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-19 08:59:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:59:47,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 08:59:47,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:47,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:59:47,239 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-19 08:59:47,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:59:47,247 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-19 08:59:47,255 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-19 08:59:47,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 08:59:47,313 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-19 08:59:47,317 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-19 08:59:47,395 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:47,396 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-19 08:59:47,399 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-19 08:59:47,459 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:47,459 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-19 08:59:47,463 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-19 08:59:47,504 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:47,504 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-19 08:59:47,507 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-19 08:59:47,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:47,555 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-19 08:59:47,559 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-19 08:59:47,576 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-19 08:59:47,580 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-19 08:59:47,583 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-19 08:59:47,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:47,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-19 08:59:47,650 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-19 08:59:47,668 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-19 08:59:47,680 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_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (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_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-19 08:59:47,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (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~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (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~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-19 08:59:47,719 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_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (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_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (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_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-19 08:59:47,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (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~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (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~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-19 08:59:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427208770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:47,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-19 08:59:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869258010] [2024-11-19 08:59:47,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:47,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:59:47,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:59:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:59:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=394, Unknown=7, NotChecked=322, Total=812 [2024-11-19 08:59:47,812 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 20 states have internal predecessors, (143), 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)