./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:03:22,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:03:22,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:03:22,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:03:22,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:03:22,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:03:22,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:03:22,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:03:22,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:03:22,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:03:22,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:03:22,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:03:22,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:03:22,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:03:22,197 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:03:22,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:03:22,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:03:22,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:03:22,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:03:22,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:03:22,198 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:03:22,199 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:03:22,199 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:03:22,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:03:22,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:03:22,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:03:22,200 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:03:22,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:03:22,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:03:22,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:03:22,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:03:22,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:03:22,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:03:22,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:03:22,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:03:22,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:03:22,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:03:22,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:03:22,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:03:22,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:03:22,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:03:22,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:03:22,204 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-11-22 21:03:22,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:03:22,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:03:22,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:03:22,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:03:22,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:03:22,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-22 21:03:23,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:03:24,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:03:24,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-22 21:03:24,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592b277d7/0f4e183005854a1baa933f4d9916fc2c/FLAG58ccb655c [2024-11-22 21:03:24,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592b277d7/0f4e183005854a1baa933f4d9916fc2c [2024-11-22 21:03:24,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:03:24,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:03:24,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:03:24,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:03:24,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:03:24,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1b71ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24, skipping insertion in model container [2024-11-22 21:03:24,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:03:24,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,644 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,650 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:03:24,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:03:24,711 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:03:24,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:03:24,871 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:03:24,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24 WrapperNode [2024-11-22 21:03:24,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:03:24,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:03:24,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:03:24,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:03:24,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,952 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1312 [2024-11-22 21:03:24,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:03:24,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:03:24,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:03:24,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:03:24,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:24,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,094 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-22 21:03:25,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:03:25,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:03:25,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:03:25,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:03:25,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (1/1) ... [2024-11-22 21:03:25,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:03:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:03:25,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:03:25,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:03:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 21:03:25,297 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 21:03:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 21:03:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 21:03:25,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 21:03:25,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 21:03:25,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 21:03:25,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 21:03:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:03:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:03:25,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:03:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 21:03:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:03:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:03:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:03:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 21:03:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 21:03:25,300 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 21:03:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:03:25,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:03:25,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 21:03:25,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 21:03:25,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:03:25,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:03:25,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:03:25,465 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:03:25,483 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:03:25,518 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:03:25,535 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 21:03:27,211 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-22 21:03:27,211 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:03:27,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:03:27,233 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-22 21:03:27,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:03:27 BoogieIcfgContainer [2024-11-22 21:03:27,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:03:27,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:03:27,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:03:27,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:03:27,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:03:24" (1/3) ... [2024-11-22 21:03:27,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645e61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:03:27, skipping insertion in model container [2024-11-22 21:03:27,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:03:24" (2/3) ... [2024-11-22 21:03:27,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645e61f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:03:27, skipping insertion in model container [2024-11-22 21:03:27,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:03:27" (3/3) ... [2024-11-22 21:03:27,243 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-11-22 21:03:27,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:03:27,256 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-22 21:03:27,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:03:27,313 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;@7f9b08bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:03:27,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-22 21:03:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 21:03:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 21:03:27,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:27,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 21:03:27,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-22 21:03:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339599454] [2024-11-22 21:03:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:27,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339599454] [2024-11-22 21:03:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339599454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:27,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:27,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:03:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132525370] [2024-11-22 21:03:27,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:27,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:27,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:27,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:27,483 INFO L87 Difference]: Start difference. First operand has 1076 states, 641 states have (on average 2.012480499219969) internal successors, (1290), 1069 states have internal predecessors, (1290), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:28,001 INFO L93 Difference]: Finished difference Result 1062 states and 1236 transitions. [2024-11-22 21:03:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:28,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-22 21:03:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:28,015 INFO L225 Difference]: With dead ends: 1062 [2024-11-22 21:03:28,015 INFO L226 Difference]: Without dead ends: 1060 [2024-11-22 21:03:28,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:28,019 INFO L432 NwaCegarLoop]: 847 mSDtfsCounter, 1101 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:28,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 899 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:03:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-22 21:03:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-22 21:03:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 643 states have (on average 1.8911353032659408) internal successors, (1216), 1053 states have internal predecessors, (1216), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1234 transitions. [2024-11-22 21:03:28,089 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1234 transitions. Word has length 3 [2024-11-22 21:03:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1234 transitions. [2024-11-22 21:03:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:28,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1234 transitions. [2024-11-22 21:03:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 21:03:28,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:28,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 21:03:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:03:28,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:28,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-22 21:03:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644049479] [2024-11-22 21:03:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644049479] [2024-11-22 21:03:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644049479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:28,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:28,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:03:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564442717] [2024-11-22 21:03:28,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:28,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:28,166 INFO L87 Difference]: Start difference. First operand 1060 states and 1234 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:28,772 INFO L93 Difference]: Finished difference Result 1379 states and 1641 transitions. [2024-11-22 21:03:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-22 21:03:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:28,777 INFO L225 Difference]: With dead ends: 1379 [2024-11-22 21:03:28,778 INFO L226 Difference]: Without dead ends: 1379 [2024-11-22 21:03:28,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:28,779 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 396 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:28,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1926 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:03:28,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-22 21:03:28,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1291. [2024-11-22 21:03:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 870 states have (on average 1.8517241379310345) internal successors, (1611), 1284 states have internal predecessors, (1611), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1639 transitions. [2024-11-22 21:03:28,807 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1639 transitions. Word has length 3 [2024-11-22 21:03:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:28,807 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1639 transitions. [2024-11-22 21:03:28,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1639 transitions. [2024-11-22 21:03:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 21:03:28,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:28,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:28,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:03:28,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:28,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-22 21:03:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:28,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162203572] [2024-11-22 21:03:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162203572] [2024-11-22 21:03:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162203572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415886415] [2024-11-22 21:03:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:29,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:03:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:03:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:29,074 INFO L87 Difference]: Start difference. First operand 1291 states and 1639 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:30,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:30,195 INFO L93 Difference]: Finished difference Result 1368 states and 1629 transitions. [2024-11-22 21:03:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:03:30,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2024-11-22 21:03:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:30,225 INFO L225 Difference]: With dead ends: 1368 [2024-11-22 21:03:30,225 INFO L226 Difference]: Without dead ends: 1368 [2024-11-22 21:03:30,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:03:30,227 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 2203 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:30,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 1195 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 21:03:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-22 21:03:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1048. [2024-11-22 21:03:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 643 states have (on average 1.8709175738724728) internal successors, (1203), 1041 states have internal predecessors, (1203), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1221 transitions. [2024-11-22 21:03:30,244 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1221 transitions. Word has length 7 [2024-11-22 21:03:30,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:30,244 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1221 transitions. [2024-11-22 21:03:30,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1221 transitions. [2024-11-22 21:03:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 21:03:30,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:30,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:30,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:03:30,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-22 21:03:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852631727] [2024-11-22 21:03:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:30,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:30,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852631727] [2024-11-22 21:03:30,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852631727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:30,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:30,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:03:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449960084] [2024-11-22 21:03:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:30,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:30,306 INFO L87 Difference]: Start difference. First operand 1048 states and 1221 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:30,877 INFO L93 Difference]: Finished difference Result 1348 states and 1608 transitions. [2024-11-22 21:03:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:30,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-22 21:03:30,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:30,889 INFO L225 Difference]: With dead ends: 1348 [2024-11-22 21:03:30,889 INFO L226 Difference]: Without dead ends: 1348 [2024-11-22 21:03:30,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:30,890 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 867 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:30,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1764 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:03:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-22 21:03:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1023. [2024-11-22 21:03:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 643 states have (on average 1.8320373250388802) internal successors, (1178), 1016 states have internal predecessors, (1178), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1196 transitions. [2024-11-22 21:03:30,933 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1196 transitions. Word has length 8 [2024-11-22 21:03:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:30,933 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1196 transitions. [2024-11-22 21:03:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1196 transitions. [2024-11-22 21:03:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 21:03:30,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:30,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:30,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:03:30,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-22 21:03:30,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:30,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577303589] [2024-11-22 21:03:30,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577303589] [2024-11-22 21:03:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577303589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:31,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:03:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479200831] [2024-11-22 21:03:31,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:31,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:31,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:31,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:31,029 INFO L87 Difference]: Start difference. First operand 1023 states and 1196 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:31,509 INFO L93 Difference]: Finished difference Result 1296 states and 1557 transitions. [2024-11-22 21:03:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-22 21:03:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:31,517 INFO L225 Difference]: With dead ends: 1296 [2024-11-22 21:03:31,518 INFO L226 Difference]: Without dead ends: 1296 [2024-11-22 21:03:31,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:31,519 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 1075 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:31,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 1491 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:03:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2024-11-22 21:03:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 976. [2024-11-22 21:03:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 643 states have (on average 1.7589424572317263) internal successors, (1131), 969 states have internal predecessors, (1131), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1149 transitions. [2024-11-22 21:03:31,552 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1149 transitions. Word has length 8 [2024-11-22 21:03:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1149 transitions. [2024-11-22 21:03:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1149 transitions. [2024-11-22 21:03:31,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 21:03:31,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:31,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:31,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:03:31,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:31,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1321547200, now seen corresponding path program 1 times [2024-11-22 21:03:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459508408] [2024-11-22 21:03:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:31,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459508408] [2024-11-22 21:03:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459508408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:31,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826695519] [2024-11-22 21:03:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:31,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:03:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:31,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:03:31,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:03:31,649 INFO L87 Difference]: Start difference. First operand 976 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:31,795 INFO L93 Difference]: Finished difference Result 1930 states and 2278 transitions. [2024-11-22 21:03:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:03:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-22 21:03:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:31,803 INFO L225 Difference]: With dead ends: 1930 [2024-11-22 21:03:31,803 INFO L226 Difference]: Without dead ends: 1930 [2024-11-22 21:03:31,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:31,804 INFO L432 NwaCegarLoop]: 1104 mSDtfsCounter, 1100 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 3298 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:31,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 3298 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 21:03:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2024-11-22 21:03:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 978. [2024-11-22 21:03:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 645 states have (on average 1.7565891472868218) internal successors, (1133), 971 states have internal predecessors, (1133), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1151 transitions. [2024-11-22 21:03:31,818 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1151 transitions. Word has length 10 [2024-11-22 21:03:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:31,818 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1151 transitions. [2024-11-22 21:03:31,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1151 transitions. [2024-11-22 21:03:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 21:03:31,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:31,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:31,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:03:31,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:31,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-22 21:03:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:31,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580808584] [2024-11-22 21:03:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580808584] [2024-11-22 21:03:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580808584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:03:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450095551] [2024-11-22 21:03:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:31,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:03:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:03:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:03:31,910 INFO L87 Difference]: Start difference. First operand 978 states and 1151 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:32,425 INFO L93 Difference]: Finished difference Result 1004 states and 1204 transitions. [2024-11-22 21:03:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:03:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-22 21:03:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:32,428 INFO L225 Difference]: With dead ends: 1004 [2024-11-22 21:03:32,428 INFO L226 Difference]: Without dead ends: 1004 [2024-11-22 21:03:32,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:32,429 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 1340 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:32,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 1336 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:03:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-22 21:03:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 955. [2024-11-22 21:03:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 645 states have (on average 1.7209302325581395) internal successors, (1110), 948 states have internal predecessors, (1110), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1128 transitions. [2024-11-22 21:03:32,440 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1128 transitions. Word has length 18 [2024-11-22 21:03:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:32,440 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1128 transitions. [2024-11-22 21:03:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1128 transitions. [2024-11-22 21:03:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 21:03:32,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:32,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:03:32,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:32,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash 183846335, now seen corresponding path program 1 times [2024-11-22 21:03:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:32,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038786299] [2024-11-22 21:03:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:32,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038786299] [2024-11-22 21:03:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038786299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:03:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865164421] [2024-11-22 21:03:32,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:32,484 INFO L87 Difference]: Start difference. First operand 955 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:32,503 INFO L93 Difference]: Finished difference Result 880 states and 1025 transitions. [2024-11-22 21:03:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-22 21:03:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:32,506 INFO L225 Difference]: With dead ends: 880 [2024-11-22 21:03:32,506 INFO L226 Difference]: Without dead ends: 880 [2024-11-22 21:03:32,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:32,507 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 61 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:32,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1953 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:03:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-22 21:03:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-11-22 21:03:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 582 states have (on average 1.7302405498281788) internal successors, (1007), 873 states have internal predecessors, (1007), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1025 transitions. [2024-11-22 21:03:32,516 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1025 transitions. Word has length 18 [2024-11-22 21:03:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1025 transitions. [2024-11-22 21:03:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1025 transitions. [2024-11-22 21:03:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 21:03:32,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:32,517 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] [2024-11-22 21:03:32,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:03:32,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 582825947, now seen corresponding path program 1 times [2024-11-22 21:03:32,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:32,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394541818] [2024-11-22 21:03:32,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:32,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394541818] [2024-11-22 21:03:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394541818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:32,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:32,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:32,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377750699] [2024-11-22 21:03:32,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:32,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:03:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:03:32,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:03:32,563 INFO L87 Difference]: Start difference. First operand 880 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:32,604 INFO L93 Difference]: Finished difference Result 862 states and 1000 transitions. [2024-11-22 21:03:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:03:32,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-22 21:03:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:32,607 INFO L225 Difference]: With dead ends: 862 [2024-11-22 21:03:32,607 INFO L226 Difference]: Without dead ends: 862 [2024-11-22 21:03:32,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:32,607 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:32,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2876 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:03:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-22 21:03:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 859. [2024-11-22 21:03:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 568 states have (on average 1.7235915492957747) internal successors, (979), 852 states have internal predecessors, (979), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 997 transitions. [2024-11-22 21:03:32,617 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 997 transitions. Word has length 20 [2024-11-22 21:03:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:32,618 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 997 transitions. [2024-11-22 21:03:32,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 997 transitions. [2024-11-22 21:03:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 21:03:32,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:32,619 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] [2024-11-22 21:03:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:03:32,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1292750889, now seen corresponding path program 1 times [2024-11-22 21:03:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225839751] [2024-11-22 21:03:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:32,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225839751] [2024-11-22 21:03:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225839751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:32,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:32,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:03:32,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553915553] [2024-11-22 21:03:32,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:03:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:32,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:03:32,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:03:32,712 INFO L87 Difference]: Start difference. First operand 859 states and 997 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:33,339 INFO L93 Difference]: Finished difference Result 1315 states and 1572 transitions. [2024-11-22 21:03:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:03:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-22 21:03:33,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:33,346 INFO L225 Difference]: With dead ends: 1315 [2024-11-22 21:03:33,346 INFO L226 Difference]: Without dead ends: 1315 [2024-11-22 21:03:33,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:33,347 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 816 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:33,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1913 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:03:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-22 21:03:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 855. [2024-11-22 21:03:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.716549295774648) internal successors, (975), 848 states have internal predecessors, (975), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 993 transitions. [2024-11-22 21:03:33,377 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 993 transitions. Word has length 34 [2024-11-22 21:03:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 993 transitions. [2024-11-22 21:03:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 993 transitions. [2024-11-22 21:03:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 21:03:33,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:33,383 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] [2024-11-22 21:03:33,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:03:33,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash 808848765, now seen corresponding path program 1 times [2024-11-22 21:03:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:33,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367793021] [2024-11-22 21:03:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:33,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367793021] [2024-11-22 21:03:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367793021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629931311] [2024-11-22 21:03:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:03:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:33,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:03:33,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:03:33,485 INFO L87 Difference]: Start difference. First operand 855 states and 993 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:33,543 INFO L93 Difference]: Finished difference Result 855 states and 989 transitions. [2024-11-22 21:03:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:03:33,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-11-22 21:03:33,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:33,550 INFO L225 Difference]: With dead ends: 855 [2024-11-22 21:03:33,550 INFO L226 Difference]: Without dead ends: 855 [2024-11-22 21:03:33,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:33,550 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 21 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:33,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2858 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:03:33,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-22 21:03:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2024-11-22 21:03:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 568 states have (on average 1.7095070422535212) internal successors, (971), 848 states have internal predecessors, (971), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 21:03:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 989 transitions. [2024-11-22 21:03:33,565 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 989 transitions. Word has length 68 [2024-11-22 21:03:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:33,565 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 989 transitions. [2024-11-22 21:03:33,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 989 transitions. [2024-11-22 21:03:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-22 21:03:33,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:33,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:03:33,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:33,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -324916151, now seen corresponding path program 1 times [2024-11-22 21:03:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479200093] [2024-11-22 21:03:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:33,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479200093] [2024-11-22 21:03:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479200093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:33,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:03:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338020971] [2024-11-22 21:03:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:33,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:03:33,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:33,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:03:33,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:33,720 INFO L87 Difference]: Start difference. First operand 855 states and 989 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:33,772 INFO L93 Difference]: Finished difference Result 1194 states and 1432 transitions. [2024-11-22 21:03:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:03:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-22 21:03:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:33,776 INFO L225 Difference]: With dead ends: 1194 [2024-11-22 21:03:33,776 INFO L226 Difference]: Without dead ends: 1194 [2024-11-22 21:03:33,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:03:33,777 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 361 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 2192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:33,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 2192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 21:03:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-22 21:03:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1140. [2024-11-22 21:03:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 848 states have (on average 1.6521226415094339) internal successors, (1401), 1133 states have internal predecessors, (1401), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1429 transitions. [2024-11-22 21:03:33,794 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1429 transitions. Word has length 76 [2024-11-22 21:03:33,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1429 transitions. [2024-11-22 21:03:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1429 transitions. [2024-11-22 21:03:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 21:03:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:33,796 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] [2024-11-22 21:03:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:03:33,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:33,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783132, now seen corresponding path program 1 times [2024-11-22 21:03:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936986134] [2024-11-22 21:03:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:34,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936986134] [2024-11-22 21:03:34,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936986134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:34,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:34,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240868672] [2024-11-22 21:03:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:34,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:03:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:03:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:34,067 INFO L87 Difference]: Start difference. First operand 1140 states and 1429 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:34,637 INFO L93 Difference]: Finished difference Result 1139 states and 1428 transitions. [2024-11-22 21:03:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:03:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-22 21:03:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:34,640 INFO L225 Difference]: With dead ends: 1139 [2024-11-22 21:03:34,641 INFO L226 Difference]: Without dead ends: 1139 [2024-11-22 21:03:34,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:03:34,641 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:34,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2905 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 21:03:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-11-22 21:03:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2024-11-22 21:03:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 848 states have (on average 1.650943396226415) internal successors, (1400), 1132 states have internal predecessors, (1400), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-22 21:03:34,654 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 84 [2024-11-22 21:03:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:34,654 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-22 21:03:34,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-22 21:03:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 21:03:34,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:34,655 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] [2024-11-22 21:03:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:03:34,655 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:34,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1012783133, now seen corresponding path program 1 times [2024-11-22 21:03:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803996077] [2024-11-22 21:03:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:34,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803996077] [2024-11-22 21:03:34,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803996077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:34,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:34,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:03:34,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993106365] [2024-11-22 21:03:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:34,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:03:34,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:34,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:03:34,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:03:34,984 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:35,580 INFO L93 Difference]: Finished difference Result 1138 states and 1427 transitions. [2024-11-22 21:03:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:03:35,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 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 84 [2024-11-22 21:03:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:35,585 INFO L225 Difference]: With dead ends: 1138 [2024-11-22 21:03:35,585 INFO L226 Difference]: Without dead ends: 1138 [2024-11-22 21:03:35,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:03:35,586 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 1 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:35,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2876 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:03:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-11-22 21:03:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-11-22 21:03:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 847 states have (on average 1.6517119244391971) internal successors, (1399), 1131 states have internal predecessors, (1399), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1427 transitions. [2024-11-22 21:03:35,605 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1427 transitions. Word has length 84 [2024-11-22 21:03:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:35,605 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1427 transitions. [2024-11-22 21:03:35,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:03:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1427 transitions. [2024-11-22 21:03:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 21:03:35,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:35,608 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-22 21:03:35,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:03:35,608 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:35,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:35,609 INFO L85 PathProgramCache]: Analyzing trace with hash 243663683, now seen corresponding path program 1 times [2024-11-22 21:03:35,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:35,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993037063] [2024-11-22 21:03:35,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:35,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:35,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:35,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993037063] [2024-11-22 21:03:35,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993037063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:35,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:35,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:03:35,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011007246] [2024-11-22 21:03:35,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:35,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:03:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:35,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:03:35,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:03:35,828 INFO L87 Difference]: Start difference. First operand 1138 states and 1427 transitions. Second operand has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:36,473 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-22 21:03:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:03:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-22 21:03:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:36,477 INFO L225 Difference]: With dead ends: 1150 [2024-11-22 21:03:36,477 INFO L226 Difference]: Without dead ends: 1150 [2024-11-22 21:03:36,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:03:36,478 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 13 mSDsluCounter, 2906 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3865 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:36,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3865 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 21:03:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-22 21:03:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1144. [2024-11-22 21:03:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6502347417840375) internal successors, (1406), 1136 states have internal predecessors, (1406), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-22 21:03:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1437 transitions. [2024-11-22 21:03:36,494 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1437 transitions. Word has length 92 [2024-11-22 21:03:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:36,494 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1437 transitions. [2024-11-22 21:03:36,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1437 transitions. [2024-11-22 21:03:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 21:03:36,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:36,495 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-22 21:03:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:03:36,496 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:36,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 243663684, now seen corresponding path program 1 times [2024-11-22 21:03:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:36,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411372226] [2024-11-22 21:03:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:36,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411372226] [2024-11-22 21:03:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411372226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:36,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:36,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:03:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371896274] [2024-11-22 21:03:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:36,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:03:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:03:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:03:36,966 INFO L87 Difference]: Start difference. First operand 1144 states and 1437 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:37,713 INFO L93 Difference]: Finished difference Result 1144 states and 1436 transitions. [2024-11-22 21:03:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:03:37,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-22 21:03:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:37,717 INFO L225 Difference]: With dead ends: 1144 [2024-11-22 21:03:37,717 INFO L226 Difference]: Without dead ends: 1144 [2024-11-22 21:03:37,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:03:37,718 INFO L432 NwaCegarLoop]: 963 mSDtfsCounter, 8 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3665 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:37,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3665 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 21:03:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-11-22 21:03:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2024-11-22 21:03:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 852 states have (on average 1.6490610328638498) internal successors, (1405), 1136 states have internal predecessors, (1405), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-22 21:03:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1436 transitions. [2024-11-22 21:03:37,732 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1436 transitions. Word has length 92 [2024-11-22 21:03:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:37,732 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1436 transitions. [2024-11-22 21:03:37,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1436 transitions. [2024-11-22 21:03:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 21:03:37,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:37,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:37,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 21:03:37,733 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:37,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:37,734 INFO L85 PathProgramCache]: Analyzing trace with hash -461782989, now seen corresponding path program 1 times [2024-11-22 21:03:37,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:37,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407342184] [2024-11-22 21:03:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:38,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407342184] [2024-11-22 21:03:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407342184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:38,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719039013] [2024-11-22 21:03:38,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:38,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:38,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:03:38,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:03:38,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 21:03:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:38,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 21:03:38,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:03:38,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:03:38,432 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:03:38,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:03:38,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:03:38,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:03:38,691 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:38,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:03:38,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:03:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:38,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:03:38,782 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))))) is different from false [2024-11-22 21:03:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719039013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:38,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:03:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-22 21:03:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786751994] [2024-11-22 21:03:38,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:03:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 21:03:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 21:03:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2024-11-22 21:03:38,786 INFO L87 Difference]: Start difference. First operand 1144 states and 1436 transitions. Second operand has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:40,992 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-22 21:03:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:03:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 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 93 [2024-11-22 21:03:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:40,995 INFO L225 Difference]: With dead ends: 1151 [2024-11-22 21:03:40,995 INFO L226 Difference]: Without dead ends: 1151 [2024-11-22 21:03:40,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=427, Unknown=1, NotChecked=42, Total=552 [2024-11-22 21:03:40,996 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 870 mSDsluCounter, 6620 mSDsCounter, 0 mSdLazyCounter, 4443 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 7246 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:40,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 7246 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4443 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:03:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-22 21:03:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1148. [2024-11-22 21:03:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 856 states have (on average 1.6460280373831775) internal successors, (1409), 1139 states have internal predecessors, (1409), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:03:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1438 transitions. [2024-11-22 21:03:41,010 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1438 transitions. Word has length 93 [2024-11-22 21:03:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:41,010 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1438 transitions. [2024-11-22 21:03:41,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.1875) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1438 transitions. [2024-11-22 21:03:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 21:03:41,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:41,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:41,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 21:03:41,212 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,SelfDestructingSolverStorable16 [2024-11-22 21:03:41,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:41,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash -461782988, now seen corresponding path program 1 times [2024-11-22 21:03:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342957982] [2024-11-22 21:03:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342957982] [2024-11-22 21:03:41,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342957982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743623717] [2024-11-22 21:03:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:41,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:41,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:03:41,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:03:41,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 21:03:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:42,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 21:03:42,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:03:42,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:03:42,172 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:03:42,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 21:03:42,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:03:42,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:03:42,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 21:03:42,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:03:42,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:03:42,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:42,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:03:42,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:03:42,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:03:42,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:03:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:42,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:03:42,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_740 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 21:03:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743623717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:42,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:03:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2024-11-22 21:03:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751820174] [2024-11-22 21:03:42,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:03:42,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 21:03:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 21:03:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2024-11-22 21:03:42,424 INFO L87 Difference]: Start difference. First operand 1148 states and 1438 transitions. Second operand has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 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-22 21:03:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:44,677 INFO L93 Difference]: Finished difference Result 1150 states and 1442 transitions. [2024-11-22 21:03:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:03:44,678 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 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 93 [2024-11-22 21:03:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:44,681 INFO L225 Difference]: With dead ends: 1150 [2024-11-22 21:03:44,681 INFO L226 Difference]: Without dead ends: 1150 [2024-11-22 21:03:44,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2024-11-22 21:03:44,683 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 869 mSDsluCounter, 5305 mSDsCounter, 0 mSdLazyCounter, 4708 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 5934 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:44,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 5934 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4708 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 21:03:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-22 21:03:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1141. [2024-11-22 21:03:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 851 states have (on average 1.6474735605170387) internal successors, (1402), 1133 states have internal predecessors, (1402), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1430 transitions. [2024-11-22 21:03:44,717 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1430 transitions. Word has length 93 [2024-11-22 21:03:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:44,717 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1430 transitions. [2024-11-22 21:03:44,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 11.75) internal successors, (141), 15 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-22 21:03:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1430 transitions. [2024-11-22 21:03:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 21:03:44,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:44,719 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-22 21:03:44,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 21:03:44,920 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,SelfDestructingSolverStorable17 [2024-11-22 21:03:44,920 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 490689540, now seen corresponding path program 1 times [2024-11-22 21:03:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:44,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119436646] [2024-11-22 21:03:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:44,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:45,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:45,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119436646] [2024-11-22 21:03:45,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119436646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:45,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 21:03:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187449935] [2024-11-22 21:03:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:03:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:45,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:03:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:03:45,332 INFO L87 Difference]: Start difference. First operand 1141 states and 1430 transitions. Second operand has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:46,853 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-22 21:03:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:03:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-22 21:03:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:46,856 INFO L225 Difference]: With dead ends: 1154 [2024-11-22 21:03:46,858 INFO L226 Difference]: Without dead ends: 1154 [2024-11-22 21:03:46,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:03:46,862 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 906 mSDsluCounter, 4843 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:46,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 5469 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 21:03:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-22 21:03:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1150. [2024-11-22 21:03:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6437718277066355) internal successors, (1412), 1141 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:03:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1441 transitions. [2024-11-22 21:03:46,880 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1441 transitions. Word has length 95 [2024-11-22 21:03:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:46,881 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1441 transitions. [2024-11-22 21:03:46,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1441 transitions. [2024-11-22 21:03:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 21:03:46,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:46,882 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-22 21:03:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 21:03:46,882 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:46,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash 490689541, now seen corresponding path program 1 times [2024-11-22 21:03:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756306394] [2024-11-22 21:03:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756306394] [2024-11-22 21:03:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756306394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 21:03:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020224101] [2024-11-22 21:03:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:47,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:03:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:03:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:03:47,595 INFO L87 Difference]: Start difference. First operand 1150 states and 1441 transitions. Second operand has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:48,905 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-22 21:03:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:03:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-22 21:03:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:48,908 INFO L225 Difference]: With dead ends: 1153 [2024-11-22 21:03:48,908 INFO L226 Difference]: Without dead ends: 1153 [2024-11-22 21:03:48,909 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-22 21:03:48,909 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 901 mSDsluCounter, 3159 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:48,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 3789 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 21:03:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-22 21:03:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-22 21:03:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 859 states have (on average 1.6426076833527357) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:03:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-22 21:03:48,919 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 95 [2024-11-22 21:03:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:48,920 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-22 21:03:48,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.3) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-22 21:03:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 21:03:48,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:48,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:48,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 21:03:48,921 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:48,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -196136684, now seen corresponding path program 1 times [2024-11-22 21:03:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:48,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479438807] [2024-11-22 21:03:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479438807] [2024-11-22 21:03:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479438807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155356047] [2024-11-22 21:03:49,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:49,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:49,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:03:49,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:03:49,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 21:03:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:49,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 21:03:49,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:03:49,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:03:49,576 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:03:49,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:03:49,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:03:49,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:03:49,763 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:49,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:03:49,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:49,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:03:49,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:03:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:49,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:03:49,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1022 (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_1022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 21:03:49,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1022 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1025))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1022)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:03:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155356047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:49,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:03:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-22 21:03:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230000507] [2024-11-22 21:03:49,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:03:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:03:49,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:03:49,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=423, Unknown=13, NotChecked=86, Total=600 [2024-11-22 21:03:49,913 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:51,959 INFO L93 Difference]: Finished difference Result 1152 states and 1444 transitions. [2024-11-22 21:03:51,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:03:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-22 21:03:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:51,968 INFO L225 Difference]: With dead ends: 1152 [2024-11-22 21:03:51,969 INFO L226 Difference]: Without dead ends: 1152 [2024-11-22 21:03:51,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=546, Unknown=13, NotChecked=98, Total=756 [2024-11-22 21:03:51,970 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 865 mSDsluCounter, 7813 mSDsCounter, 0 mSdLazyCounter, 5080 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 8438 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:51,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 8438 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5080 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 21:03:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-22 21:03:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1149. [2024-11-22 21:03:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 859 states have (on average 1.6414435389988358) internal successors, (1410), 1140 states have internal predecessors, (1410), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:03:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1439 transitions. [2024-11-22 21:03:52,005 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1439 transitions. Word has length 96 [2024-11-22 21:03:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:52,005 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1439 transitions. [2024-11-22 21:03:52,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.052631578947368) internal successors, (153), 21 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1439 transitions. [2024-11-22 21:03:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 21:03:52,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:52,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:52,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:03:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:52,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -196136683, now seen corresponding path program 1 times [2024-11-22 21:03:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118901875] [2024-11-22 21:03:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118901875] [2024-11-22 21:03:52,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118901875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167531966] [2024-11-22 21:03:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:52,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:52,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:03:52,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:03:52,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 21:03:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:53,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 21:03:53,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:03:53,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:03:53,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:03:53,287 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:03:53,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 21:03:53,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:03:53,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 21:03:53,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:03:53,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:03:53,496 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:53,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:03:53,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:03:53,559 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:03:53,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:03:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:03:53,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:03:53,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:03:53,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-22 21:03:53,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:03:53,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1177 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 21:03:53,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1184) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1184 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1183))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1184) .cse1 v_ArrVal_1177) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1178) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 21:03:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167531966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:03:53,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:03:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-11-22 21:03:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538504894] [2024-11-22 21:03:53,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:03:53,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 21:03:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:53,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 21:03:53,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=310, Unknown=9, NotChecked=74, Total=462 [2024-11-22 21:03:53,720 INFO L87 Difference]: Start difference. First operand 1149 states and 1439 transitions. Second operand has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:56,052 INFO L93 Difference]: Finished difference Result 1151 states and 1443 transitions. [2024-11-22 21:03:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:03:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-22 21:03:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:56,057 INFO L225 Difference]: With dead ends: 1151 [2024-11-22 21:03:56,060 INFO L226 Difference]: Without dead ends: 1151 [2024-11-22 21:03:56,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=488, Unknown=10, NotChecked=94, Total=702 [2024-11-22 21:03:56,061 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 868 mSDsluCounter, 5218 mSDsCounter, 0 mSdLazyCounter, 4844 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 5846 SdHoareTripleChecker+Invalid, 4865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:56,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 5846 Invalid, 4865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4844 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-22 21:03:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-22 21:03:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1139. [2024-11-22 21:03:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 851 states have (on average 1.645123384253819) internal successors, (1400), 1131 states have internal predecessors, (1400), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:03:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1428 transitions. [2024-11-22 21:03:56,075 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1428 transitions. Word has length 96 [2024-11-22 21:03:56,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1428 transitions. [2024-11-22 21:03:56,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 10.428571428571429) internal successors, (146), 17 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:03:56,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1428 transitions. [2024-11-22 21:03:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 21:03:56,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:56,076 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:56,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 21:03:56,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:03:56,281 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942966, now seen corresponding path program 1 times [2024-11-22 21:03:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760142148] [2024-11-22 21:03:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:56,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:56,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760142148] [2024-11-22 21:03:56,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760142148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:56,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:56,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 21:03:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117252558] [2024-11-22 21:03:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:56,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 21:03:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 21:03:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:03:56,731 INFO L87 Difference]: Start difference. First operand 1139 states and 1428 transitions. Second operand has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:03:58,256 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-22 21:03:58,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:03:58,256 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-22 21:03:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:03:58,259 INFO L225 Difference]: With dead ends: 1155 [2024-11-22 21:03:58,262 INFO L226 Difference]: Without dead ends: 1155 [2024-11-22 21:03:58,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-22 21:03:58,263 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 889 mSDsluCounter, 5412 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 6037 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:03:58,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 6037 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 21:03:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-22 21:03:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1151. [2024-11-22 21:03:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6392111368909512) internal successors, (1413), 1142 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:03:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1442 transitions. [2024-11-22 21:03:58,285 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1442 transitions. Word has length 98 [2024-11-22 21:03:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:03:58,286 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1442 transitions. [2024-11-22 21:03:58,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.384615384615385) internal successors, (96), 14 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:03:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1442 transitions. [2024-11-22 21:03:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 21:03:58,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:03:58,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:03:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 21:03:58,287 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:03:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:03:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1935942965, now seen corresponding path program 1 times [2024-11-22 21:03:58,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:03:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838510857] [2024-11-22 21:03:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:03:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:03:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:03:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:03:58,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:03:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838510857] [2024-11-22 21:03:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838510857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:03:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:03:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 21:03:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224831372] [2024-11-22 21:03:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:03:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:03:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:03:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:03:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:03:58,818 INFO L87 Difference]: Start difference. First operand 1151 states and 1442 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:00,715 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-22 21:04:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:04:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-22 21:04:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:00,718 INFO L225 Difference]: With dead ends: 1154 [2024-11-22 21:04:00,718 INFO L226 Difference]: Without dead ends: 1154 [2024-11-22 21:04:00,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:04:00,719 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 901 mSDsluCounter, 4132 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 4761 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:00,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 4761 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 21:04:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-22 21:04:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-22 21:04:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 862 states have (on average 1.6380510440835268) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-22 21:04:00,730 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 98 [2024-11-22 21:04:00,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-22 21:04:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-22 21:04:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 21:04:00,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:00,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:00,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 21:04:00,732 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:00,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784006, now seen corresponding path program 1 times [2024-11-22 21:04:00,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:00,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997830159] [2024-11-22 21:04:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997830159] [2024-11-22 21:04:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997830159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628289562] [2024-11-22 21:04:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:01,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 21:04:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:01,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-22 21:04:01,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:01,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:01,594 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:04:01,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:04:01,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:04:01,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:04:01,766 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:01,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:01,829 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:01,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:01,871 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:01,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:01,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:04:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:01,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:01,919 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 21:04:01,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1489))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1490)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:04:02,001 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1493))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1489)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1490)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:04:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628289562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:02,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-22 21:04:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634829203] [2024-11-22 21:04:02,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:02,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 21:04:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 21:04:02,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=542, Unknown=15, NotChecked=150, Total=812 [2024-11-22 21:04:02,005 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:04,848 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-22 21:04:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:04:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-22 21:04:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:04,856 INFO L225 Difference]: With dead ends: 1153 [2024-11-22 21:04:04,856 INFO L226 Difference]: Without dead ends: 1153 [2024-11-22 21:04:04,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=680, Unknown=16, NotChecked=168, Total=992 [2024-11-22 21:04:04,857 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 858 mSDsluCounter, 10801 mSDsCounter, 0 mSdLazyCounter, 6989 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 11425 SdHoareTripleChecker+Invalid, 7007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:04,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 11425 Invalid, 7007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6989 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-22 21:04:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-22 21:04:04,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1150. [2024-11-22 21:04:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 862 states have (on average 1.636890951276102) internal successors, (1411), 1141 states have internal predecessors, (1411), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1440 transitions. [2024-11-22 21:04:04,874 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1440 transitions. Word has length 99 [2024-11-22 21:04:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1440 transitions. [2024-11-22 21:04:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.571428571428571) internal successors, (159), 23 states have internal predecessors, (159), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1440 transitions. [2024-11-22 21:04:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 21:04:04,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:04,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:04,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 21:04:05,079 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,SelfDestructingSolverStorable24 [2024-11-22 21:04:05,079 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:05,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1951784005, now seen corresponding path program 1 times [2024-11-22 21:04:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477850328] [2024-11-22 21:04:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:05,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:05,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477850328] [2024-11-22 21:04:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477850328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007249121] [2024-11-22 21:04:05,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:05,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:05,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:05,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 21:04:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:05,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-22 21:04:05,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:05,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:06,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:04:06,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 21:04:06,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:04:06,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:04:06,264 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:04:06,265 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 41 treesize of output 38 [2024-11-22 21:04:06,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 21:04:06,315 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:04:06,315 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 50 treesize of output 45 [2024-11-22 21:04:06,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 21:04:06,391 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 21:04:06,392 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 61 treesize of output 54 [2024-11-22 21:04:06,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2024-11-22 21:04:06,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:04:06,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 21:04:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:06,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:06,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:04:06,580 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 140 treesize of output 144 [2024-11-22 21:04:06,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse0 0) (< 0 (+ (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 9)))))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse4 (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse4 0) (< (select (select (let ((.cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse4 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 9)))))) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (= (select (select (store .cse7 .cse8 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem56#1.base|) (forall ((v_ArrVal_1656 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656))) (let ((.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (or (< .cse9 0) (forall ((v_prenex_7 Int)) (<= 0 (+ (select (select (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8))))))))))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1657))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~mem56#1.base|)) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) 0))))) is different from false [2024-11-22 21:04:06,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656))) (let ((.cse0 (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse0 0) (< (select (select (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse0 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 9)))))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= .cse3 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) 0))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656))) (let ((.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse6 0) (< 0 (+ 9 (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse6 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1656)) (.cse10 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1657))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse9 (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (or (< .cse9 0) (= .cse3 (select (select (store .cse10 .cse11 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (< 0 (+ 9 (select (select (store .cse12 .cse11 (store (select .cse12 .cse11) .cse9 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2024-11-22 21:04:06,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1659 Int)) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse0 (store .cse6 .cse4 v_ArrVal_1656))) (let ((.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (< (select (select (let ((.cse1 (select (select (store .cse3 .cse4 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_1659))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 9)) (< .cse2 0))))))) (forall ((v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (= .cse7 (select (select (let ((.cse8 (store .cse9 .cse7 v_ArrVal_1657))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_1660)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (forall ((v_ArrVal_1656 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse7 v_ArrVal_1656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4) 0)))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse14 v_ArrVal_1656))) (let ((.cse12 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (< 0 (+ 9 (select (select (let ((.cse11 (select (select (store .cse13 .cse14 v_ArrVal_1657) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store .cse10 .cse11 (store (select .cse10 .cse11) .cse12 v_prenex_7))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< .cse12 0))))))) (forall ((v_prenex_7 Int) (v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1656 (Array Int Int)) (v_ArrVal_1666 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1665))) (let ((.cse15 (select (select .cse20 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse18 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1666) .cse15 v_ArrVal_1656)) (.cse16 (store .cse20 .cse15 v_ArrVal_1657))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (.cse19 (+ (select (select .cse18 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) 4))) (or (= .cse15 (select (select (store .cse16 .cse17 v_ArrVal_1660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (< 0 (+ 9 (select (select (store .cse18 .cse17 (store (select .cse18 .cse17) .cse19 v_prenex_7)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (< .cse19 0))))))))) is different from false [2024-11-22 21:04:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007249121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:06,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2024-11-22 21:04:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524971911] [2024-11-22 21:04:06,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:06,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:04:06,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:04:06,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=572, Unknown=3, NotChecked=150, Total=812 [2024-11-22 21:04:06,825 INFO L87 Difference]: Start difference. First operand 1150 states and 1440 transitions. Second operand has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:09,356 INFO L93 Difference]: Finished difference Result 1663 states and 2171 transitions. [2024-11-22 21:04:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 21:04:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-22 21:04:09,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:09,359 INFO L225 Difference]: With dead ends: 1663 [2024-11-22 21:04:09,359 INFO L226 Difference]: Without dead ends: 1663 [2024-11-22 21:04:09,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=902, Unknown=3, NotChecked=192, Total=1260 [2024-11-22 21:04:09,360 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 1284 mSDsluCounter, 6804 mSDsCounter, 0 mSdLazyCounter, 5728 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 7432 SdHoareTripleChecker+Invalid, 5773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 5728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:09,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 7432 Invalid, 5773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 5728 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 21:04:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-22 21:04:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1137. [2024-11-22 21:04:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 851 states have (on average 1.6427732079905992) internal successors, (1398), 1129 states have internal predecessors, (1398), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:04:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1426 transitions. [2024-11-22 21:04:09,376 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1426 transitions. Word has length 99 [2024-11-22 21:04:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:09,376 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1426 transitions. [2024-11-22 21:04:09,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 9.736842105263158) internal successors, (185), 22 states have internal predecessors, (185), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1426 transitions. [2024-11-22 21:04:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-22 21:04:09,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:09,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:09,387 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-22 21:04:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 21:04:09,583 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:09,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -855395989, now seen corresponding path program 1 times [2024-11-22 21:04:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855032995] [2024-11-22 21:04:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:09,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855032995] [2024-11-22 21:04:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855032995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:04:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:04:10,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 21:04:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244807574] [2024-11-22 21:04:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:04:10,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:04:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:04:10,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:04:10,018 INFO L87 Difference]: Start difference. First operand 1137 states and 1426 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:11,551 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-22 21:04:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:04:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-22 21:04:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:11,553 INFO L225 Difference]: With dead ends: 1156 [2024-11-22 21:04:11,553 INFO L226 Difference]: Without dead ends: 1156 [2024-11-22 21:04:11,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-22 21:04:11,554 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 909 mSDsluCounter, 5468 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:11,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 6095 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 21:04:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-22 21:04:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1152. [2024-11-22 21:04:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6346820809248555) internal successors, (1414), 1143 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1443 transitions. [2024-11-22 21:04:11,564 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1443 transitions. Word has length 101 [2024-11-22 21:04:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:11,564 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1443 transitions. [2024-11-22 21:04:11,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1443 transitions. [2024-11-22 21:04:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-22 21:04:11,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:11,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 21:04:11,565 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:11,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -855395988, now seen corresponding path program 1 times [2024-11-22 21:04:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:11,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787949602] [2024-11-22 21:04:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787949602] [2024-11-22 21:04:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787949602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:04:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:04:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 21:04:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604446445] [2024-11-22 21:04:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:04:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:04:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:12,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:04:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:04:12,177 INFO L87 Difference]: Start difference. First operand 1152 states and 1443 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:13,608 INFO L93 Difference]: Finished difference Result 1155 states and 1447 transitions. [2024-11-22 21:04:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:04:13,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 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 101 [2024-11-22 21:04:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:13,610 INFO L225 Difference]: With dead ends: 1155 [2024-11-22 21:04:13,610 INFO L226 Difference]: Without dead ends: 1155 [2024-11-22 21:04:13,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-22 21:04:13,611 INFO L432 NwaCegarLoop]: 628 mSDtfsCounter, 903 mSDsluCounter, 3254 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 3882 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:13,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 3882 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 21:04:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-22 21:04:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1152. [2024-11-22 21:04:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 865 states have (on average 1.6335260115606935) internal successors, (1413), 1143 states have internal predecessors, (1413), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1442 transitions. [2024-11-22 21:04:13,626 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1442 transitions. Word has length 101 [2024-11-22 21:04:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:13,626 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1442 transitions. [2024-11-22 21:04:13,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 13 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1442 transitions. [2024-11-22 21:04:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 21:04:13,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:13,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:13,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 21:04:13,627 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:13,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash -329416069, now seen corresponding path program 1 times [2024-11-22 21:04:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:13,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639612176] [2024-11-22 21:04:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639612176] [2024-11-22 21:04:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639612176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217142921] [2024-11-22 21:04:14,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:14,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:14,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:14,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:14,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 21:04:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:14,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 21:04:14,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:14,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:14,387 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:04:14,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:04:14,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:04:14,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:04:14,564 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:14,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:14,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:14,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:14,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:14,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:14,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:14,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:14,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:04:14,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-22 21:04:14,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:18,961 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array Int Int)) (v_ArrVal_1996 (Array Int Int)) (v_ArrVal_1995 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1995))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 21:04:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217142921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:23,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-22 21:04:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864330139] [2024-11-22 21:04:23,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:23,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:04:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:04:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=792, Unknown=65, NotChecked=60, Total=1056 [2024-11-22 21:04:23,132 INFO L87 Difference]: Start difference. First operand 1152 states and 1442 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:25,812 INFO L93 Difference]: Finished difference Result 1154 states and 1446 transitions. [2024-11-22 21:04:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:04:25,812 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 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 102 [2024-11-22 21:04:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:25,814 INFO L225 Difference]: With dead ends: 1154 [2024-11-22 21:04:25,814 INFO L226 Difference]: Without dead ends: 1154 [2024-11-22 21:04:25,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=163, Invalid=966, Unknown=65, NotChecked=66, Total=1260 [2024-11-22 21:04:25,815 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 853 mSDsluCounter, 6631 mSDsCounter, 0 mSdLazyCounter, 4367 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 7254 SdHoareTripleChecker+Invalid, 4388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:25,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 7254 Invalid, 4388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4367 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-22 21:04:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-11-22 21:04:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2024-11-22 21:04:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 865 states have (on average 1.6323699421965319) internal successors, (1412), 1142 states have internal predecessors, (1412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1441 transitions. [2024-11-22 21:04:25,827 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1441 transitions. Word has length 102 [2024-11-22 21:04:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:25,828 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1441 transitions. [2024-11-22 21:04:25,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 25 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1441 transitions. [2024-11-22 21:04:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-22 21:04:25,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:25,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:25,840 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-22 21:04:26,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:26,029 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:26,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash -329416068, now seen corresponding path program 1 times [2024-11-22 21:04:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781864858] [2024-11-22 21:04:26,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:26,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781864858] [2024-11-22 21:04:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781864858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20777372] [2024-11-22 21:04:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:26,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:26,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:26,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:26,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 21:04:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:27,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-22 21:04:27,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:27,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:27,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:04:27,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 21:04:27,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:04:27,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 21:04:27,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:04:27,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:04:27,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:04:27,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:27,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:04:27,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:27,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:27,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:04:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:27,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:04:27,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:27,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:27,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-22 21:04:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:27,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:04:27,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:04:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:27,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:27,605 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_2181 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-22 21:04:27,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2178) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2179))) (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~mem57#1.base| v_ArrVal_2178) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 21:04:27,639 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_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2179))) (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_2178) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2178) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-22 21:04:27,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2177))) (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~mem56#1.base| v_ArrVal_2176) .cse0 v_ArrVal_2178) (select (select (store .cse1 .cse0 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2181))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2177))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2179))) (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~mem56#1.base| v_ArrVal_2176) .cse3 v_ArrVal_2178) .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-22 21:04:27,685 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_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2177))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2179))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2176) .cse1 v_ArrVal_2178) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2177))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2176) .cse6 v_ArrVal_2178) (select (select (store .cse7 .cse6 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2181))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-22 21:04:27,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2180 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2186))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2177))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2179))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2187) .cse0 v_ArrVal_2176) .cse1 v_ArrVal_2178) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2181 (Array Int Int)) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2187 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2186 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2186))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2177))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2187) .cse7 v_ArrVal_2176) .cse8 v_ArrVal_2178) (select (select (store .cse9 .cse8 v_ArrVal_2179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2181))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-22 21:04:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20777372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:27,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2024-11-22 21:04:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708087074] [2024-11-22 21:04:27,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:27,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 21:04:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 21:04:27,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=461, Unknown=18, NotChecked=294, Total=870 [2024-11-22 21:04:27,754 INFO L87 Difference]: Start difference. First operand 1151 states and 1441 transitions. Second operand has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:30,315 INFO L93 Difference]: Finished difference Result 1153 states and 1445 transitions. [2024-11-22 21:04:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:04:30,316 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-22 21:04:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:30,319 INFO L225 Difference]: With dead ends: 1153 [2024-11-22 21:04:30,319 INFO L226 Difference]: Without dead ends: 1153 [2024-11-22 21:04:30,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=783, Unknown=18, NotChecked=378, Total=1332 [2024-11-22 21:04:30,320 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 868 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 4851 SdHoareTripleChecker+Invalid, 3901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:30,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 4851 Invalid, 3901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 21:04:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-22 21:04:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1135. [2024-11-22 21:04:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 851 states have (on average 1.6404230317273796) internal successors, (1396), 1127 states have internal predecessors, (1396), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-22 21:04:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1424 transitions. [2024-11-22 21:04:30,334 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1424 transitions. Word has length 102 [2024-11-22 21:04:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:30,335 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1424 transitions. [2024-11-22 21:04:30,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.666666666666666) internal successors, (156), 21 states have internal predecessors, (156), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1424 transitions. [2024-11-22 21:04:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 21:04:30,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:30,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:30,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 21:04:30,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:30,536 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:30,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1491035757, now seen corresponding path program 1 times [2024-11-22 21:04:30,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:30,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143586929] [2024-11-22 21:04:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143586929] [2024-11-22 21:04:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143586929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:04:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:04:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 21:04:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632672120] [2024-11-22 21:04:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:04:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:04:31,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:31,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:04:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:04:31,093 INFO L87 Difference]: Start difference. First operand 1135 states and 1424 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:32,770 INFO L93 Difference]: Finished difference Result 1158 states and 1450 transitions. [2024-11-22 21:04:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 21:04:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-22 21:04:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:32,772 INFO L225 Difference]: With dead ends: 1158 [2024-11-22 21:04:32,772 INFO L226 Difference]: Without dead ends: 1158 [2024-11-22 21:04:32,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:04:32,773 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 889 mSDsluCounter, 3612 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 4238 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:32,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 4238 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 21:04:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-22 21:04:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1154. [2024-11-22 21:04:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6294591484464902) internal successors, (1416), 1145 states have internal predecessors, (1416), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1445 transitions. [2024-11-22 21:04:32,794 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1445 transitions. Word has length 105 [2024-11-22 21:04:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:32,794 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1445 transitions. [2024-11-22 21:04:32,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 14 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1445 transitions. [2024-11-22 21:04:32,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-22 21:04:32,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:32,794 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:32,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 21:04:32,795 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1491035758, now seen corresponding path program 1 times [2024-11-22 21:04:32,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:32,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195399139] [2024-11-22 21:04:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:32,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:33,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:33,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195399139] [2024-11-22 21:04:33,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195399139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:04:33,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:04:33,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 21:04:33,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341804980] [2024-11-22 21:04:33,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:04:33,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 21:04:33,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:33,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 21:04:33,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 21:04:33,661 INFO L87 Difference]: Start difference. First operand 1154 states and 1445 transitions. Second operand has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:36,300 INFO L93 Difference]: Finished difference Result 1157 states and 1449 transitions. [2024-11-22 21:04:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 21:04:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2024-11-22 21:04:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:36,303 INFO L225 Difference]: With dead ends: 1157 [2024-11-22 21:04:36,303 INFO L226 Difference]: Without dead ends: 1157 [2024-11-22 21:04:36,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-22 21:04:36,303 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 890 mSDsluCounter, 5059 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 5682 SdHoareTripleChecker+Invalid, 4089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:36,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 5682 Invalid, 4089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 21:04:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-22 21:04:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1154. [2024-11-22 21:04:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 869 states have (on average 1.6283084004602992) internal successors, (1415), 1145 states have internal predecessors, (1415), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1444 transitions. [2024-11-22 21:04:36,312 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1444 transitions. Word has length 105 [2024-11-22 21:04:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:36,312 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1444 transitions. [2024-11-22 21:04:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.4375) internal successors, (103), 17 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 21:04:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1444 transitions. [2024-11-22 21:04:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 21:04:36,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:36,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 21:04:36,313 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1513476227, now seen corresponding path program 1 times [2024-11-22 21:04:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679256736] [2024-11-22 21:04:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679256736] [2024-11-22 21:04:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679256736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816643072] [2024-11-22 21:04:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:36,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:36,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:36,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:36,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 21:04:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:37,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 21:04:37,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:37,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:37,297 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:04:37,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:04:37,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:04:37,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-22 21:04:37,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:37,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:37,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:37,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:37,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:37,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:37,749 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:37,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:37,803 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:37,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-22 21:04:37,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-22 21:04:37,882 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-22 21:04:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-22 21:04:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:37,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:38,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816643072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:38,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-22 21:04:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770973937] [2024-11-22 21:04:38,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:38,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 21:04:38,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 21:04:38,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1234, Unknown=54, NotChecked=0, Total=1482 [2024-11-22 21:04:38,577 INFO L87 Difference]: Start difference. First operand 1154 states and 1444 transitions. Second operand has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 21:04:41,751 INFO L93 Difference]: Finished difference Result 1156 states and 1448 transitions. [2024-11-22 21:04:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 21:04:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2024-11-22 21:04:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 21:04:41,753 INFO L225 Difference]: With dead ends: 1156 [2024-11-22 21:04:41,753 INFO L226 Difference]: Without dead ends: 1156 [2024-11-22 21:04:41,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1447, Unknown=54, NotChecked=0, Total=1722 [2024-11-22 21:04:41,754 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 852 mSDsluCounter, 8416 mSDsCounter, 0 mSdLazyCounter, 5517 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 9038 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 21:04:41,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 9038 Invalid, 5540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5517 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-22 21:04:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-11-22 21:04:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2024-11-22 21:04:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 869 states have (on average 1.6271576524741083) internal successors, (1414), 1144 states have internal predecessors, (1414), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 6 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-22 21:04:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1443 transitions. [2024-11-22 21:04:41,769 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1443 transitions. Word has length 106 [2024-11-22 21:04:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 21:04:41,770 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1443 transitions. [2024-11-22 21:04:41,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 6.92) internal successors, (173), 27 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 21:04:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1443 transitions. [2024-11-22 21:04:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 21:04:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 21:04:41,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:04:41,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 21:04:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:41,973 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-22 21:04:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:04:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1513476226, now seen corresponding path program 1 times [2024-11-22 21:04:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:04:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411235752] [2024-11-22 21:04:41,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:04:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:04:42,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411235752] [2024-11-22 21:04:42,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411235752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:42,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181093825] [2024-11-22 21:04:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:04:42,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:04:42,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:04:42,958 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:04:42,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 21:04:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:04:43,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-22 21:04:43,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:04:43,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:04:43,306 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 21:04:43,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 21:04:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:04:43,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 21:04:43,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 21:04:43,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-22 21:04:43,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:04:43,618 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:43,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-22 21:04:43,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:43,714 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:43,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-22 21:04:43,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:43,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:43,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-22 21:04:43,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:43,864 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:43,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-22 21:04:43,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:43,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 21:04:43,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-22 21:04:43,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-22 21:04:43,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-22 21:04:43,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-22 21:04:44,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:04:44,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:04:44,027 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 21:04:44,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 21:04:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:04:44,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:04:44,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2752) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2753))) (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~mem58#1.base| v_ArrVal_2752) .cse1 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse2 .cse1 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))))) is different from false [2024-11-22 21:04:44,471 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2750))) (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~mem57#1.base| v_ArrVal_2751) .cse0 v_ArrVal_2752) (select (select (store .cse1 .cse0 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2755))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2750))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2753))) (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~mem57#1.base| v_ArrVal_2751) .cse3 v_ArrVal_2752) .cse4 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse5 .cse4 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false [2024-11-22 21:04:44,492 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 (or (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2750))) (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_2751) .cse1 v_ArrVal_2752) (select (select (store .cse2 .cse1 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2755))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2750))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2753))) (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_2751) .cse4 v_ArrVal_2752) .cse5 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse6 .cse5 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-22 21:04:50,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2761 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (v_ArrVal_2749 (Array Int Int))) (< 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2762))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2748))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2750))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2761) .cse0 v_ArrVal_2749) .cse1 v_ArrVal_2751) .cse2 v_ArrVal_2752) (select (select (store .cse3 .cse2 v_ArrVal_2753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2755))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)))) (forall ((v_ArrVal_2748 (Array Int Int)) (v_ArrVal_2755 (Array Int Int)) (v_ArrVal_2754 (Array Int Int)) (v_ArrVal_2753 (Array Int Int)) (v_ArrVal_2752 (Array Int Int)) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2751 (Array Int Int)) (v_ArrVal_2761 (Array Int Int)) (v_ArrVal_2750 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc61#1.base_7| Int) (v_ArrVal_2749 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc61#1.base_7|) 0)) (forall ((v_ArrVal_2756 Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2762))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_ArrVal_2748))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_2750))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_2753))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2761) .cse7 v_ArrVal_2749) .cse8 v_ArrVal_2751) .cse9 v_ArrVal_2752) .cse10 v_ArrVal_2755) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc61#1.base_7| v_ArrVal_2756) (select (select (store .cse11 .cse10 v_ArrVal_2754) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))))))) is different from false [2024-11-22 21:04:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181093825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:04:50,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:04:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2024-11-22 21:04:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426316670] [2024-11-22 21:04:50,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:04:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 21:04:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:04:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 21:04:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=957, Unknown=31, NotChecked=268, Total=1406 [2024-11-22 21:04:50,637 INFO L87 Difference]: Start difference. First operand 1153 states and 1443 transitions. Second operand has 26 states, 23 states have (on average 7.478260869565218) internal successors, (172), 26 states have internal predecessors, (172), 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)