./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:12:23,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:12:23,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:12:23,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:12:23,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:12:23,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:12:23,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:12:23,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:12:23,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:12:23,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:12:23,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:12:23,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:12:23,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:12:23,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:12:23,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:12:23,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:12:23,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:12:23,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:12:23,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:12:23,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:12:23,574 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:12:23,576 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:12:23,577 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:12:23,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:12:23,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:12:23,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:12:23,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:12:23,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:12:23,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:12:23,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:12:23,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:12:23,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:12:23,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:12:23,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:23,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:12:23,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:12:23,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:12:23,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:12:23,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:12:23,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:12:23,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:12:23,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:12:23,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-09 10:12:23,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:12:23,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:12:23,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:12:23,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:12:23,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:12:23,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-11-09 10:12:25,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:12:25,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:12:25,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2024-11-09 10:12:25,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95ee3774/8110a22f71d04adbb2af25db2f18facd/FLAG87a395315 [2024-11-09 10:12:25,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a95ee3774/8110a22f71d04adbb2af25db2f18facd [2024-11-09 10:12:25,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:12:25,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:12:25,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:25,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:12:25,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:12:25,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:25" (1/1) ... [2024-11-09 10:12:25,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473b4127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:25, skipping insertion in model container [2024-11-09 10:12:25,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:12:25" (1/1) ... [2024-11-09 10:12:25,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:12:26,205 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:12:26,246 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:12:26,250 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:12:26,254 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:12:26,261 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:12:26,300 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:12:26,303 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:12:26,305 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:12:26,306 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:12:26,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:26,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:12:26,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:12:26,536 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:12:26,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26 WrapperNode [2024-11-09 10:12:26,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:12:26,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:26,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:12:26,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:12:26,545 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:12:26" (1/1) ... [2024-11-09 10:12:26,571 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:12:26" (1/1) ... [2024-11-09 10:12:26,631 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1289 [2024-11-09 10:12:26,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:12:26,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:12:26,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:12:26,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:12:26,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,717 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-09 10:12:26,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:12:26,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:12:26,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:12:26,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:12:26,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (1/1) ... [2024-11-09 10:12:26,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:12:26,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:26,842 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:12:26,844 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:12:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:26,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 10:12:26,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 10:12:26,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 10:12:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:12:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:12:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:12:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:12:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:12:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:12:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:12:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:12:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:12:26,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:12:27,075 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:12:27,077 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:12:27,080 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:27,132 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:27,155 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 10:12:29,049 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-09 10:12:29,049 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:12:29,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:12:29,091 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 10:12:29,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:12:29 BoogieIcfgContainer [2024-11-09 10:12:29,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:12:29,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:12:29,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:12:29,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:12:29,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:12:25" (1/3) ... [2024-11-09 10:12:29,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f4ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:29, skipping insertion in model container [2024-11-09 10:12:29,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:12:26" (2/3) ... [2024-11-09 10:12:29,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f4ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:12:29, skipping insertion in model container [2024-11-09 10:12:29,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:12:29" (3/3) ... [2024-11-09 10:12:29,100 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2024-11-09 10:12:29,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:12:29,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 10:12:29,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:12:29,204 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;@60619758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:12:29,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 10:12:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:12:29,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:29,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:12:29,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1758832, now seen corresponding path program 1 times [2024-11-09 10:12:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:29,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138940753] [2024-11-09 10:12:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:29,502 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:12:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:29,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138940753] [2024-11-09 10:12:29,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138940753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:29,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:29,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457017791] [2024-11-09 10:12:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:29,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:29,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:29,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:29,543 INFO L87 Difference]: Start difference. First operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:30,566 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-09 10:12:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 10:12:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:30,585 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 10:12:30,585 INFO L226 Difference]: Without dead ends: 1345 [2024-11-09 10:12:30,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:30,590 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:30,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2648 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 10:12:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-09 10:12:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-09 10:12:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 844 states have (on average 1.8815165876777251) internal successors, (1588), 1255 states have internal predecessors, (1588), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-09 10:12:30,690 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-09 10:12:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-09 10:12:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-09 10:12:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:12:30,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:30,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:12:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:12:30,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 10:12:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:30,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972538413] [2024-11-09 10:12:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:30,769 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:12:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972538413] [2024-11-09 10:12:30,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972538413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:30,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:30,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023144368] [2024-11-09 10:12:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:30,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:30,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:30,774 INFO L87 Difference]: Start difference. First operand 1260 states and 1594 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:31,298 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-09 10:12:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:31,299 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:12:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:31,305 INFO L225 Difference]: With dead ends: 1257 [2024-11-09 10:12:31,305 INFO L226 Difference]: Without dead ends: 1257 [2024-11-09 10:12:31,308 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:12:31,309 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:31,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-09 10:12:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-09 10:12:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 852 states have (on average 1.8544600938967135) internal successors, (1580), 1252 states have internal predecessors, (1580), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 10:12:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-09 10:12:31,343 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-09 10:12:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:31,343 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-09 10:12:31,343 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:12:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-09 10:12:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 10:12:31,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:31,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 10:12:31,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:12:31,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:31,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 10:12:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205290729] [2024-11-09 10:12:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:31,426 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:12:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205290729] [2024-11-09 10:12:31,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205290729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:31,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:31,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074765569] [2024-11-09 10:12:31,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:31,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:31,429 INFO L87 Difference]: Start difference. First operand 1257 states and 1586 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:32,247 INFO L93 Difference]: Finished difference Result 2016 states and 2490 transitions. [2024-11-09 10:12:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:32,248 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:12:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:32,255 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 10:12:32,255 INFO L226 Difference]: Without dead ends: 2016 [2024-11-09 10:12:32,256 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:12:32,257 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 903 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:32,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1693 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:12:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-09 10:12:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1754. [2024-11-09 10:12:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1350 states have (on average 1.8288888888888888) internal successors, (2469), 1747 states have internal predecessors, (2469), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2479 transitions. [2024-11-09 10:12:32,298 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2479 transitions. Word has length 4 [2024-11-09 10:12:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:32,299 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2479 transitions. [2024-11-09 10:12:32,299 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:12:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2479 transitions. [2024-11-09 10:12:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:12:32,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:32,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:32,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:12:32,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:32,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 10:12:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:32,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177296982] [2024-11-09 10:12:32,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:32,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:32,357 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:12:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:32,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177296982] [2024-11-09 10:12:32,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177296982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:32,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:32,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37305612] [2024-11-09 10:12:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:32,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:32,360 INFO L87 Difference]: Start difference. First operand 1754 states and 2479 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:32,960 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2024-11-09 10:12:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:12:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:32,967 INFO L225 Difference]: With dead ends: 1792 [2024-11-09 10:12:32,967 INFO L226 Difference]: Without dead ends: 1792 [2024-11-09 10:12:32,967 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:12:32,969 INFO L432 NwaCegarLoop]: 1122 mSDtfsCounter, 1071 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:32,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1418 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:12:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-09 10:12:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1707. [2024-11-09 10:12:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1350 states have (on average 1.7762962962962963) internal successors, (2398), 1700 states have internal predecessors, (2398), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2408 transitions. [2024-11-09 10:12:33,012 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2408 transitions. Word has length 9 [2024-11-09 10:12:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:33,012 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2408 transitions. [2024-11-09 10:12:33,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2408 transitions. [2024-11-09 10:12:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:12:33,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:33,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:33,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:12:33,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 10:12:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173373294] [2024-11-09 10:12:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:33,162 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:12:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:33,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173373294] [2024-11-09 10:12:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173373294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:33,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:33,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:12:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395054780] [2024-11-09 10:12:33,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:33,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:33,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:33,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:33,167 INFO L87 Difference]: Start difference. First operand 1707 states and 2408 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:33,734 INFO L93 Difference]: Finished difference Result 2000 states and 2752 transitions. [2024-11-09 10:12:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:33,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:12:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:33,742 INFO L225 Difference]: With dead ends: 2000 [2024-11-09 10:12:33,742 INFO L226 Difference]: Without dead ends: 2000 [2024-11-09 10:12:33,743 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:12:33,744 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 863 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:33,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1666 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-09 10:12:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1682. [2024-11-09 10:12:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1350 states have (on average 1.74) internal successors, (2349), 1675 states have internal predecessors, (2349), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2024-11-09 10:12:33,784 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 9 [2024-11-09 10:12:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:33,784 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2024-11-09 10:12:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2024-11-09 10:12:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:12:33,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:33,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:33,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:12:33,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash -186143240, now seen corresponding path program 1 times [2024-11-09 10:12:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:33,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801363094] [2024-11-09 10:12:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:33,856 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:12:33,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:33,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801363094] [2024-11-09 10:12:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801363094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247317494] [2024-11-09 10:12:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:33,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:33,858 INFO L87 Difference]: Start difference. First operand 1682 states and 2359 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:34,470 INFO L93 Difference]: Finished difference Result 1806 states and 2518 transitions. [2024-11-09 10:12:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 10:12:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:34,477 INFO L225 Difference]: With dead ends: 1806 [2024-11-09 10:12:34,477 INFO L226 Difference]: Without dead ends: 1806 [2024-11-09 10:12:34,477 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:12:34,478 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1286 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:34,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1400 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:12:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-09 10:12:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1659. [2024-11-09 10:12:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1350 states have (on average 1.6888888888888889) internal successors, (2280), 1652 states have internal predecessors, (2280), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2290 transitions. [2024-11-09 10:12:34,514 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2290 transitions. Word has length 14 [2024-11-09 10:12:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:34,515 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2290 transitions. [2024-11-09 10:12:34,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2290 transitions. [2024-11-09 10:12:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 10:12:34,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:34,516 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:34,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:12:34,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:34,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:34,517 INFO L85 PathProgramCache]: Analyzing trace with hash -186143239, now seen corresponding path program 1 times [2024-11-09 10:12:34,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:34,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947107738] [2024-11-09 10:12:34,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:12:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947107738] [2024-11-09 10:12:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947107738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993909164] [2024-11-09 10:12:34,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:34,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:34,670 INFO L87 Difference]: Start difference. First operand 1659 states and 2290 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:35,528 INFO L93 Difference]: Finished difference Result 2160 states and 2773 transitions. [2024-11-09 10:12:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 10:12:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:35,536 INFO L225 Difference]: With dead ends: 2160 [2024-11-09 10:12:35,536 INFO L226 Difference]: Without dead ends: 2160 [2024-11-09 10:12:35,536 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:12:35,537 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 1277 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:35,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2252 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:12:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-09 10:12:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1755. [2024-11-09 10:12:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1446 states have (on average 1.669432918395574) internal successors, (2414), 1748 states have internal predecessors, (2414), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2424 transitions. [2024-11-09 10:12:35,570 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2424 transitions. Word has length 14 [2024-11-09 10:12:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:35,570 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2424 transitions. [2024-11-09 10:12:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2424 transitions. [2024-11-09 10:12:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:12:35,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:35,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:35,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 10:12:35,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1505170837, now seen corresponding path program 1 times [2024-11-09 10:12:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565268395] [2024-11-09 10:12:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:35,627 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:12:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565268395] [2024-11-09 10:12:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565268395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636367650] [2024-11-09 10:12:35,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:35,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:35,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:35,631 INFO L87 Difference]: Start difference. First operand 1755 states and 2424 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:35,682 INFO L93 Difference]: Finished difference Result 1427 states and 1907 transitions. [2024-11-09 10:12:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:12:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 10:12:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:35,686 INFO L225 Difference]: With dead ends: 1427 [2024-11-09 10:12:35,687 INFO L226 Difference]: Without dead ends: 1427 [2024-11-09 10:12:35,687 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:12:35,687 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 45 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:35,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2809 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-09 10:12:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-09 10:12:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1137 states have (on average 1.6684256816182939) internal successors, (1897), 1420 states have internal predecessors, (1897), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1907 transitions. [2024-11-09 10:12:35,708 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1907 transitions. Word has length 16 [2024-11-09 10:12:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:35,709 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1907 transitions. [2024-11-09 10:12:35,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1907 transitions. [2024-11-09 10:12:35,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:12:35,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:35,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:35,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:12:35,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:35,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 10:12:35,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:35,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823285966] [2024-11-09 10:12:35,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:35,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:35,773 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:12:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:35,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823285966] [2024-11-09 10:12:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823285966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242696693] [2024-11-09 10:12:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:35,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:35,775 INFO L87 Difference]: Start difference. First operand 1427 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:36,271 INFO L93 Difference]: Finished difference Result 1541 states and 2015 transitions. [2024-11-09 10:12:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 10:12:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:36,277 INFO L225 Difference]: With dead ends: 1541 [2024-11-09 10:12:36,277 INFO L226 Difference]: Without dead ends: 1541 [2024-11-09 10:12:36,277 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:12:36,278 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 1182 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:36,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1653 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-09 10:12:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1404. [2024-11-09 10:12:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1137 states have (on average 1.6279683377308707) internal successors, (1851), 1397 states have internal predecessors, (1851), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1861 transitions. [2024-11-09 10:12:36,300 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1861 transitions. Word has length 19 [2024-11-09 10:12:36,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:36,300 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1861 transitions. [2024-11-09 10:12:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1861 transitions. [2024-11-09 10:12:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:12:36,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:36,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:36,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:12:36,301 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:36,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:36,302 INFO L85 PathProgramCache]: Analyzing trace with hash -179577125, now seen corresponding path program 1 times [2024-11-09 10:12:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:36,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102940055] [2024-11-09 10:12:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:36,372 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:12:36,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:36,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102940055] [2024-11-09 10:12:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102940055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678513625] [2024-11-09 10:12:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:36,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:36,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:36,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:36,374 INFO L87 Difference]: Start difference. First operand 1404 states and 1861 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:36,399 INFO L93 Difference]: Finished difference Result 1266 states and 1655 transitions. [2024-11-09 10:12:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 10:12:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:36,406 INFO L225 Difference]: With dead ends: 1266 [2024-11-09 10:12:36,407 INFO L226 Difference]: Without dead ends: 1266 [2024-11-09 10:12:36,407 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:12:36,408 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 61 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:36,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1603 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-09 10:12:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-09 10:12:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1011 states have (on average 1.6271018793273986) internal successors, (1645), 1259 states have internal predecessors, (1645), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1655 transitions. [2024-11-09 10:12:36,430 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1655 transitions. Word has length 19 [2024-11-09 10:12:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:36,430 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1655 transitions. [2024-11-09 10:12:36,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1655 transitions. [2024-11-09 10:12:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:12:36,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:36,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:36,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:12:36,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:36,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash -774768265, now seen corresponding path program 1 times [2024-11-09 10:12:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:36,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421817285] [2024-11-09 10:12:36,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:36,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:36,501 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:12:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421817285] [2024-11-09 10:12:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421817285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557632794] [2024-11-09 10:12:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:36,504 INFO L87 Difference]: Start difference. First operand 1266 states and 1655 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:36,549 INFO L93 Difference]: Finished difference Result 1237 states and 1605 transitions. [2024-11-09 10:12:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:36,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 10:12:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:36,553 INFO L225 Difference]: With dead ends: 1237 [2024-11-09 10:12:36,553 INFO L226 Difference]: Without dead ends: 1237 [2024-11-09 10:12:36,554 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:12:36,554 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 41 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:36,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2351 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-09 10:12:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1231. [2024-11-09 10:12:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 983 states have (on average 1.6164801627670398) internal successors, (1589), 1224 states have internal predecessors, (1589), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1599 transitions. [2024-11-09 10:12:36,571 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1599 transitions. Word has length 21 [2024-11-09 10:12:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:36,572 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1599 transitions. [2024-11-09 10:12:36,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1599 transitions. [2024-11-09 10:12:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:12:36,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:36,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:36,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:12:36,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:36,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -441307835, now seen corresponding path program 1 times [2024-11-09 10:12:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469834943] [2024-11-09 10:12:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:36,745 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:12:36,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469834943] [2024-11-09 10:12:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469834943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:36,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588643394] [2024-11-09 10:12:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:36,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:36,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:36,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:36,748 INFO L87 Difference]: Start difference. First operand 1231 states and 1599 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:37,352 INFO L93 Difference]: Finished difference Result 1813 states and 2395 transitions. [2024-11-09 10:12:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:12:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 10:12:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:37,360 INFO L225 Difference]: With dead ends: 1813 [2024-11-09 10:12:37,360 INFO L226 Difference]: Without dead ends: 1813 [2024-11-09 10:12:37,360 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:12:37,361 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 658 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:37,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1905 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:12:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-09 10:12:37,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1227. [2024-11-09 10:12:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 983 states have (on average 1.6083418107833163) internal successors, (1581), 1220 states have internal predecessors, (1581), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1591 transitions. [2024-11-09 10:12:37,384 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1591 transitions. Word has length 35 [2024-11-09 10:12:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:37,385 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1591 transitions. [2024-11-09 10:12:37,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1591 transitions. [2024-11-09 10:12:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 10:12:37,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:37,387 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:12:37,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:12:37,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1141586281, now seen corresponding path program 1 times [2024-11-09 10:12:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306076551] [2024-11-09 10:12:37,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:37,461 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:12:37,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:37,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306076551] [2024-11-09 10:12:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306076551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686633724] [2024-11-09 10:12:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:37,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:37,463 INFO L87 Difference]: Start difference. First operand 1227 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:37,509 INFO L93 Difference]: Finished difference Result 1209 states and 1561 transitions. [2024-11-09 10:12:37,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:12:37,510 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:12:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:37,513 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:12:37,513 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:12:37,513 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:12:37,514 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 27 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:37,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2327 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:12:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:12:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.6072538860103627) internal successors, (1551), 1202 states have internal predecessors, (1551), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1561 transitions. [2024-11-09 10:12:37,534 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1561 transitions. Word has length 62 [2024-11-09 10:12:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:37,534 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1561 transitions. [2024-11-09 10:12:37,534 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:12:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1561 transitions. [2024-11-09 10:12:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:12:37,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:37,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:37,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:12:37,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:37,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 116988697, now seen corresponding path program 1 times [2024-11-09 10:12:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:37,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947296540] [2024-11-09 10:12:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:37,634 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:12:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:37,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947296540] [2024-11-09 10:12:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947296540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:37,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:37,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686382169] [2024-11-09 10:12:37,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:37,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:12:37,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:37,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:12:37,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:12:37,636 INFO L87 Difference]: Start difference. First operand 1209 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:37,680 INFO L93 Difference]: Finished difference Result 1209 states and 1553 transitions. [2024-11-09 10:12:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:12:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-09 10:12:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:37,685 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 10:12:37,685 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 10:12:37,685 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:12:37,685 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 21 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:37,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2321 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 10:12:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 10:12:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.5989637305699482) internal successors, (1543), 1202 states have internal predecessors, (1543), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1553 transitions. [2024-11-09 10:12:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1553 transitions. Word has length 69 [2024-11-09 10:12:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1553 transitions. [2024-11-09 10:12:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1553 transitions. [2024-11-09 10:12:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 10:12:37,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:37,715 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:12:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:12:37,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1547714973, now seen corresponding path program 1 times [2024-11-09 10:12:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926726551] [2024-11-09 10:12:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:37,802 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:12:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:37,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926726551] [2024-11-09 10:12:37,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926726551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:37,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:37,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:12:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819112583] [2024-11-09 10:12:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:12:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:37,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:12:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:12:37,804 INFO L87 Difference]: Start difference. First operand 1209 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:37,857 INFO L93 Difference]: Finished difference Result 1474 states and 1856 transitions. [2024-11-09 10:12:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:12:37,857 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:12:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:37,861 INFO L225 Difference]: With dead ends: 1474 [2024-11-09 10:12:37,861 INFO L226 Difference]: Without dead ends: 1474 [2024-11-09 10:12:37,862 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:12:37,862 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 201 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:37,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1559 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:12:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-09 10:12:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2024-11-09 10:12:37,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1217 states have (on average 1.513557929334429) internal successors, (1842), 1454 states have internal predecessors, (1842), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:37,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1852 transitions. [2024-11-09 10:12:37,881 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1852 transitions. Word has length 70 [2024-11-09 10:12:37,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:37,882 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1852 transitions. [2024-11-09 10:12:37,882 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:12:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1852 transitions. [2024-11-09 10:12:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 10:12:37,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:37,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:37,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 10:12:37,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:37,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 616886410, now seen corresponding path program 1 times [2024-11-09 10:12:37,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:37,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594053873] [2024-11-09 10:12:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:37,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:38,258 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:12:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594053873] [2024-11-09 10:12:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594053873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:38,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:38,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:12:38,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882640454] [2024-11-09 10:12:38,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:38,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:12:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:12:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:12:38,260 INFO L87 Difference]: Start difference. First operand 1461 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:38,402 INFO L93 Difference]: Finished difference Result 2081 states and 2585 transitions. [2024-11-09 10:12:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 10:12:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:38,417 INFO L225 Difference]: With dead ends: 2081 [2024-11-09 10:12:38,417 INFO L226 Difference]: Without dead ends: 2078 [2024-11-09 10:12:38,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:12:38,418 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 727 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:38,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3773 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:12:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-09 10:12:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1362. [2024-11-09 10:12:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1118 states have (on average 1.5330948121645795) internal successors, (1714), 1355 states have internal predecessors, (1714), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:38,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1724 transitions. [2024-11-09 10:12:38,442 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1724 transitions. Word has length 76 [2024-11-09 10:12:38,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:38,442 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1724 transitions. [2024-11-09 10:12:38,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1724 transitions. [2024-11-09 10:12:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:12:38,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:38,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:38,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 10:12:38,444 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:38,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:38,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414216, now seen corresponding path program 1 times [2024-11-09 10:12:38,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:38,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959257311] [2024-11-09 10:12:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:38,669 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:12:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:38,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959257311] [2024-11-09 10:12:38,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959257311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:38,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:38,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276825609] [2024-11-09 10:12:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:38,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:38,672 INFO L87 Difference]: Start difference. First operand 1362 states and 1724 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:39,217 INFO L93 Difference]: Finished difference Result 1361 states and 1722 transitions. [2024-11-09 10:12:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-09 10:12:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:39,220 INFO L225 Difference]: With dead ends: 1361 [2024-11-09 10:12:39,221 INFO L226 Difference]: Without dead ends: 1361 [2024-11-09 10:12:39,221 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:12:39,221 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 2 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:39,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2327 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:12:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-09 10:12:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2024-11-09 10:12:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1118 states have (on average 1.5313059033989267) internal successors, (1712), 1354 states have internal predecessors, (1712), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1722 transitions. [2024-11-09 10:12:39,247 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1722 transitions. Word has length 85 [2024-11-09 10:12:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:39,247 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1722 transitions. [2024-11-09 10:12:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1722 transitions. [2024-11-09 10:12:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 10:12:39,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:39,253 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 10:12:39,254 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414215, now seen corresponding path program 1 times [2024-11-09 10:12:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:39,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87439658] [2024-11-09 10:12:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:39,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:12:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87439658] [2024-11-09 10:12:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87439658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:12:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485621089] [2024-11-09 10:12:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:39,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:12:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:12:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:12:39,809 INFO L87 Difference]: Start difference. First operand 1361 states and 1722 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:40,458 INFO L93 Difference]: Finished difference Result 1360 states and 1720 transitions. [2024-11-09 10:12:40,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-09 10:12:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:40,462 INFO L225 Difference]: With dead ends: 1360 [2024-11-09 10:12:40,462 INFO L226 Difference]: Without dead ends: 1360 [2024-11-09 10:12:40,462 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:12:40,462 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:40,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2253 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:12:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-09 10:12:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2024-11-09 10:12:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1116 states have (on average 1.532258064516129) internal successors, (1710), 1353 states have internal predecessors, (1710), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1720 transitions. [2024-11-09 10:12:40,480 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1720 transitions. Word has length 85 [2024-11-09 10:12:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1720 transitions. [2024-11-09 10:12:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:12:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1720 transitions. [2024-11-09 10:12:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:12:40,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:40,481 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:12:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:12:40,482 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:40,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 286448127, now seen corresponding path program 1 times [2024-11-09 10:12:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403670658] [2024-11-09 10:12:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:40,737 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:12:40,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:40,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403670658] [2024-11-09 10:12:40,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403670658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:40,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:40,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:12:40,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541140336] [2024-11-09 10:12:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:40,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:12:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:40,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:12:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:12:40,742 INFO L87 Difference]: Start difference. First operand 1360 states and 1720 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:41,545 INFO L93 Difference]: Finished difference Result 1378 states and 1746 transitions. [2024-11-09 10:12:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:12:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-09 10:12:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:41,552 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 10:12:41,553 INFO L226 Difference]: Without dead ends: 1378 [2024-11-09 10:12:41,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:12:41,553 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 10 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:41,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3598 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 10:12:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-09 10:12:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1369. [2024-11-09 10:12:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5311387900355873) internal successors, (1721), 1360 states have internal predecessors, (1721), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 10:12:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1736 transitions. [2024-11-09 10:12:41,578 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1736 transitions. Word has length 93 [2024-11-09 10:12:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:41,578 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1736 transitions. [2024-11-09 10:12:41,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1736 transitions. [2024-11-09 10:12:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:12:41,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:41,583 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:12:41,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 10:12:41,584 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:41,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 286448128, now seen corresponding path program 1 times [2024-11-09 10:12:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:41,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683956242] [2024-11-09 10:12:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:42,130 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:12:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683956242] [2024-11-09 10:12:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683956242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:12:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252687719] [2024-11-09 10:12:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:12:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:12:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:12:42,133 INFO L87 Difference]: Start difference. First operand 1369 states and 1736 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:42,791 INFO L93 Difference]: Finished difference Result 1369 states and 1734 transitions. [2024-11-09 10:12:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:12:42,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-09 10:12:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:42,795 INFO L225 Difference]: With dead ends: 1369 [2024-11-09 10:12:42,795 INFO L226 Difference]: Without dead ends: 1369 [2024-11-09 10:12:42,795 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:12:42,796 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 5 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:42,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2924 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:12:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-09 10:12:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-09 10:12:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5293594306049823) internal successors, (1719), 1360 states have internal predecessors, (1719), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-09 10:12:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1734 transitions. [2024-11-09 10:12:42,812 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1734 transitions. Word has length 93 [2024-11-09 10:12:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1734 transitions. [2024-11-09 10:12:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1734 transitions. [2024-11-09 10:12:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:12:42,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:42,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:42,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:12:42,814 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 894772636, now seen corresponding path program 1 times [2024-11-09 10:12:42,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:42,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654962847] [2024-11-09 10:12:42,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:42,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:43,328 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:12:43,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654962847] [2024-11-09 10:12:43,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654962847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:43,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731199715] [2024-11-09 10:12:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:43,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:43,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:43,331 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:12:43,333 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:12:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:43,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:12:43,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:43,591 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:12:43,735 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:12:43,735 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:12:43,797 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:12:43,887 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:12:44,063 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:44,064 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:12:44,102 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:12:44,133 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:12:44,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:44,166 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_624) |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:12:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731199715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:44,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:12:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197518291] [2024-11-09 10:12:44,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:44,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:12:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:44,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:12:44,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-09 10:12:44,170 INFO L87 Difference]: Start difference. First operand 1369 states and 1734 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:12:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:46,207 INFO L93 Difference]: Finished difference Result 1376 states and 1740 transitions. [2024-11-09 10:12:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:12:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-09 10:12:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:46,211 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 10:12:46,212 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 10:12:46,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-09 10:12:46,213 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 709 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 5352 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:46,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 5352 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:12:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 10:12:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-09 10:12:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1128 states have (on average 1.5265957446808511) internal successors, (1722), 1363 states have internal predecessors, (1722), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:12:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1734 transitions. [2024-11-09 10:12:46,229 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1734 transitions. Word has length 94 [2024-11-09 10:12:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1734 transitions. [2024-11-09 10:12:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:12:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1734 transitions. [2024-11-09 10:12:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 10:12:46,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:46,231 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:46,259 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:12:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 10:12:46,432 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 894772637, now seen corresponding path program 1 times [2024-11-09 10:12:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861902629] [2024-11-09 10:12:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:47,162 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:12:47,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:47,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861902629] [2024-11-09 10:12:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861902629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:47,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151734574] [2024-11-09 10:12:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:47,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:47,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:47,165 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:12:47,168 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:12:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:47,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:12:47,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:47,393 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:12:47,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:12:47,498 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:12:47,506 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:12:47,532 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:12:47,536 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:12:47,621 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:12:47,625 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:12:47,725 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:47,725 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:12:47,731 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:12:47,771 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:12:47,777 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:12:47,794 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:12:47,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:47,887 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_775 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-09 10:12:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151734574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:47,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 10:12:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518233577] [2024-11-09 10:12:47,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:47,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:12:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:12:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 10:12:47,892 INFO L87 Difference]: Start difference. First operand 1373 states and 1734 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:12:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:49,838 INFO L93 Difference]: Finished difference Result 1375 states and 1738 transitions. [2024-11-09 10:12:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:12:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2024-11-09 10:12:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:49,842 INFO L225 Difference]: With dead ends: 1375 [2024-11-09 10:12:49,842 INFO L226 Difference]: Without dead ends: 1375 [2024-11-09 10:12:49,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 10:12:49,843 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 707 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:49,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4687 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:12:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-09 10:12:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1363. [2024-11-09 10:12:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1120 states have (on average 1.5276785714285714) internal successors, (1711), 1355 states have internal predecessors, (1711), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:12:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1721 transitions. [2024-11-09 10:12:49,859 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1721 transitions. Word has length 94 [2024-11-09 10:12:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:49,859 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1721 transitions. [2024-11-09 10:12:49,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:12:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1721 transitions. [2024-11-09 10:12:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:12:49,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:49,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:49,879 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:12:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-09 10:12:50,065 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -523230140, now seen corresponding path program 1 times [2024-11-09 10:12:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:50,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412110899] [2024-11-09 10:12:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:50,656 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:12:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412110899] [2024-11-09 10:12:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412110899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:50,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:12:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374642043] [2024-11-09 10:12:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:12:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:12:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:12:50,659 INFO L87 Difference]: Start difference. First operand 1363 states and 1721 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:52,096 INFO L93 Difference]: Finished difference Result 1382 states and 1746 transitions. [2024-11-09 10:12:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:12:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-09 10:12:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:52,101 INFO L225 Difference]: With dead ends: 1382 [2024-11-09 10:12:52,101 INFO L226 Difference]: Without dead ends: 1382 [2024-11-09 10:12:52,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-09 10:12:52,102 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 725 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:52,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4404 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:12:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-09 10:12:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2024-11-09 10:12:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5238095238095237) internal successors, (1728), 1368 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:12:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1740 transitions. [2024-11-09 10:12:52,120 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1740 transitions. Word has length 96 [2024-11-09 10:12:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1740 transitions. [2024-11-09 10:12:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1740 transitions. [2024-11-09 10:12:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 10:12:52,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:52,121 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:12:52,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 10:12:52,122 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:52,122 INFO L85 PathProgramCache]: Analyzing trace with hash -523230139, now seen corresponding path program 1 times [2024-11-09 10:12:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097915425] [2024-11-09 10:12:52,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:52,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:52,817 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:12:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097915425] [2024-11-09 10:12:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097915425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:12:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:12:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 10:12:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498314418] [2024-11-09 10:12:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:12:52,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 10:12:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 10:12:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 10:12:52,821 INFO L87 Difference]: Start difference. First operand 1378 states and 1740 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:54,081 INFO L93 Difference]: Finished difference Result 1381 states and 1744 transitions. [2024-11-09 10:12:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:12:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-09 10:12:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:54,084 INFO L225 Difference]: With dead ends: 1381 [2024-11-09 10:12:54,084 INFO L226 Difference]: Without dead ends: 1381 [2024-11-09 10:12:54,085 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:12:54,085 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 736 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:54,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2610 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:12:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-09 10:12:54,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-09 10:12:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5220458553791887) internal successors, (1726), 1368 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:12:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1738 transitions. [2024-11-09 10:12:54,100 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1738 transitions. Word has length 96 [2024-11-09 10:12:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1738 transitions. [2024-11-09 10:12:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:12:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1738 transitions. [2024-11-09 10:12:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:12:54,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:54,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 10:12:54,102 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1605195655, now seen corresponding path program 1 times [2024-11-09 10:12:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916721820] [2024-11-09 10:12:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:54,669 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:12:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916721820] [2024-11-09 10:12:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916721820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410596442] [2024-11-09 10:12:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:54,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:54,672 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:12:54,674 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:12:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:54,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:12:54,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:54,902 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:12:55,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:12:55,009 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:12:55,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:12:55,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:55,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 10:12:55,113 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:55,113 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:12:55,124 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:12:55,126 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:12:55,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:55,147 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 10:12:55,147 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:12:55,207 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-09 10:12:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410596442] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:55,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 17 [2024-11-09 10:12:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759791304] [2024-11-09 10:12:55,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:12:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:55,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:12:55,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=286, Unknown=8, NotChecked=34, Total=380 [2024-11-09 10:12:55,209 INFO L87 Difference]: Start difference. First operand 1378 states and 1738 transitions. Second operand has 18 states, 16 states have (on average 9.1875) internal successors, (147), 17 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:12:56,369 INFO L93 Difference]: Finished difference Result 1380 states and 1742 transitions. [2024-11-09 10:12:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:12:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 9.1875) internal successors, (147), 17 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2024-11-09 10:12:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:12:56,372 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 10:12:56,372 INFO L226 Difference]: Without dead ends: 1380 [2024-11-09 10:12:56,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=588, Unknown=8, NotChecked=50, Total=756 [2024-11-09 10:12:56,374 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 702 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2767 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:12:56,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 4404 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2767 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:12:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-09 10:12:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-09 10:12:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1134 states have (on average 1.5202821869488536) internal successors, (1724), 1367 states have internal predecessors, (1724), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:12:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1736 transitions. [2024-11-09 10:12:56,395 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1736 transitions. Word has length 97 [2024-11-09 10:12:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:12:56,396 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1736 transitions. [2024-11-09 10:12:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 9.1875) internal successors, (147), 17 states have internal predecessors, (147), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:12:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1736 transitions. [2024-11-09 10:12:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 10:12:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:12:56,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:12:56,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 10:12:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:56,599 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:12:56,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:12:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1605195656, now seen corresponding path program 1 times [2024-11-09 10:12:56,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:12:56,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433643613] [2024-11-09 10:12:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:56,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:12:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:12:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:57,470 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:12:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:12:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433643613] [2024-11-09 10:12:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433643613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701342420] [2024-11-09 10:12:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:12:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:12:57,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:12:57,473 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:12:57,479 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:12:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:12:57,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 10:12:57,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:12:57,714 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:12:57,803 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:12:57,812 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:12:57,812 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:12:57,823 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:12:57,828 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:12:57,885 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:12:57,893 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:12:57,988 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:57,989 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:12:57,994 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:12:58,057 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:12:58,057 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:12:58,064 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:12:58,079 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:12:58,083 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:12:58,086 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:12:58,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:12:58,139 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1222) |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~mem56#1.base| v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1222 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:12:58,149 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_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-09 10:12:58,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1229) .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1223) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1229) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 10:12:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701342420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:12:58,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:12:58,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-09 10:12:58,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940297704] [2024-11-09 10:12:58,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:12:58,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:12:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:12:58,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:12:58,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=320, Unknown=3, NotChecked=114, Total=506 [2024-11-09 10:12:58,198 INFO L87 Difference]: Start difference. First operand 1377 states and 1736 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:00,129 INFO L93 Difference]: Finished difference Result 1379 states and 1740 transitions. [2024-11-09 10:13:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:13:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-09 10:13:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:00,133 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 10:13:00,133 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 10:13:00,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=546, Unknown=3, NotChecked=150, Total=812 [2024-11-09 10:13:00,135 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 707 mSDsluCounter, 3720 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 3735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:00,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4222 Invalid, 3735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:13:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 10:13:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1361. [2024-11-09 10:13:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1120 states have (on average 1.5241071428571429) internal successors, (1707), 1353 states have internal predecessors, (1707), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1717 transitions. [2024-11-09 10:13:00,153 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1717 transitions. Word has length 97 [2024-11-09 10:13:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:00,153 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1717 transitions. [2024-11-09 10:13:00,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1717 transitions. [2024-11-09 10:13:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:13:00,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:00,155 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:13:00,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 10:13:00,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 10:13:00,359 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:00,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:00,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1112141050, now seen corresponding path program 1 times [2024-11-09 10:13:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029585386] [2024-11-09 10:13:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:00,938 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:13:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029585386] [2024-11-09 10:13:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029585386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 10:13:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301634772] [2024-11-09 10:13:00,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:00,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 10:13:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 10:13:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:13:00,940 INFO L87 Difference]: Start difference. First operand 1361 states and 1717 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:02,123 INFO L93 Difference]: Finished difference Result 1386 states and 1748 transitions. [2024-11-09 10:13:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 10:13:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-09 10:13:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:02,125 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 10:13:02,126 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 10:13:02,126 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:13:02,126 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 744 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:02,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 4398 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 10:13:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 10:13:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1382. [2024-11-09 10:13:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5175438596491229) internal successors, (1730), 1372 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1742 transitions. [2024-11-09 10:13:02,143 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1742 transitions. Word has length 99 [2024-11-09 10:13:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:02,144 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1742 transitions. [2024-11-09 10:13:02,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1742 transitions. [2024-11-09 10:13:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:13:02,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:02,145 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:13:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 10:13:02,146 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1112141049, now seen corresponding path program 1 times [2024-11-09 10:13:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578814250] [2024-11-09 10:13:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:02,883 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:13:02,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578814250] [2024-11-09 10:13:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578814250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:02,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 10:13:02,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451397528] [2024-11-09 10:13:02,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:02,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:13:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:13:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:13:02,885 INFO L87 Difference]: Start difference. First operand 1382 states and 1742 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:04,010 INFO L93 Difference]: Finished difference Result 1385 states and 1746 transitions. [2024-11-09 10:13:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:13:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-09 10:13:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:04,012 INFO L225 Difference]: With dead ends: 1385 [2024-11-09 10:13:04,012 INFO L226 Difference]: Without dead ends: 1385 [2024-11-09 10:13:04,013 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:13:04,014 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 737 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:04,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 3069 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 10:13:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-09 10:13:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2024-11-09 10:13:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5157894736842106) internal successors, (1728), 1372 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1740 transitions. [2024-11-09 10:13:04,037 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1740 transitions. Word has length 99 [2024-11-09 10:13:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:04,038 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1740 transitions. [2024-11-09 10:13:04,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1740 transitions. [2024-11-09 10:13:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:13:04,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:04,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:04,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 10:13:04,040 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:04,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 218526947, now seen corresponding path program 1 times [2024-11-09 10:13:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387945717] [2024-11-09 10:13:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:04,648 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:13:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387945717] [2024-11-09 10:13:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387945717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504044943] [2024-11-09 10:13:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:04,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:13:04,652 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:13:04,653 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:13:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:04,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 10:13:04,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:04,901 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:13:05,008 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:13:05,009 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:13:05,039 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:13:05,115 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:13:05,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:05,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:13:05,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:05,325 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:13:05,378 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:05,378 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:13:05,390 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:13:05,417 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:13:05,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:05,425 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1541 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1541) |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:13:05,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1541 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1540))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1541)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:09,616 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1544))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1541)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504044943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:09,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 10:13:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133627444] [2024-11-09 10:13:09,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 10:13:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:09,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 10:13:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=536, Unknown=23, NotChecked=150, Total=812 [2024-11-09 10:13:09,621 INFO L87 Difference]: Start difference. First operand 1382 states and 1740 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:11,611 INFO L93 Difference]: Finished difference Result 1384 states and 1744 transitions. [2024-11-09 10:13:11,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:13:11,611 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-09 10:13:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:11,613 INFO L225 Difference]: With dead ends: 1384 [2024-11-09 10:13:11,613 INFO L226 Difference]: Without dead ends: 1384 [2024-11-09 10:13:11,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=132, Invalid=727, Unknown=23, NotChecked=174, Total=1056 [2024-11-09 10:13:11,614 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 695 mSDsluCounter, 5358 mSDsCounter, 0 mSdLazyCounter, 3716 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 5856 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:11,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 5856 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3716 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:13:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-09 10:13:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-09 10:13:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1140 states have (on average 1.5140350877192983) internal successors, (1726), 1371 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1738 transitions. [2024-11-09 10:13:11,631 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1738 transitions. Word has length 100 [2024-11-09 10:13:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:11,631 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1738 transitions. [2024-11-09 10:13:11,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1738 transitions. [2024-11-09 10:13:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 10:13:11,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:11,633 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:13:11,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:13:11,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 10:13:11,834 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:11,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:11,834 INFO L85 PathProgramCache]: Analyzing trace with hash 218526948, now seen corresponding path program 1 times [2024-11-09 10:13:11,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:11,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240517596] [2024-11-09 10:13:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:12,744 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:13:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240517596] [2024-11-09 10:13:12,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240517596] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:12,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112050023] [2024-11-09 10:13:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:12,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:13:12,747 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:13:12,749 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:13:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:12,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 10:13:12,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:12,986 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:13:13,075 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:13:13,084 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:13:13,085 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:13:13,125 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:13:13,131 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:13:13,204 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:13:13,208 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:13:13,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:13,294 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:13:13,299 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:13:13,369 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-09 10:13:13,370 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 67 treesize of output 39 [2024-11-09 10:13:13,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 10:13:13,482 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-09 10:13:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-11-09 10:13:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 10:13:13,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:13:13,531 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:13:13,537 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 30 treesize of output 12 [2024-11-09 10:13:13,570 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:13:13,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:13,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse4))) (and (forall ((v_ArrVal_1714 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1714))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((|ULTIMATE.start_main_#t~mem56#1.offset| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1717 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (+ |ULTIMATE.start_main_#t~mem56#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_1714 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_1714))) (or (< (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((|ULTIMATE.start_main_#t~mem56#1.offset| Int) (v_ArrVal_1717 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse5 (+ |ULTIMATE.start_main_#t~mem56#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))))) is different from false [2024-11-09 10:13:14,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1723))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1724) .cse2 v_ArrVal_1714))) (or (forall ((|ULTIMATE.start_main_#t~mem56#1.offset| Int) (v_ArrVal_1717 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |ULTIMATE.start_main_#t~mem56#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 8))) (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) 0)))))) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1723))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1724) .cse8 v_ArrVal_1714))) (or (< (+ 4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) 0) (forall ((|ULTIMATE.start_main_#t~mem56#1.offset| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1717 (Array Int Int))) (let ((.cse6 (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |ULTIMATE.start_main_#t~mem56#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store .cse4 .cse5 v_ArrVal_1717) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))))) is different from false [2024-11-09 10:13:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112050023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:14,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-09 10:13:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486454508] [2024-11-09 10:13:14,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:14,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 10:13:14,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:14,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 10:13:14,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=758, Unknown=9, NotChecked=114, Total=992 [2024-11-09 10:13:14,047 INFO L87 Difference]: Start difference. First operand 1381 states and 1738 transitions. Second operand has 25 states, 22 states have (on average 7.2727272727272725) internal successors, (160), 24 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:17,616 INFO L93 Difference]: Finished difference Result 1383 states and 1742 transitions. [2024-11-09 10:13:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:13:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.2727272727272725) internal successors, (160), 24 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2024-11-09 10:13:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:17,620 INFO L225 Difference]: With dead ends: 1383 [2024-11-09 10:13:17,620 INFO L226 Difference]: Without dead ends: 1383 [2024-11-09 10:13:17,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=1209, Unknown=9, NotChecked=146, Total=1560 [2024-11-09 10:13:17,621 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 703 mSDsluCounter, 5569 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:17,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 6070 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5757 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 10:13:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-09 10:13:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1359. [2024-11-09 10:13:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1120 states have (on average 1.5205357142857143) internal successors, (1703), 1351 states have internal predecessors, (1703), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1713 transitions. [2024-11-09 10:13:17,638 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1713 transitions. Word has length 100 [2024-11-09 10:13:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:17,639 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1713 transitions. [2024-11-09 10:13:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.2727272727272725) internal successors, (160), 24 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1713 transitions. [2024-11-09 10:13:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:13:17,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:17,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:17,662 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:13:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:17,842 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:17,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash -415649749, now seen corresponding path program 1 times [2024-11-09 10:13:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:17,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940625294] [2024-11-09 10:13:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:17,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:18,537 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:13:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940625294] [2024-11-09 10:13:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940625294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 10:13:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773528026] [2024-11-09 10:13:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:13:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:13:18,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:13:18,539 INFO L87 Difference]: Start difference. First operand 1359 states and 1713 transitions. Second operand has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:20,008 INFO L93 Difference]: Finished difference Result 1390 states and 1750 transitions. [2024-11-09 10:13:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:13:20,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-09 10:13:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:20,011 INFO L225 Difference]: With dead ends: 1390 [2024-11-09 10:13:20,011 INFO L226 Difference]: Without dead ends: 1390 [2024-11-09 10:13:20,012 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:13:20,013 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 745 mSDsluCounter, 3901 mSDsCounter, 0 mSdLazyCounter, 2779 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:20,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 4399 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2779 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:13:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-09 10:13:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1386. [2024-11-09 10:13:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5113438045375218) internal successors, (1732), 1376 states have internal predecessors, (1732), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1744 transitions. [2024-11-09 10:13:20,029 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1744 transitions. Word has length 102 [2024-11-09 10:13:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:20,029 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1744 transitions. [2024-11-09 10:13:20,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.142857142857143) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1744 transitions. [2024-11-09 10:13:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 10:13:20,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:20,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:20,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 10:13:20,034 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -415649748, now seen corresponding path program 1 times [2024-11-09 10:13:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021031004] [2024-11-09 10:13:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:20,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:13:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021031004] [2024-11-09 10:13:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021031004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:20,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:20,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 10:13:20,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082075715] [2024-11-09 10:13:20,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:20,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:13:20,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:13:20,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:13:20,881 INFO L87 Difference]: Start difference. First operand 1386 states and 1744 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:23,082 INFO L93 Difference]: Finished difference Result 1389 states and 1748 transitions. [2024-11-09 10:13:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:13:23,083 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2024-11-09 10:13:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:23,085 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 10:13:23,085 INFO L226 Difference]: Without dead ends: 1389 [2024-11-09 10:13:23,085 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:13:23,086 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 737 mSDsluCounter, 3728 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 3726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:23,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 4230 Invalid, 3726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 10:13:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-09 10:13:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2024-11-09 10:13:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5095986038394416) internal successors, (1730), 1376 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1742 transitions. [2024-11-09 10:13:23,104 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1742 transitions. Word has length 102 [2024-11-09 10:13:23,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:23,104 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1742 transitions. [2024-11-09 10:13:23,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2024-11-09 10:13:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:13:23,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:23,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:23,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 10:13:23,106 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:23,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:23,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1033493202, now seen corresponding path program 1 times [2024-11-09 10:13:23,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:23,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443686691] [2024-11-09 10:13:23,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:23,784 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:13:23,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443686691] [2024-11-09 10:13:23,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443686691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085855040] [2024-11-09 10:13:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:13:23,786 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:13:23,787 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:13:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:24,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 10:13:24,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:24,037 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:13:24,169 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 10:13:24,170 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:13:24,206 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:13:24,282 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:13:24,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:24,403 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:13:24,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:24,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 10:13:24,533 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:24,534 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:13:24,593 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:24,593 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:13:24,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 10:13:24,641 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:13:24,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:24,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2061) |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:13:24,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (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_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 10:13:24,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (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~mem57#1.base| v_ArrVal_2060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:24,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:24,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2059 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2059))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2060)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:24,686 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2059 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2059))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2060)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 10:13:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085855040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:24,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-09 10:13:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643315659] [2024-11-09 10:13:24,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:24,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:13:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:24,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:13:24,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=598, Unknown=19, NotChecked=330, Total=1056 [2024-11-09 10:13:24,783 INFO L87 Difference]: Start difference. First operand 1386 states and 1742 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:26,858 INFO L93 Difference]: Finished difference Result 1388 states and 1746 transitions. [2024-11-09 10:13:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:13:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-09 10:13:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:26,860 INFO L225 Difference]: With dead ends: 1388 [2024-11-09 10:13:26,861 INFO L226 Difference]: Without dead ends: 1388 [2024-11-09 10:13:26,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=799, Unknown=19, NotChecked=378, Total=1332 [2024-11-09 10:13:26,861 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 694 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 3426 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:26,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 5373 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3426 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:13:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-09 10:13:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1385. [2024-11-09 10:13:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1146 states have (on average 1.5078534031413613) internal successors, (1728), 1375 states have internal predecessors, (1728), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1740 transitions. [2024-11-09 10:13:26,877 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1740 transitions. Word has length 103 [2024-11-09 10:13:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:26,878 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1740 transitions. [2024-11-09 10:13:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1740 transitions. [2024-11-09 10:13:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 10:13:26,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:26,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:26,899 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:13:27,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:27,080 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1033493201, now seen corresponding path program 1 times [2024-11-09 10:13:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32409008] [2024-11-09 10:13:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:27,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:28,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:13:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32409008] [2024-11-09 10:13:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32409008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467327426] [2024-11-09 10:13:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:28,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:13:28,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:13:28,043 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:13:28,044 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:13:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:28,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 10:13:28,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:13:28,305 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:13:28,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:13:28,394 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:13:28,400 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:13:28,424 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:13:28,431 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:13:28,502 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:13:28,509 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:13:28,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:28,606 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:13:28,611 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:13:28,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:28,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 10:13:28,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:13:28,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:28,770 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:13:28,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:13:28,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:13:28,868 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:13:28,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2024-11-09 10:13:28,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-09 10:13:28,908 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:13:28,939 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:13:28,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:13:29,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2251 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2251) |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~mem58#1.base| v_ArrVal_2250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 10:13:29,092 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2249))) (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~mem57#1.base| v_ArrVal_2248) .cse0 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2251 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2248) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-09 10:13:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467327426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:13:29,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:13:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-09 10:13:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919942830] [2024-11-09 10:13:29,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:13:29,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 10:13:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 10:13:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=897, Unknown=27, NotChecked=126, Total=1190 [2024-11-09 10:13:29,638 INFO L87 Difference]: Start difference. First operand 1385 states and 1740 transitions. Second operand has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:32,904 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-11-09 10:13:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:13:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2024-11-09 10:13:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:32,907 INFO L225 Difference]: With dead ends: 1387 [2024-11-09 10:13:32,907 INFO L226 Difference]: Without dead ends: 1387 [2024-11-09 10:13:32,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=1385, Unknown=27, NotChecked=158, Total=1806 [2024-11-09 10:13:32,908 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 702 mSDsluCounter, 5358 mSDsCounter, 0 mSdLazyCounter, 5259 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 5858 SdHoareTripleChecker+Invalid, 5275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 5259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:32,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 5858 Invalid, 5275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 5259 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 10:13:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-09 10:13:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1357. [2024-11-09 10:13:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1120 states have (on average 1.5169642857142858) internal successors, (1699), 1349 states have internal predecessors, (1699), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 10:13:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1709 transitions. [2024-11-09 10:13:32,917 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1709 transitions. Word has length 103 [2024-11-09 10:13:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:32,918 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1709 transitions. [2024-11-09 10:13:32,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.217391304347826) internal successors, (166), 25 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:13:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1709 transitions. [2024-11-09 10:13:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:13:32,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:32,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:32,938 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:13:33,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-09 10:13:33,119 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:33,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1450583085, now seen corresponding path program 1 times [2024-11-09 10:13:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687592682] [2024-11-09 10:13:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:33,811 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:13:33,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:33,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687592682] [2024-11-09 10:13:33,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687592682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:33,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:33,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 10:13:33,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922503182] [2024-11-09 10:13:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:33,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 10:13:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 10:13:33,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 10:13:33,814 INFO L87 Difference]: Start difference. First operand 1357 states and 1709 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:13:35,305 INFO L93 Difference]: Finished difference Result 1396 states and 1754 transitions. [2024-11-09 10:13:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 10:13:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2024-11-09 10:13:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:13:35,308 INFO L225 Difference]: With dead ends: 1396 [2024-11-09 10:13:35,308 INFO L226 Difference]: Without dead ends: 1396 [2024-11-09 10:13:35,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:13:35,309 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 747 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:13:35,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 4371 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 10:13:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-09 10:13:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1392. [2024-11-09 10:13:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1154 states have (on average 1.5043327556325823) internal successors, (1736), 1382 states have internal predecessors, (1736), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 10:13:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1748 transitions. [2024-11-09 10:13:35,324 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1748 transitions. Word has length 106 [2024-11-09 10:13:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:13:35,324 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1748 transitions. [2024-11-09 10:13:35,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 10:13:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1748 transitions. [2024-11-09 10:13:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 10:13:35,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:13:35,325 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:13:35,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 10:13:35,325 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 10:13:35,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:13:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1450583086, now seen corresponding path program 1 times [2024-11-09 10:13:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:13:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348837548] [2024-11-09 10:13:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:13:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:13:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 10:13:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:13:36,516 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:13:36,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:13:36,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348837548] [2024-11-09 10:13:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348837548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:13:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:13:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 10:13:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713773076] [2024-11-09 10:13:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:13:36,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:13:36,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:13:36,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:13:36,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:13:36,517 INFO L87 Difference]: Start difference. First operand 1392 states and 1748 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)