./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:02:13,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:02:13,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:02:13,687 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:02:13,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:02:13,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:02:13,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:02:13,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:02:13,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:02:13,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:02:13,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:02:13,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:02:13,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:02:13,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:02:13,741 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:02:13,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:02:13,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:02:13,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:02:13,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:02:13,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:02:13,744 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:02:13,744 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:02:13,744 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:02:13,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:02:13,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:02:13,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:02:13,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:02:13,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:02:13,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:02:13,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:02:13,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:02:13,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:02:13,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:02:13,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:02:13,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:02:13,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:02:13,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:02:13,748 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-09 10:02:13,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:02:13,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:02:13,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:02:13,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:02:13,969 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:02:13,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-09 10:02:15,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:02:15,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:02:15,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-09 10:02:15,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26064b095/7aa8d870790442ccaf4b4b3f17d8aee2/FLAG713f6758c [2024-11-09 10:02:15,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26064b095/7aa8d870790442ccaf4b4b3f17d8aee2 [2024-11-09 10:02:15,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:02:15,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:02:15,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:02:15,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:02:15,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:02:15,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:02:15" (1/1) ... [2024-11-09 10:02:15,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c515c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:15, skipping insertion in model container [2024-11-09 10:02:15,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:02:15" (1/1) ... [2024-11-09 10:02:15,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:02:15,881 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,934 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,937 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,940 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,947 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,974 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,980 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,986 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:15,999 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:02:16,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:02:16,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:02:16,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:02:16,121 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:02:16,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16 WrapperNode [2024-11-09 10:02:16,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:02:16,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:02:16,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:02:16,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:02:16,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,221 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-09 10:02:16,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:02:16,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:02:16,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:02:16,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:02:16,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,308 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-09 10:02:16,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:02:16,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:02:16,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:02:16,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:02:16,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (1/1) ... [2024-11-09 10:02:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:02:16,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:16,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:02:16,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:02:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:02:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:02:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:02:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:02:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:02:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:02:16,471 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:02:16,471 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:02:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:02:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:02:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:02:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:02:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:02:16,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:02:16,658 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:02:16,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:02:16,663 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:02:16,704 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:02:18,498 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-09 10:02:18,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:02:18,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:02:18,530 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-09 10:02:18,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:02:18 BoogieIcfgContainer [2024-11-09 10:02:18,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:02:18,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:02:18,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:02:18,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:02:18,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:02:15" (1/3) ... [2024-11-09 10:02:18,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1c36d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:02:18, skipping insertion in model container [2024-11-09 10:02:18,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:02:16" (2/3) ... [2024-11-09 10:02:18,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1c36d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:02:18, skipping insertion in model container [2024-11-09 10:02:18,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:02:18" (3/3) ... [2024-11-09 10:02:18,538 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-1.i [2024-11-09 10:02:18,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:02:18,551 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-09 10:02:18,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:02:18,623 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;@50e8491b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:02:18,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-09 10:02:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:02:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:02:18,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:18,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:02:18,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:18,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1482245, now seen corresponding path program 1 times [2024-11-09 10:02:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916783143] [2024-11-09 10:02:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:18,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916783143] [2024-11-09 10:02:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916783143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:18,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848163675] [2024-11-09 10:02:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:18,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:18,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:18,807 INFO L87 Difference]: Start difference. First operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:19,521 INFO L93 Difference]: Finished difference Result 1437 states and 1617 transitions. [2024-11-09 10:02:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 10:02:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:19,546 INFO L225 Difference]: With dead ends: 1437 [2024-11-09 10:02:19,546 INFO L226 Difference]: Without dead ends: 1433 [2024-11-09 10:02:19,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:19,552 INFO L432 NwaCegarLoop]: 1582 mSDtfsCounter, 26 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:19,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2550 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:02:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-11-09 10:02:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1424. [2024-11-09 10:02:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 805 states have (on average 1.9838509316770185) internal successors, (1597), 1416 states have internal predecessors, (1597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:02:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1609 transitions. [2024-11-09 10:02:19,618 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1609 transitions. Word has length 4 [2024-11-09 10:02:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:19,619 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1609 transitions. [2024-11-09 10:02:19,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1609 transitions. [2024-11-09 10:02:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:02:19,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:19,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:02:19,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:02:19,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:19,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076526, now seen corresponding path program 1 times [2024-11-09 10:02:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880502282] [2024-11-09 10:02:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:19,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:19,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:19,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880502282] [2024-11-09 10:02:19,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880502282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580126675] [2024-11-09 10:02:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:19,733 INFO L87 Difference]: Start difference. First operand 1424 states and 1609 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:20,431 INFO L93 Difference]: Finished difference Result 1330 states and 1513 transitions. [2024-11-09 10:02:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:20,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 10:02:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:20,435 INFO L225 Difference]: With dead ends: 1330 [2024-11-09 10:02:20,435 INFO L226 Difference]: Without dead ends: 1330 [2024-11-09 10:02:20,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:20,436 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 1353 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:20,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 889 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:02:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-09 10:02:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-11-09 10:02:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 805 states have (on average 1.8645962732919255) internal successors, (1501), 1322 states have internal predecessors, (1501), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:02:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1513 transitions. [2024-11-09 10:02:20,455 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1513 transitions. Word has length 6 [2024-11-09 10:02:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1513 transitions. [2024-11-09 10:02:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1513 transitions. [2024-11-09 10:02:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 10:02:20,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:20,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:02:20,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:02:20,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:20,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076527, now seen corresponding path program 1 times [2024-11-09 10:02:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401873576] [2024-11-09 10:02:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:20,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401873576] [2024-11-09 10:02:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401873576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:20,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:20,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:02:20,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100043898] [2024-11-09 10:02:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:20,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:20,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:20,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:20,559 INFO L87 Difference]: Start difference. First operand 1330 states and 1513 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:21,319 INFO L93 Difference]: Finished difference Result 1746 states and 2007 transitions. [2024-11-09 10:02:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:21,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 10:02:21,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:21,324 INFO L225 Difference]: With dead ends: 1746 [2024-11-09 10:02:21,324 INFO L226 Difference]: Without dead ends: 1746 [2024-11-09 10:02:21,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:21,325 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 820 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:21,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1871 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 10:02:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-09 10:02:21,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1593. [2024-11-09 10:02:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1078 states have (on average 1.8320964749536177) internal successors, (1975), 1585 states have internal predecessors, (1975), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 10:02:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1987 transitions. [2024-11-09 10:02:21,348 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1987 transitions. Word has length 6 [2024-11-09 10:02:21,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:21,348 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 1987 transitions. [2024-11-09 10:02:21,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1987 transitions. [2024-11-09 10:02:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 10:02:21,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:21,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:21,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:02:21,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:21,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:21,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1137087712, now seen corresponding path program 1 times [2024-11-09 10:02:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116769588] [2024-11-09 10:02:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116769588] [2024-11-09 10:02:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116769588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793719848] [2024-11-09 10:02:21,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:21,413 INFO L87 Difference]: Start difference. First operand 1593 states and 1987 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-09 10:02:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:21,653 INFO L93 Difference]: Finished difference Result 2646 states and 3337 transitions. [2024-11-09 10:02:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:21,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-09 10:02:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:21,662 INFO L225 Difference]: With dead ends: 2646 [2024-11-09 10:02:21,662 INFO L226 Difference]: Without dead ends: 2644 [2024-11-09 10:02:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:21,665 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 997 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:21,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 4208 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:02:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-11-09 10:02:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2345. [2024-11-09 10:02:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1830 states have (on average 1.812568306010929) internal successors, (3317), 2334 states have internal predecessors, (3317), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3335 transitions. [2024-11-09 10:02:21,714 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3335 transitions. Word has length 7 [2024-11-09 10:02:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3335 transitions. [2024-11-09 10:02:21,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-09 10:02:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3335 transitions. [2024-11-09 10:02:21,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:02:21,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:21,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:21,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:02:21,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:21,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:21,717 INFO L85 PathProgramCache]: Analyzing trace with hash 242137368, now seen corresponding path program 1 times [2024-11-09 10:02:21,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:21,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876857359] [2024-11-09 10:02:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:21,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876857359] [2024-11-09 10:02:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876857359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112034726] [2024-11-09 10:02:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:21,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:21,807 INFO L87 Difference]: Start difference. First operand 2345 states and 3335 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:22,651 INFO L93 Difference]: Finished difference Result 2420 states and 3441 transitions. [2024-11-09 10:02:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:22,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-09 10:02:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:22,658 INFO L225 Difference]: With dead ends: 2420 [2024-11-09 10:02:22,658 INFO L226 Difference]: Without dead ends: 2420 [2024-11-09 10:02:22,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:22,660 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 1621 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:22,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1572 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:02:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-09 10:02:22,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2322. [2024-11-09 10:02:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 1830 states have (on average 1.787431693989071) internal successors, (3271), 2311 states have internal predecessors, (3271), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3289 transitions. [2024-11-09 10:02:22,695 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3289 transitions. Word has length 12 [2024-11-09 10:02:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:22,695 INFO L471 AbstractCegarLoop]: Abstraction has 2322 states and 3289 transitions. [2024-11-09 10:02:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3289 transitions. [2024-11-09 10:02:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 10:02:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:22,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:02:22,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:22,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash 242137369, now seen corresponding path program 1 times [2024-11-09 10:02:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306396624] [2024-11-09 10:02:22,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:22,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306396624] [2024-11-09 10:02:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306396624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:22,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:22,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785191764] [2024-11-09 10:02:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:22,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:22,761 INFO L87 Difference]: Start difference. First operand 2322 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:22,788 INFO L93 Difference]: Finished difference Result 2184 states and 3083 transitions. [2024-11-09 10:02:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-09 10:02:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:22,795 INFO L225 Difference]: With dead ends: 2184 [2024-11-09 10:02:22,795 INFO L226 Difference]: Without dead ends: 2184 [2024-11-09 10:02:22,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:22,795 INFO L432 NwaCegarLoop]: 1345 mSDtfsCounter, 61 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:22,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2637 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-11-09 10:02:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-11-09 10:02:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1704 states have (on average 1.7987089201877935) internal successors, (3065), 2173 states have internal predecessors, (3065), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3083 transitions. [2024-11-09 10:02:22,828 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3083 transitions. Word has length 12 [2024-11-09 10:02:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3083 transitions. [2024-11-09 10:02:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3083 transitions. [2024-11-09 10:02:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:02:22,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:22,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:22,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:02:22,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:22,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash 765933813, now seen corresponding path program 1 times [2024-11-09 10:02:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105294343] [2024-11-09 10:02:22,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:22,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:22,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:22,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105294343] [2024-11-09 10:02:22,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105294343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:22,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982175114] [2024-11-09 10:02:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:22,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:22,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:22,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:22,894 INFO L87 Difference]: Start difference. First operand 2184 states and 3083 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:22,945 INFO L93 Difference]: Finished difference Result 2155 states and 3033 transitions. [2024-11-09 10:02:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 10:02:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:22,951 INFO L225 Difference]: With dead ends: 2155 [2024-11-09 10:02:22,952 INFO L226 Difference]: Without dead ends: 2155 [2024-11-09 10:02:22,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:22,954 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 41 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:22,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3902 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-09 10:02:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2149. [2024-11-09 10:02:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1676 states have (on average 1.795346062052506) internal successors, (3009), 2138 states have internal predecessors, (3009), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3027 transitions. [2024-11-09 10:02:22,985 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3027 transitions. Word has length 14 [2024-11-09 10:02:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:22,985 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3027 transitions. [2024-11-09 10:02:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3027 transitions. [2024-11-09 10:02:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 10:02:22,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:22,986 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] [2024-11-09 10:02:22,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:02:22,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:22,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1739624061, now seen corresponding path program 1 times [2024-11-09 10:02:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:22,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419197119] [2024-11-09 10:02:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419197119] [2024-11-09 10:02:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419197119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:23,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088818472] [2024-11-09 10:02:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:23,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:23,138 INFO L87 Difference]: Start difference. First operand 2149 states and 3027 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:24,052 INFO L93 Difference]: Finished difference Result 2398 states and 3195 transitions. [2024-11-09 10:02:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:02:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2024-11-09 10:02:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:24,059 INFO L225 Difference]: With dead ends: 2398 [2024-11-09 10:02:24,059 INFO L226 Difference]: Without dead ends: 2398 [2024-11-09 10:02:24,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:24,060 INFO L432 NwaCegarLoop]: 1223 mSDtfsCounter, 825 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:24,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2627 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:02:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-11-09 10:02:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2145. [2024-11-09 10:02:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.7905727923627686) internal successors, (3001), 2134 states have internal predecessors, (3001), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3019 transitions. [2024-11-09 10:02:24,087 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3019 transitions. Word has length 28 [2024-11-09 10:02:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:24,087 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3019 transitions. [2024-11-09 10:02:24,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3019 transitions. [2024-11-09 10:02:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:02:24,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:24,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:24,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:02:24,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2099910807, now seen corresponding path program 1 times [2024-11-09 10:02:24,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117052081] [2024-11-09 10:02:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:24,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:24,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:24,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117052081] [2024-11-09 10:02:24,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117052081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:24,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:24,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:24,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161661958] [2024-11-09 10:02:24,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:02:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:24,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:02:24,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:02:24,170 INFO L87 Difference]: Start difference. First operand 2145 states and 3019 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:24,214 INFO L93 Difference]: Finished difference Result 2145 states and 3011 transitions. [2024-11-09 10:02:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:24,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-09 10:02:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:24,219 INFO L225 Difference]: With dead ends: 2145 [2024-11-09 10:02:24,220 INFO L226 Difference]: Without dead ends: 2145 [2024-11-09 10:02:24,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:24,220 INFO L432 NwaCegarLoop]: 1305 mSDtfsCounter, 21 mSDsluCounter, 2579 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:24,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3884 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-11-09 10:02:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2024-11-09 10:02:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.785799522673031) internal successors, (2993), 2134 states have internal predecessors, (2993), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3011 transitions. [2024-11-09 10:02:24,244 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3011 transitions. Word has length 62 [2024-11-09 10:02:24,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:24,245 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3011 transitions. [2024-11-09 10:02:24,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3011 transitions. [2024-11-09 10:02:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 10:02:24,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:24,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:24,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:02:24,246 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:24,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1896484451, now seen corresponding path program 1 times [2024-11-09 10:02:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:24,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243082630] [2024-11-09 10:02:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:24,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243082630] [2024-11-09 10:02:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243082630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:02:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672614336] [2024-11-09 10:02:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:02:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:02:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:24,364 INFO L87 Difference]: Start difference. First operand 2145 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:24,398 INFO L93 Difference]: Finished difference Result 1914 states and 2608 transitions. [2024-11-09 10:02:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:02:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 10:02:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:24,402 INFO L225 Difference]: With dead ends: 1914 [2024-11-09 10:02:24,402 INFO L226 Difference]: Without dead ends: 1914 [2024-11-09 10:02:24,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:02:24,403 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 54 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:24,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2612 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:02:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-09 10:02:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1914. [2024-11-09 10:02:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1445 states have (on average 1.792387543252595) internal successors, (2590), 1903 states have internal predecessors, (2590), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2608 transitions. [2024-11-09 10:02:24,422 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2608 transitions. Word has length 70 [2024-11-09 10:02:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:24,422 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2608 transitions. [2024-11-09 10:02:24,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2608 transitions. [2024-11-09 10:02:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 10:02:24,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:24,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:02:24,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:24,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2061322021, now seen corresponding path program 1 times [2024-11-09 10:02:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:24,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000241625] [2024-11-09 10:02:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000241625] [2024-11-09 10:02:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000241625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:02:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803448236] [2024-11-09 10:02:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:24,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:02:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:02:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:24,748 INFO L87 Difference]: Start difference. First operand 1914 states and 2608 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:25,823 INFO L93 Difference]: Finished difference Result 1830 states and 2483 transitions. [2024-11-09 10:02:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:02:25,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-09 10:02:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:25,828 INFO L225 Difference]: With dead ends: 1830 [2024-11-09 10:02:25,828 INFO L226 Difference]: Without dead ends: 1830 [2024-11-09 10:02:25,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:25,828 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2256 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:25,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 1594 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:02:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-09 10:02:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1557. [2024-11-09 10:02:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6902730375426622) internal successors, (1981), 1546 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1999 transitions. [2024-11-09 10:02:25,847 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1999 transitions. Word has length 73 [2024-11-09 10:02:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:25,849 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1999 transitions. [2024-11-09 10:02:25,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1999 transitions. [2024-11-09 10:02:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:02:25,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:25,853 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] [2024-11-09 10:02:25,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:02:25,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:25,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:25,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131126, now seen corresponding path program 1 times [2024-11-09 10:02:25,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:25,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881921494] [2024-11-09 10:02:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881921494] [2024-11-09 10:02:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881921494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150196416] [2024-11-09 10:02:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:26,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:26,066 INFO L87 Difference]: Start difference. First operand 1557 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:26,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:26,671 INFO L93 Difference]: Finished difference Result 1556 states and 1997 transitions. [2024-11-09 10:02:26,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:26,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-09 10:02:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:26,680 INFO L225 Difference]: With dead ends: 1556 [2024-11-09 10:02:26,680 INFO L226 Difference]: Without dead ends: 1556 [2024-11-09 10:02:26,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:02:26,681 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 2 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:26,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3468 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:02:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-09 10:02:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-11-09 10:02:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1545 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1997 transitions. [2024-11-09 10:02:26,703 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1997 transitions. Word has length 78 [2024-11-09 10:02:26,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:26,704 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1997 transitions. [2024-11-09 10:02:26,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1997 transitions. [2024-11-09 10:02:26,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 10:02:26,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:26,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:26,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:02:26,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:26,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:26,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131127, now seen corresponding path program 1 times [2024-11-09 10:02:26,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236831794] [2024-11-09 10:02:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:26,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:27,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236831794] [2024-11-09 10:02:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236831794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:27,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:27,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:02:27,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177227326] [2024-11-09 10:02:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:27,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:02:27,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:02:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:02:27,115 INFO L87 Difference]: Start difference. First operand 1556 states and 1997 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:27,970 INFO L93 Difference]: Finished difference Result 1555 states and 1995 transitions. [2024-11-09 10:02:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2024-11-09 10:02:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:27,974 INFO L225 Difference]: With dead ends: 1555 [2024-11-09 10:02:27,974 INFO L226 Difference]: Without dead ends: 1555 [2024-11-09 10:02:27,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:02:27,977 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:27,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3483 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:02:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-09 10:02:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2024-11-09 10:02:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1170 states have (on average 1.6897435897435897) internal successors, (1977), 1544 states have internal predecessors, (1977), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1995 transitions. [2024-11-09 10:02:27,999 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1995 transitions. Word has length 78 [2024-11-09 10:02:27,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:28,000 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1995 transitions. [2024-11-09 10:02:28,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:02:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1995 transitions. [2024-11-09 10:02:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:02:28,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:28,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:28,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:02:28,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:28,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552707, now seen corresponding path program 1 times [2024-11-09 10:02:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476161885] [2024-11-09 10:02:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:28,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476161885] [2024-11-09 10:02:28,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476161885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:28,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:28,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:02:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913100659] [2024-11-09 10:02:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:28,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:02:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:28,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:02:28,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:28,248 INFO L87 Difference]: Start difference. First operand 1555 states and 1995 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:29,248 INFO L93 Difference]: Finished difference Result 1573 states and 2025 transitions. [2024-11-09 10:02:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:02:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2024-11-09 10:02:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:29,253 INFO L225 Difference]: With dead ends: 1573 [2024-11-09 10:02:29,253 INFO L226 Difference]: Without dead ends: 1573 [2024-11-09 10:02:29,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:02:29,254 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 10 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:29,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5382 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:02:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-09 10:02:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1564. [2024-11-09 10:02:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6876061120543293) internal successors, (1988), 1551 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2015 transitions. [2024-11-09 10:02:29,276 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2015 transitions. Word has length 86 [2024-11-09 10:02:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:29,277 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2015 transitions. [2024-11-09 10:02:29,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2015 transitions. [2024-11-09 10:02:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 10:02:29,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:29,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:29,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:02:29,279 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:29,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552706, now seen corresponding path program 1 times [2024-11-09 10:02:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:29,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683531038] [2024-11-09 10:02:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683531038] [2024-11-09 10:02:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683531038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:29,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:29,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:02:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216082867] [2024-11-09 10:02:29,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:29,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:02:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:29,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:02:29,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:02:29,722 INFO L87 Difference]: Start difference. First operand 1564 states and 2015 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:30,688 INFO L93 Difference]: Finished difference Result 1564 states and 2013 transitions. [2024-11-09 10:02:30,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:02:30,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 86 [2024-11-09 10:02:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:30,697 INFO L225 Difference]: With dead ends: 1564 [2024-11-09 10:02:30,697 INFO L226 Difference]: Without dead ends: 1564 [2024-11-09 10:02:30,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:02:30,698 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 5 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4498 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:30,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4498 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:02:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-09 10:02:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2024-11-09 10:02:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6859083191850595) internal successors, (1986), 1551 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2013 transitions. [2024-11-09 10:02:30,748 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2013 transitions. Word has length 86 [2024-11-09 10:02:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2013 transitions. [2024-11-09 10:02:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2013 transitions. [2024-11-09 10:02:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 10:02:30,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:30,749 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] [2024-11-09 10:02:30,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:02:30,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:30,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019630, now seen corresponding path program 1 times [2024-11-09 10:02:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302315342] [2024-11-09 10:02:30,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:30,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302315342] [2024-11-09 10:02:31,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302315342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:31,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622140246] [2024-11-09 10:02:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:31,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:31,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:31,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:31,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:02:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:31,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:02:31,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:31,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:31,462 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:31,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:31,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:31,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:31,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-09 10:02:31,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:02:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:31,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:31,633 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:02:31,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:02:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622140246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:31,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-09 10:02:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769746578] [2024-11-09 10:02:31,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:31,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:02:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:02:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=197, Unknown=5, NotChecked=0, Total=240 [2024-11-09 10:02:31,670 INFO L87 Difference]: Start difference. First operand 1564 states and 2013 transitions. Second operand has 15 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:33,923 INFO L93 Difference]: Finished difference Result 1563 states and 2011 transitions. [2024-11-09 10:02:33,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:02:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-09 10:02:33,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:33,927 INFO L225 Difference]: With dead ends: 1563 [2024-11-09 10:02:33,928 INFO L226 Difference]: Without dead ends: 1563 [2024-11-09 10:02:33,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=452, Unknown=7, NotChecked=0, Total=552 [2024-11-09 10:02:33,928 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 1151 mSDsluCounter, 7980 mSDsCounter, 0 mSdLazyCounter, 5991 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 8728 SdHoareTripleChecker+Invalid, 6017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:33,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 8728 Invalid, 6017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5991 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:02:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-09 10:02:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-09 10:02:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1178 states have (on average 1.6842105263157894) internal successors, (1984), 1550 states have internal predecessors, (1984), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2011 transitions. [2024-11-09 10:02:33,943 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2011 transitions. Word has length 87 [2024-11-09 10:02:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:33,943 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2011 transitions. [2024-11-09 10:02:33,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.615384615384615) internal successors, (125), 13 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2011 transitions. [2024-11-09 10:02:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 10:02:33,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:33,944 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] [2024-11-09 10:02:33,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:02:34,144 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,SelfDestructingSolverStorable15 [2024-11-09 10:02:34,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:34,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019629, now seen corresponding path program 1 times [2024-11-09 10:02:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165835819] [2024-11-09 10:02:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165835819] [2024-11-09 10:02:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165835819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736725593] [2024-11-09 10:02:34,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:34,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:34,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:02:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:34,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:02:34,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:34,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:34,986 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:34,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:35,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:35,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:35,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:35,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2024-11-09 10:02:35,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 10:02:35,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2024-11-09 10:02:35,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 10:02:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:35,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:35,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:02:35,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-11-09 10:02:35,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))) (forall ((v_ArrVal_641 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_641) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_642 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2024-11-09 10:02:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736725593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:35,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-11-09 10:02:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736379551] [2024-11-09 10:02:35,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:35,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 10:02:35,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:35,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 10:02:35,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=399, Unknown=1, NotChecked=40, Total=506 [2024-11-09 10:02:35,351 INFO L87 Difference]: Start difference. First operand 1563 states and 2011 transitions. Second operand has 20 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:02:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:38,295 INFO L93 Difference]: Finished difference Result 1562 states and 2009 transitions. [2024-11-09 10:02:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:02:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 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 87 [2024-11-09 10:02:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:38,300 INFO L225 Difference]: With dead ends: 1562 [2024-11-09 10:02:38,300 INFO L226 Difference]: Without dead ends: 1562 [2024-11-09 10:02:38,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=596, Unknown=1, NotChecked=50, Total=756 [2024-11-09 10:02:38,301 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1150 mSDsluCounter, 8408 mSDsCounter, 0 mSdLazyCounter, 8063 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 9155 SdHoareTripleChecker+Invalid, 8087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:38,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 9155 Invalid, 8087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8063 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:02:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-09 10:02:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1553. [2024-11-09 10:02:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1170 states have (on average 1.6863247863247863) internal successors, (1973), 1542 states have internal predecessors, (1973), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2024-11-09 10:02:38,317 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 87 [2024-11-09 10:02:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2024-11-09 10:02:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.0) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:02:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2024-11-09 10:02:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:02:38,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:38,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:38,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:02:38,522 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,SelfDestructingSolverStorable16 [2024-11-09 10:02:38,523 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:38,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103956, now seen corresponding path program 1 times [2024-11-09 10:02:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:38,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003548714] [2024-11-09 10:02:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:38,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:38,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003548714] [2024-11-09 10:02:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003548714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:02:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570149344] [2024-11-09 10:02:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:38,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:02:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:02:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:02:38,895 INFO L87 Difference]: Start difference. First operand 1553 states and 1991 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:40,461 INFO L93 Difference]: Finished difference Result 1569 states and 2017 transitions. [2024-11-09 10:02:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:02:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-09 10:02:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:40,464 INFO L225 Difference]: With dead ends: 1569 [2024-11-09 10:02:40,464 INFO L226 Difference]: Without dead ends: 1569 [2024-11-09 10:02:40,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:02:40,465 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1180 mSDsluCounter, 5797 mSDsCounter, 0 mSdLazyCounter, 4507 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 6544 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:40,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 6544 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4507 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:02:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-09 10:02:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1568. [2024-11-09 10:02:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.6807432432432432) internal successors, (1990), 1555 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2017 transitions. [2024-11-09 10:02:40,484 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2017 transitions. Word has length 89 [2024-11-09 10:02:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:40,484 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2017 transitions. [2024-11-09 10:02:40,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2017 transitions. [2024-11-09 10:02:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:02:40,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:40,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:40,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:02:40,487 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:40,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103955, now seen corresponding path program 1 times [2024-11-09 10:02:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548856886] [2024-11-09 10:02:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:41,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:41,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548856886] [2024-11-09 10:02:41,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548856886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:41,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:41,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:02:41,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26115345] [2024-11-09 10:02:41,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:41,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:02:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:41,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:02:41,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:02:41,032 INFO L87 Difference]: Start difference. First operand 1568 states and 2017 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:42,446 INFO L93 Difference]: Finished difference Result 1568 states and 2015 transitions. [2024-11-09 10:02:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:02:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-09 10:02:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:42,449 INFO L225 Difference]: With dead ends: 1568 [2024-11-09 10:02:42,449 INFO L226 Difference]: Without dead ends: 1568 [2024-11-09 10:02:42,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:02:42,450 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1175 mSDsluCounter, 3114 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 3868 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:42,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 3868 Invalid, 3555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:02:42,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2024-11-09 10:02:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2024-11-09 10:02:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.679054054054054) internal successors, (1988), 1555 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2015 transitions. [2024-11-09 10:02:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2015 transitions. Word has length 89 [2024-11-09 10:02:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2015 transitions. [2024-11-09 10:02:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2015 transitions. [2024-11-09 10:02:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:02:42,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:42,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:42,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:02:42,464 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -383964681, now seen corresponding path program 1 times [2024-11-09 10:02:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721680270] [2024-11-09 10:02:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721680270] [2024-11-09 10:02:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721680270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103784946] [2024-11-09 10:02:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:42,870 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:42,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:02:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:43,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:02:43,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:43,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:43,120 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:43,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:43,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:43,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:43,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:02:43,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:43,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:02:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:02:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:43,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:43,236 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:02:43,241 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (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_897) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:02:43,273 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-09 10:02:43,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-09 10:02:43,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_900 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_900))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_897)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-09 10:02:43,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103784946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:43,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:43,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-09 10:02:43,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391323879] [2024-11-09 10:02:43,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:43,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:02:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:02:43,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=231, Unknown=3, NotChecked=96, Total=380 [2024-11-09 10:02:43,281 INFO L87 Difference]: Start difference. First operand 1568 states and 2015 transitions. Second operand has 17 states, 15 states have (on average 8.666666666666666) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:45,301 INFO L93 Difference]: Finished difference Result 1567 states and 2013 transitions. [2024-11-09 10:02:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:02:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.666666666666666) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-09 10:02:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:45,305 INFO L225 Difference]: With dead ends: 1567 [2024-11-09 10:02:45,305 INFO L226 Difference]: Without dead ends: 1567 [2024-11-09 10:02:45,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=503, Unknown=3, NotChecked=144, Total=756 [2024-11-09 10:02:45,305 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1147 mSDsluCounter, 7967 mSDsCounter, 0 mSdLazyCounter, 6013 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 8714 SdHoareTripleChecker+Invalid, 6038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 6013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:45,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 8714 Invalid, 6038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 6013 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:02:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-09 10:02:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-11-09 10:02:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1184 states have (on average 1.677364864864865) internal successors, (1986), 1554 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 10:02:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2013 transitions. [2024-11-09 10:02:45,318 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2013 transitions. Word has length 90 [2024-11-09 10:02:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:45,318 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2013 transitions. [2024-11-09 10:02:45,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.666666666666666) internal successors, (130), 15 states have internal predecessors, (130), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2013 transitions. [2024-11-09 10:02:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:02:45,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:45,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:45,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:02:45,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:45,520 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:45,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -383964680, now seen corresponding path program 1 times [2024-11-09 10:02:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863270340] [2024-11-09 10:02:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863270340] [2024-11-09 10:02:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863270340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579620132] [2024-11-09 10:02:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:46,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:46,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:46,142 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:46,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:02:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:46,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 10:02:46,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:46,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:46,419 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:46,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:46,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:02:46,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:46,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:02:46,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:02:46,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:02:46,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:46,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:02:46,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:02:46,627 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:46,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:02:46,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:02:46,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:02:46,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:02:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:46,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:46,703 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1043 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1043) |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~mem52#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:02:46,715 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_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1043 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:02:46,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1049) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (v_ArrVal_1050 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1049))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1050) .cse1 v_ArrVal_1043) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:02:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579620132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:46,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-09 10:02:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110981162] [2024-11-09 10:02:46,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:02:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:46,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:02:46,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-09 10:02:46,759 INFO L87 Difference]: Start difference. First operand 1567 states and 2013 transitions. Second operand has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:49,788 INFO L93 Difference]: Finished difference Result 1574 states and 2019 transitions. [2024-11-09 10:02:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:02:49,788 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-09 10:02:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:49,790 INFO L225 Difference]: With dead ends: 1574 [2024-11-09 10:02:49,791 INFO L226 Difference]: Without dead ends: 1574 [2024-11-09 10:02:49,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-09 10:02:49,791 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1151 mSDsluCounter, 5834 mSDsCounter, 0 mSdLazyCounter, 6945 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 6579 SdHoareTripleChecker+Invalid, 6969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:49,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 6579 Invalid, 6969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6945 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 10:02:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-09 10:02:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1556. [2024-11-09 10:02:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1174 states have (on average 1.6814310051107326) internal successors, (1974), 1544 states have internal predecessors, (1974), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:02:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1992 transitions. [2024-11-09 10:02:49,804 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1992 transitions. Word has length 90 [2024-11-09 10:02:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:49,805 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1992 transitions. [2024-11-09 10:02:49,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 16 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:02:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1992 transitions. [2024-11-09 10:02:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:02:49,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:49,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:49,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:02:50,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:50,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 612863492, now seen corresponding path program 1 times [2024-11-09 10:02:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605451155] [2024-11-09 10:02:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605451155] [2024-11-09 10:02:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605451155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:50,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:02:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895119751] [2024-11-09 10:02:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:50,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:02:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:02:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:02:50,449 INFO L87 Difference]: Start difference. First operand 1556 states and 1992 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:52,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:52,212 INFO L93 Difference]: Finished difference Result 1581 states and 2027 transitions. [2024-11-09 10:02:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:02:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-09 10:02:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:52,218 INFO L225 Difference]: With dead ends: 1581 [2024-11-09 10:02:52,219 INFO L226 Difference]: Without dead ends: 1581 [2024-11-09 10:02:52,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 10:02:52,220 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1165 mSDsluCounter, 6516 mSDsCounter, 0 mSdLazyCounter, 5033 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 7262 SdHoareTripleChecker+Invalid, 5054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:52,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 7262 Invalid, 5054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5033 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 10:02:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-09 10:02:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2024-11-09 10:02:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.6725293132328307) internal successors, (1997), 1563 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:02:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2017 transitions. [2024-11-09 10:02:52,237 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2017 transitions. Word has length 92 [2024-11-09 10:02:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:52,237 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2017 transitions. [2024-11-09 10:02:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:52,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2017 transitions. [2024-11-09 10:02:52,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 10:02:52,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:52,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 10:02:52,238 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 612863493, now seen corresponding path program 1 times [2024-11-09 10:02:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427649019] [2024-11-09 10:02:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:52,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427649019] [2024-11-09 10:02:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427649019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:02:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:02:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:02:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360624784] [2024-11-09 10:02:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:02:52,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:02:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:02:52,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:02:52,814 INFO L87 Difference]: Start difference. First operand 1577 states and 2017 transitions. Second operand has 13 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:54,396 INFO L93 Difference]: Finished difference Result 1580 states and 2025 transitions. [2024-11-09 10:02:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:02:54,397 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-09 10:02:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:54,399 INFO L225 Difference]: With dead ends: 1580 [2024-11-09 10:02:54,399 INFO L226 Difference]: Without dead ends: 1580 [2024-11-09 10:02:54,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:02:54,400 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1176 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 4499 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5301 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:54,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5301 Invalid, 4518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4499 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 10:02:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-09 10:02:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2024-11-09 10:02:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.670854271356784) internal successors, (1995), 1563 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:02:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2015 transitions. [2024-11-09 10:02:54,417 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2015 transitions. Word has length 92 [2024-11-09 10:02:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:54,418 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2015 transitions. [2024-11-09 10:02:54,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2015 transitions. [2024-11-09 10:02:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:02:54,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:54,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:54,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:02:54,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:54,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285735, now seen corresponding path program 1 times [2024-11-09 10:02:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:54,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726953457] [2024-11-09 10:02:54,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:54,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:54,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726953457] [2024-11-09 10:02:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726953457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124021282] [2024-11-09 10:02:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:54,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:54,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:02:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:55,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:02:55,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:55,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:55,149 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:55,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:55,210 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:55,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:02:55,246 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:55,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:02:55,291 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:55,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:02:55,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:02:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:55,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:55,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1329 (Array Int Int)) (v_ArrVal_1330 (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~mem52#1.base| v_ArrVal_1329))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1330)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:02:55,401 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-09 10:02:55,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-09 10:02:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124021282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:55,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 18 [2024-11-09 10:02:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200493960] [2024-11-09 10:02:55,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:55,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:02:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:55,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:02:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=404, Unknown=30, NotChecked=42, Total=552 [2024-11-09 10:02:55,434 INFO L87 Difference]: Start difference. First operand 1577 states and 2015 transitions. Second operand has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:02:57,435 INFO L93 Difference]: Finished difference Result 1579 states and 2023 transitions. [2024-11-09 10:02:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:02:57,436 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-09 10:02:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:02:57,438 INFO L225 Difference]: With dead ends: 1579 [2024-11-09 10:02:57,438 INFO L226 Difference]: Without dead ends: 1579 [2024-11-09 10:02:57,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=806, Unknown=35, NotChecked=60, Total=1056 [2024-11-09 10:02:57,439 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1149 mSDsluCounter, 7955 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 8701 SdHoareTripleChecker+Invalid, 6010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:02:57,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 8701 Invalid, 6010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5985 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:02:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-11-09 10:02:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1576. [2024-11-09 10:02:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1194 states have (on average 1.669179229480737) internal successors, (1993), 1562 states have internal predecessors, (1993), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:02:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2013 transitions. [2024-11-09 10:02:57,451 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2013 transitions. Word has length 93 [2024-11-09 10:02:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:02:57,452 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2013 transitions. [2024-11-09 10:02:57,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 17 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:02:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2013 transitions. [2024-11-09 10:02:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:02:57,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:02:57,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:02:57,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 10:02:57,653 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,SelfDestructingSolverStorable23 [2024-11-09 10:02:57,654 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:02:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:02:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285734, now seen corresponding path program 1 times [2024-11-09 10:02:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:02:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911896509] [2024-11-09 10:02:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:02:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:58,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:02:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:02:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911896509] [2024-11-09 10:02:58,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911896509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:58,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499264276] [2024-11-09 10:02:58,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:02:58,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:02:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:02:58,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:02:58,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:02:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:02:58,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 10:02:58,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:02:58,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:02:58,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:02:58,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:02:58,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:02:58,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:02:58,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:02:58,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:02:58,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:02:58,672 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:58,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:02:58,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:02:58,724 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:58,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:02:58,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:02:58,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:02:58,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:02:58,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:02:58,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:02:58,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:02:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:02:58,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:02:58,874 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_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:02:58,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1488) .cse0 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1488) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-09 10:02:58,899 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_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1488) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1489))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1488) .cse2 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-09 10:02:58,935 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1496))) (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~mem50#1.base| v_ArrVal_1497) .cse0 v_ArrVal_1488) (select (select (store .cse1 .cse0 v_ArrVal_1489) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1491))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1496 (Array Int Int)) (v_ArrVal_1491 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1496))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1489))) (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~mem50#1.base| v_ArrVal_1497) .cse3 v_ArrVal_1488) .cse4 v_ArrVal_1491) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1490) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:02:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499264276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:02:58,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:02:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-09 10:02:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542880882] [2024-11-09 10:02:58,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:02:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:02:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:02:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:02:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=13, NotChecked=172, Total=650 [2024-11-09 10:02:58,939 INFO L87 Difference]: Start difference. First operand 1576 states and 2013 transitions. Second operand has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:03:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:02,632 INFO L93 Difference]: Finished difference Result 1578 states and 2021 transitions. [2024-11-09 10:03:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:03:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-09 10:03:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:02,635 INFO L225 Difference]: With dead ends: 1578 [2024-11-09 10:03:02,635 INFO L226 Difference]: Without dead ends: 1578 [2024-11-09 10:03:02,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=792, Unknown=15, NotChecked=244, Total=1190 [2024-11-09 10:03:02,636 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1149 mSDsluCounter, 6932 mSDsCounter, 0 mSdLazyCounter, 8289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 7676 SdHoareTripleChecker+Invalid, 8312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:02,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 7676 Invalid, 8312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 8289 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 10:03:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-09 10:03:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1554. [2024-11-09 10:03:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1174 states have (on average 1.678023850085179) internal successors, (1970), 1542 states have internal predecessors, (1970), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:03:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1988 transitions. [2024-11-09 10:03:02,651 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1988 transitions. Word has length 93 [2024-11-09 10:03:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:02,651 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1988 transitions. [2024-11-09 10:03:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.176470588235293) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:03:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1988 transitions. [2024-11-09 10:03:02,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:03:02,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:02,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:02,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 10:03:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:02,855 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -89061485, now seen corresponding path program 1 times [2024-11-09 10:03:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163517506] [2024-11-09 10:03:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:03,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:03,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163517506] [2024-11-09 10:03:03,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163517506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:03,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:03,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:03:03,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993072169] [2024-11-09 10:03:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:03,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:03:03,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:03:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:03:03,320 INFO L87 Difference]: Start difference. First operand 1554 states and 1988 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:05,144 INFO L93 Difference]: Finished difference Result 1585 states and 2029 transitions. [2024-11-09 10:03:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:03:05,144 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-09 10:03:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:05,147 INFO L225 Difference]: With dead ends: 1585 [2024-11-09 10:03:05,147 INFO L226 Difference]: Without dead ends: 1585 [2024-11-09 10:03:05,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-09 10:03:05,148 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1184 mSDsluCounter, 6537 mSDsCounter, 0 mSdLazyCounter, 5034 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 7282 SdHoareTripleChecker+Invalid, 5055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:05,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 7282 Invalid, 5055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5034 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:03:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-09 10:03:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1581. [2024-11-09 10:03:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6658333333333333) internal successors, (1999), 1567 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:03:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2019 transitions. [2024-11-09 10:03:05,180 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2019 transitions. Word has length 95 [2024-11-09 10:03:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2019 transitions. [2024-11-09 10:03:05,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2019 transitions. [2024-11-09 10:03:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 10:03:05,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:05,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:05,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 10:03:05,182 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:05,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash -89061484, now seen corresponding path program 1 times [2024-11-09 10:03:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374633515] [2024-11-09 10:03:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:05,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:05,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374633515] [2024-11-09 10:03:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374633515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:05,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:03:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240847129] [2024-11-09 10:03:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:03:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:03:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:03:05,810 INFO L87 Difference]: Start difference. First operand 1581 states and 2019 transitions. Second operand has 14 states, 13 states have (on average 7.153846153846154) 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-09 10:03:07,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:07,984 INFO L93 Difference]: Finished difference Result 1584 states and 2027 transitions. [2024-11-09 10:03:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:03:07,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.153846153846154) 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-09 10:03:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:07,987 INFO L225 Difference]: With dead ends: 1584 [2024-11-09 10:03:07,987 INFO L226 Difference]: Without dead ends: 1584 [2024-11-09 10:03:07,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-09 10:03:07,988 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1159 mSDsluCounter, 4754 mSDsCounter, 0 mSdLazyCounter, 5549 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 5573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:07,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 5506 Invalid, 5573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5549 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 10:03:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-09 10:03:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1581. [2024-11-09 10:03:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6641666666666666) internal successors, (1997), 1567 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:03:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2017 transitions. [2024-11-09 10:03:07,999 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2017 transitions. Word has length 95 [2024-11-09 10:03:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2017 transitions. [2024-11-09 10:03:08,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.153846153846154) 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-09 10:03:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2017 transitions. [2024-11-09 10:03:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:03:08,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:08,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:08,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:03:08,001 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash 269601246, now seen corresponding path program 1 times [2024-11-09 10:03:08,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352226389] [2024-11-09 10:03:08,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352226389] [2024-11-09 10:03:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352226389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354922473] [2024-11-09 10:03:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:08,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:03:08,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:03:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:08,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:03:08,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:03:08,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:03:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:03:08,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:03:08,842 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:08,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:03:08,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:08,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:03:08,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:08,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:03:08,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:08,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:03:08,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:03:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:08,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:08,957 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-09 10:03:08,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (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~mem53#1.base| v_ArrVal_1801))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:03:13,028 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1800))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:03:13,097 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-09 10:03:13,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 104 [2024-11-09 10:03:13,103 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 (Array Int Int)) (v_ArrVal_1805 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1805))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1800)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1801)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1802)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 10:03:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354922473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:13,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2024-11-09 10:03:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626461700] [2024-11-09 10:03:13,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:13,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 10:03:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 10:03:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=537, Unknown=26, NotChecked=204, Total=870 [2024-11-09 10:03:13,106 INFO L87 Difference]: Start difference. First operand 1581 states and 2017 transitions. Second operand has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:16,366 INFO L93 Difference]: Finished difference Result 1583 states and 2025 transitions. [2024-11-09 10:03:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:03:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:03:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:16,369 INFO L225 Difference]: With dead ends: 1583 [2024-11-09 10:03:16,369 INFO L226 Difference]: Without dead ends: 1583 [2024-11-09 10:03:16,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=200, Invalid=1050, Unknown=26, NotChecked=284, Total=1560 [2024-11-09 10:03:16,370 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1141 mSDsluCounter, 10150 mSDsCounter, 0 mSdLazyCounter, 7478 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 10895 SdHoareTripleChecker+Invalid, 7499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 7478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:16,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 10895 Invalid, 7499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 7478 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 10:03:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-09 10:03:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1580. [2024-11-09 10:03:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1200 states have (on average 1.6625) internal successors, (1995), 1566 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:03:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2015 transitions. [2024-11-09 10:03:16,382 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2015 transitions. Word has length 96 [2024-11-09 10:03:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:16,382 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2015 transitions. [2024-11-09 10:03:16,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.3) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2015 transitions. [2024-11-09 10:03:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:03:16,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:16,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 10:03:16,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:16,588 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:16,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash 269601247, now seen corresponding path program 1 times [2024-11-09 10:03:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:16,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578721299] [2024-11-09 10:03:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578721299] [2024-11-09 10:03:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578721299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753278777] [2024-11-09 10:03:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:17,349 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:03:17,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 10:03:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:17,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 10:03:17,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:17,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:03:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:03:17,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:03:17,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 10:03:17,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:03:17,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 10:03:17,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:03:17,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:03:17,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:17,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:17,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:17,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:17,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:17,948 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:17,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:17,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:18,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:18,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:18,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:03:18,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:03:18,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:18,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:18,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:03:18,112 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_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1977 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 10:03:18,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1975) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1974))) (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~mem53#1.base| v_ArrVal_1975) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-09 10:03:18,141 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_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1974))) (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_1975) .cse1 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1975) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-09 10:03:18,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1972))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse0 v_ArrVal_1975) (select (select (store .cse1 .cse0 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1977))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1972))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1974))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1973) .cse3 v_ArrVal_1975) .cse4 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-09 10:03:18,173 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_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1972))) (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_1973) .cse1 v_ArrVal_1975) (select (select (store .cse2 .cse1 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1977))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1972 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1972))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1974))) (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_1973) .cse4 v_ArrVal_1975) .cse5 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-09 10:03:18,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1972))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1982) .cse0 v_ArrVal_1973) .cse1 v_ArrVal_1975) (select (select (store .cse2 .cse1 v_ArrVal_1974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1977))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1976 (Array Int Int)) (v_ArrVal_1975 (Array Int Int)) (v_ArrVal_1974 (Array Int Int)) (v_ArrVal_1973 (Array Int Int)) (v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1972 (Array Int Int)) (v_ArrVal_1982 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1983))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1972))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1974))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1982) .cse5 v_ArrVal_1973) .cse6 v_ArrVal_1975) .cse7 v_ArrVal_1977) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-09 10:03:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753278777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:18,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-09 10:03:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195401919] [2024-11-09 10:03:18,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:18,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:03:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:18,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:03:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=618, Unknown=7, NotChecked=392, Total=1122 [2024-11-09 10:03:18,232 INFO L87 Difference]: Start difference. First operand 1580 states and 2015 transitions. Second operand has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:23,437 INFO L93 Difference]: Finished difference Result 1582 states and 2023 transitions. [2024-11-09 10:03:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:03:23,437 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-09 10:03:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:23,439 INFO L225 Difference]: With dead ends: 1582 [2024-11-09 10:03:23,440 INFO L226 Difference]: Without dead ends: 1582 [2024-11-09 10:03:23,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1036, Unknown=7, NotChecked=504, Total=1722 [2024-11-09 10:03:23,444 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1149 mSDsluCounter, 8596 mSDsCounter, 0 mSdLazyCounter, 10274 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 9346 SdHoareTripleChecker+Invalid, 10309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 10274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:23,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 9346 Invalid, 10309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 10274 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 10:03:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-09 10:03:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1552. [2024-11-09 10:03:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1174 states have (on average 1.6746166950596253) internal successors, (1966), 1540 states have internal predecessors, (1966), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 10:03:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1984 transitions. [2024-11-09 10:03:23,460 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1984 transitions. Word has length 96 [2024-11-09 10:03:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:23,461 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1984 transitions. [2024-11-09 10:03:23,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.0) internal successors, (154), 24 states have internal predecessors, (154), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:03:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1984 transitions. [2024-11-09 10:03:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:03:23,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:23,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:23,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 10:03:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 10:03:23,666 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1508421354, now seen corresponding path program 1 times [2024-11-09 10:03:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451975179] [2024-11-09 10:03:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:24,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:24,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:24,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451975179] [2024-11-09 10:03:24,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451975179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:03:24,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:03:24,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:03:24,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710817198] [2024-11-09 10:03:24,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:03:24,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:03:24,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:03:24,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:03:24,611 INFO L87 Difference]: Start difference. First operand 1552 states and 1984 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:03:28,963 INFO L93 Difference]: Finished difference Result 1590 states and 2031 transitions. [2024-11-09 10:03:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:03:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-09 10:03:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:03:28,966 INFO L225 Difference]: With dead ends: 1590 [2024-11-09 10:03:28,966 INFO L226 Difference]: Without dead ends: 1590 [2024-11-09 10:03:28,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-09 10:03:28,966 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1159 mSDsluCounter, 7595 mSDsCounter, 0 mSdLazyCounter, 8835 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 8339 SdHoareTripleChecker+Invalid, 8859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:03:28,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 8339 Invalid, 8859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8835 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 10:03:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-09 10:03:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1587. [2024-11-09 10:03:28,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1208 states have (on average 1.656456953642384) internal successors, (2001), 1573 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-09 10:03:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2021 transitions. [2024-11-09 10:03:28,978 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2021 transitions. Word has length 99 [2024-11-09 10:03:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:03:28,978 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2021 transitions. [2024-11-09 10:03:28,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:03:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2021 transitions. [2024-11-09 10:03:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:03:28,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:03:28,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:03:28,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 10:03:28,979 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-09 10:03:28,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:03:28,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1117260319, now seen corresponding path program 1 times [2024-11-09 10:03:28,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:03:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144181130] [2024-11-09 10:03:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:03:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 10:03:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:30,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:03:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144181130] [2024-11-09 10:03:30,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144181130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:30,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128092091] [2024-11-09 10:03:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:03:30,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:03:30,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:03:30,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:03:30,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:03:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:03:30,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 10:03:30,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:03:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:03:30,427 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:03:30,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 10:03:30,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:03:30,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:03:30,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 10:03:30,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 10:03:30,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 10:03:30,701 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:30,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:30,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:30,791 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:30,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:30,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:30,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:30,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:03:30,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:03:30,941 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:30,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 81 treesize of output 74 [2024-11-09 10:03:30,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 10:03:31,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:03:31,059 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 81 treesize of output 74 [2024-11-09 10:03:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2024-11-09 10:03:31,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2024-11-09 10:03:31,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-11-09 10:03:31,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:03:31,149 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 16 treesize of output 11 [2024-11-09 10:03:31,164 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 10:03:31,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 10:03:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:03:31,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:03:31,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2247))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2248))) (or (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)) (forall ((v_ArrVal_2253 Int)) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2249))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store .cse0 .cse1 v_ArrVal_2250) .cse2 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2253) (select (select (store .cse4 .cse2 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (< (select |c_#length| .cse1) (+ 12 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (or (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2247))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2248))) (or (< 0 (+ (select (select (store (store .cse6 .cse7 v_ArrVal_2250) (select (select (store .cse8 .cse7 v_ArrVal_2249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)) (< (select |c_#length| .cse7) (+ 12 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))))) is different from false [2024-11-09 10:03:33,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2245 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2258))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2245))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse6 .cse5 v_ArrVal_2247))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2259) .cse4 v_ArrVal_2246) .cse5 v_ArrVal_2248)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12)) (< 0 (+ (select (select (store (store .cse1 .cse0 v_ArrVal_2250) (select (select (store .cse3 .cse0 v_ArrVal_2249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))))))))))) (forall ((v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2245 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2258))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse15 (store .cse16 .cse13 v_ArrVal_2245))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse12 (store .cse15 .cse14 v_ArrVal_2247))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2259) .cse13 v_ArrVal_2246) .cse14 v_ArrVal_2248)) (.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (< (select |c_#length| .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12)) (forall ((v_ArrVal_2249 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (or (forall ((v_ArrVal_2253 Int)) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_2249))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store .cse9 .cse8 v_ArrVal_2250) .cse10 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2253) (select (select (store .cse11 .cse10 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))))))))))))) is different from false [2024-11-09 10:03:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128092091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:03:33,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:03:33,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2024-11-09 10:03:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128427206] [2024-11-09 10:03:33,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:03:33,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 10:03:33,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:03:33,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 10:03:33,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1442, Unknown=28, NotChecked=158, Total=1806 [2024-11-09 10:03:33,124 INFO L87 Difference]: Start difference. First operand 1587 states and 2021 transitions. Second operand has 31 states, 28 states have (on average 5.785714285714286) internal successors, (162), 30 states have internal predecessors, (162), 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)