./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-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 df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:24:48,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:24:48,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:24:48,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:24:48,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:24:48,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:24:48,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:24:48,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:24:48,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:24:48,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:24:48,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:24:48,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:24:48,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:24:48,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:24:48,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:24:48,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:24:48,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:24:48,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:24:48,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:24:48,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:24:48,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:24:48,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:24:48,456 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:24:48,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:24:48,456 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:24:48,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:24:48,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:24:48,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:24:48,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:24:48,457 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:24:48,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:24:48,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:24:48,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:48,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:24:48,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:24:48,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:24:48,460 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 -> df25530cebe2f8dbf5c0f407e5ccf4cecba61e3d44431cb17b70a57441db534c [2024-11-10 17:24:48,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:24:48,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:24:48,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:24:48,684 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:24:48,685 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:24:48,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2024-11-10 17:24:49,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:24:50,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:24:50,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test5-1.i [2024-11-10 17:24:50,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d9c1a33/0faeb4e00fac48818d75050663587d2b/FLAG32a124af4 [2024-11-10 17:24:50,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d9c1a33/0faeb4e00fac48818d75050663587d2b [2024-11-10 17:24:50,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:24:50,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:24:50,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:50,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:24:50,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:24:50,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785e00bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:50, skipping insertion in model container [2024-11-10 17:24:50,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:50" (1/1) ... [2024-11-10 17:24:50,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:24:50,992 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,022 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,026 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,032 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,039 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,059 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,060 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,062 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,065 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,087 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,087 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:24:51,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:51,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:24:51,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:24:51,265 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:24:51,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51 WrapperNode [2024-11-10 17:24:51,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:24:51,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:51,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:24:51,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:24:51,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,364 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-10 17:24:51,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:24:51,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:24:51,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:24:51,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:24:51,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,499 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-11-10 17:24:51,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:24:51,571 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:24:51,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:24:51,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:24:51,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (1/1) ... [2024-11-10 17:24:51,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:24:51,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:24:51,610 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-10 17:24:51,620 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-10 17:24:51,664 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:24:51,665 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:24:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:24:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:24:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 17:24:51,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:24:51,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:24:51,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:24:51,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:24:51,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 17:24:51,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:51,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:51,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:24:51,668 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:24:51,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:24:51,669 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:24:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 17:24:51,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:24:51,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:24:51,861 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:24:51,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:24:53,923 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2024-11-10 17:24:54,114 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-10 17:24:54,114 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:24:54,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:24:54,191 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:24:54,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:54 BoogieIcfgContainer [2024-11-10 17:24:54,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:24:54,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:24:54,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:24:54,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:24:54,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:24:50" (1/3) ... [2024-11-10 17:24:54,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca0847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:54, skipping insertion in model container [2024-11-10 17:24:54,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:51" (2/3) ... [2024-11-10 17:24:54,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca0847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:54, skipping insertion in model container [2024-11-10 17:24:54,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:24:54" (3/3) ... [2024-11-10 17:24:54,200 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test5-1.i [2024-11-10 17:24:54,215 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:24:54,216 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-10 17:24:54,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:24:54,289 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;@2388fdda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:24:54,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-10 17:24:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 1768 states, 1045 states have (on average 2.0047846889952154) internal successors, (2095), 1758 states have internal predecessors, (2095), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 17:24:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:24:54,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:54,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:24:54,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329309, now seen corresponding path program 1 times [2024-11-10 17:24:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818722868] [2024-11-10 17:24:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:54,449 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-10 17:24:54,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:54,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818722868] [2024-11-10 17:24:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818722868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:54,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:54,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:24:54,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821158625] [2024-11-10 17:24:54,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:24:54,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:24:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:24:54,488 INFO L87 Difference]: Start difference. First operand has 1768 states, 1045 states have (on average 2.0047846889952154) internal successors, (2095), 1758 states have internal predecessors, (2095), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:54,642 INFO L93 Difference]: Finished difference Result 1746 states and 2006 transitions. [2024-11-10 17:24:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:24:54,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:24:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:54,665 INFO L225 Difference]: With dead ends: 1746 [2024-11-10 17:24:54,666 INFO L226 Difference]: Without dead ends: 1743 [2024-11-10 17:24:54,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:24:54,669 INFO L432 NwaCegarLoop]: 1943 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:54,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1943 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:24:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-10 17:24:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2024-11-10 17:24:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1032 states have (on average 1.9176356589147288) internal successors, (1979), 1733 states have internal predecessors, (1979), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2003 transitions. [2024-11-10 17:24:54,759 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2003 transitions. Word has length 6 [2024-11-10 17:24:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:54,759 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2003 transitions. [2024-11-10 17:24:54,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2003 transitions. [2024-11-10 17:24:54,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:24:54,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:54,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:24:54,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:24:54,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr709REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329340, now seen corresponding path program 1 times [2024-11-10 17:24:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:54,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909534298] [2024-11-10 17:24:54,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:54,884 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-10 17:24:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909534298] [2024-11-10 17:24:54,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909534298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:24:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381925284] [2024-11-10 17:24:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:54,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:54,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:54,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:54,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:54,887 INFO L87 Difference]: Start difference. First operand 1743 states and 2003 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:55,911 INFO L93 Difference]: Finished difference Result 1980 states and 2328 transitions. [2024-11-10 17:24:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:24:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:24:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:55,918 INFO L225 Difference]: With dead ends: 1980 [2024-11-10 17:24:55,918 INFO L226 Difference]: Without dead ends: 1980 [2024-11-10 17:24:55,918 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-10 17:24:55,919 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 1763 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:55,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 1859 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:24:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-10 17:24:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1651. [2024-11-10 17:24:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1032 states have (on average 1.8284883720930232) internal successors, (1887), 1641 states have internal predecessors, (1887), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1911 transitions. [2024-11-10 17:24:55,953 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 1911 transitions. Word has length 6 [2024-11-10 17:24:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:55,953 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 1911 transitions. [2024-11-10 17:24:55,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:55,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1911 transitions. [2024-11-10 17:24:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:24:55,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:55,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:24:55,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:24:55,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr710REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329341, now seen corresponding path program 1 times [2024-11-10 17:24:55,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:55,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204486742] [2024-11-10 17:24:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:56,044 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-10 17:24:56,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:56,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204486742] [2024-11-10 17:24:56,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204486742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:56,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:56,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:24:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396903832] [2024-11-10 17:24:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:56,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:56,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:56,047 INFO L87 Difference]: Start difference. First operand 1651 states and 1911 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:57,102 INFO L93 Difference]: Finished difference Result 2404 states and 2828 transitions. [2024-11-10 17:24:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:24:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 17:24:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:57,111 INFO L225 Difference]: With dead ends: 2404 [2024-11-10 17:24:57,111 INFO L226 Difference]: Without dead ends: 2404 [2024-11-10 17:24:57,111 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-10 17:24:57,112 INFO L432 NwaCegarLoop]: 1909 mSDtfsCounter, 1236 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:57,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2823 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:24:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-10 17:24:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1921. [2024-11-10 17:24:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1312 states have (on average 1.8048780487804879) internal successors, (2368), 1911 states have internal predecessors, (2368), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2392 transitions. [2024-11-10 17:24:57,176 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2392 transitions. Word has length 6 [2024-11-10 17:24:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:57,177 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2392 transitions. [2024-11-10 17:24:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2392 transitions. [2024-11-10 17:24:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:24:57,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:57,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:24:57,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:24:57,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:57,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1020955448, now seen corresponding path program 1 times [2024-11-10 17:24:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:57,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151890695] [2024-11-10 17:24:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:57,221 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-10 17:24:57,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151890695] [2024-11-10 17:24:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151890695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:24:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150283604] [2024-11-10 17:24:57,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:57,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:57,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:57,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:57,224 INFO L87 Difference]: Start difference. First operand 1921 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:57,427 INFO L93 Difference]: Finished difference Result 3822 states and 4764 transitions. [2024-11-10 17:24:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:24:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-10 17:24:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:57,439 INFO L225 Difference]: With dead ends: 3822 [2024-11-10 17:24:57,440 INFO L226 Difference]: Without dead ends: 3822 [2024-11-10 17:24:57,440 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-10 17:24:57,441 INFO L432 NwaCegarLoop]: 2067 mSDtfsCounter, 1855 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 3894 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:57,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 3894 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:24:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2024-11-10 17:24:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 1925. [2024-11-10 17:24:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1316 states have (on average 1.8024316109422491) internal successors, (2372), 1915 states have internal predecessors, (2372), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2396 transitions. [2024-11-10 17:24:57,492 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2396 transitions. Word has length 8 [2024-11-10 17:24:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:57,493 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2396 transitions. [2024-11-10 17:24:57,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2396 transitions. [2024-11-10 17:24:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:24:57,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:57,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:24:57,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:24:57,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr705REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:57,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782018, now seen corresponding path program 1 times [2024-11-10 17:24:57,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057751350] [2024-11-10 17:24:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:57,574 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-10 17:24:57,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057751350] [2024-11-10 17:24:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057751350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:57,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:24:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255082882] [2024-11-10 17:24:57,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:24:57,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:57,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:24:57,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:24:57,578 INFO L87 Difference]: Start difference. First operand 1925 states and 2396 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:58,593 INFO L93 Difference]: Finished difference Result 1951 states and 2449 transitions. [2024-11-10 17:24:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:24:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 17:24:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:58,598 INFO L225 Difference]: With dead ends: 1951 [2024-11-10 17:24:58,598 INFO L226 Difference]: Without dead ends: 1951 [2024-11-10 17:24:58,599 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-10 17:24:58,599 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 2031 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:58,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 2112 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:24:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-11-10 17:24:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1902. [2024-11-10 17:24:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1316 states have (on average 1.784954407294833) internal successors, (2349), 1892 states have internal predecessors, (2349), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2373 transitions. [2024-11-10 17:24:58,626 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2373 transitions. Word has length 13 [2024-11-10 17:24:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:58,626 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2373 transitions. [2024-11-10 17:24:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2373 transitions. [2024-11-10 17:24:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:24:58,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:58,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:24:58,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:24:58,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr706REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:58,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782017, now seen corresponding path program 1 times [2024-11-10 17:24:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069966871] [2024-11-10 17:24:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:58,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:58,672 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-10 17:24:58,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069966871] [2024-11-10 17:24:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069966871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:24:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198190171] [2024-11-10 17:24:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:58,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:24:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:58,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:24:58,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:24:58,676 INFO L87 Difference]: Start difference. First operand 1902 states and 2373 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:58,772 INFO L93 Difference]: Finished difference Result 1827 states and 2270 transitions. [2024-11-10 17:24:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:24:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 17:24:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:58,778 INFO L225 Difference]: With dead ends: 1827 [2024-11-10 17:24:58,778 INFO L226 Difference]: Without dead ends: 1827 [2024-11-10 17:24:58,779 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-10 17:24:58,780 INFO L432 NwaCegarLoop]: 1709 mSDtfsCounter, 61 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:58,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3364 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:24:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-10 17:24:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2024-11-10 17:24:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1253 states have (on average 1.7924980047885075) internal successors, (2246), 1817 states have internal predecessors, (2246), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2270 transitions. [2024-11-10 17:24:58,812 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2270 transitions. Word has length 13 [2024-11-10 17:24:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:58,813 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2270 transitions. [2024-11-10 17:24:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2270 transitions. [2024-11-10 17:24:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:24:58,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:58,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:24:58,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:24:58,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1826839390, now seen corresponding path program 1 times [2024-11-10 17:24:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714140232] [2024-11-10 17:24:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:58,863 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-10 17:24:58,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:58,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714140232] [2024-11-10 17:24:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714140232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:58,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:24:58,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140596883] [2024-11-10 17:24:58,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:58,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:24:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:24:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:24:58,865 INFO L87 Difference]: Start difference. First operand 1827 states and 2270 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:24:59,012 INFO L93 Difference]: Finished difference Result 1812 states and 2248 transitions. [2024-11-10 17:24:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:24:59,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:24:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:24:59,018 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:24:59,018 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:24:59,018 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-10 17:24:59,019 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 45 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4989 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:24:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4989 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:24:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:24:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2024-11-10 17:24:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1245 states have (on average 1.7863453815261043) internal successors, (2224), 1802 states have internal predecessors, (2224), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:24:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2248 transitions. [2024-11-10 17:24:59,048 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2248 transitions. Word has length 15 [2024-11-10 17:24:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:24:59,048 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2248 transitions. [2024-11-10 17:24:59,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:24:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2248 transitions. [2024-11-10 17:24:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:24:59,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:24:59,050 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] [2024-11-10 17:24:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:24:59,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr668REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:24:59,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:24:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2106893528, now seen corresponding path program 1 times [2024-11-10 17:24:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:24:59,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933535108] [2024-11-10 17:24:59,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:24:59,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:24:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:24:59,211 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-10 17:24:59,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:24:59,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933535108] [2024-11-10 17:24:59,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933535108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:24:59,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:24:59,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:24:59,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674178166] [2024-11-10 17:24:59,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:24:59,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:24:59,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:24:59,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:24:59,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:24:59,215 INFO L87 Difference]: Start difference. First operand 1812 states and 2248 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-10 17:25:00,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:00,451 INFO L93 Difference]: Finished difference Result 2342 states and 2758 transitions. [2024-11-10 17:25:00,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:25:00,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-10 17:25:00,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:00,457 INFO L225 Difference]: With dead ends: 2342 [2024-11-10 17:25:00,458 INFO L226 Difference]: Without dead ends: 2342 [2024-11-10 17:25:00,458 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-10 17:25:00,459 INFO L432 NwaCegarLoop]: 1405 mSDtfsCounter, 1241 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:00,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3311 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:25:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-11-10 17:25:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1808. [2024-11-10 17:25:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1245 states have (on average 1.783132530120482) internal successors, (2220), 1798 states have internal predecessors, (2220), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2244 transitions. [2024-11-10 17:25:00,481 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2244 transitions. Word has length 29 [2024-11-10 17:25:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:00,483 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2244 transitions. [2024-11-10 17:25:00,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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-10 17:25:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2244 transitions. [2024-11-10 17:25:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:25:00,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:00,485 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] [2024-11-10 17:25:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:25:00,486 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:00,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:00,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1736803853, now seen corresponding path program 1 times [2024-11-10 17:25:00,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:00,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505621503] [2024-11-10 17:25:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:00,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:00,574 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-10 17:25:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505621503] [2024-11-10 17:25:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505621503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151928813] [2024-11-10 17:25:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:25:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:25:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:25:00,576 INFO L87 Difference]: Start difference. First operand 1808 states and 2244 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-10 17:25:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:00,686 INFO L93 Difference]: Finished difference Result 1802 states and 2234 transitions. [2024-11-10 17:25:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:00,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-10 17:25:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:00,690 INFO L225 Difference]: With dead ends: 1802 [2024-11-10 17:25:00,691 INFO L226 Difference]: Without dead ends: 1802 [2024-11-10 17:25:00,691 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-10 17:25:00,693 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 21 mSDsluCounter, 3306 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4975 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:00,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4975 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-10 17:25:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-10 17:25:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1239 states have (on average 1.7836965294592413) internal successors, (2210), 1792 states have internal predecessors, (2210), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2234 transitions. [2024-11-10 17:25:00,716 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2234 transitions. Word has length 64 [2024-11-10 17:25:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:00,718 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2234 transitions. [2024-11-10 17:25:00,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-10 17:25:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2234 transitions. [2024-11-10 17:25:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 17:25:00,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:00,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:25:00,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr653REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -475789525, now seen corresponding path program 1 times [2024-11-10 17:25:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046757433] [2024-11-10 17:25:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:00,827 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-10 17:25:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:00,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046757433] [2024-11-10 17:25:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046757433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:00,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:00,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:25:00,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102397991] [2024-11-10 17:25:00,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:25:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:00,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:25:00,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:25:00,829 INFO L87 Difference]: Start difference. First operand 1802 states and 2234 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:00,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:00,923 INFO L93 Difference]: Finished difference Result 1896 states and 2355 transitions. [2024-11-10 17:25:00,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:25:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-10 17:25:00,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:00,928 INFO L225 Difference]: With dead ends: 1896 [2024-11-10 17:25:00,928 INFO L226 Difference]: Without dead ends: 1896 [2024-11-10 17:25:00,928 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-10 17:25:00,929 INFO L432 NwaCegarLoop]: 1684 mSDtfsCounter, 54 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3341 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:00,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3341 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:25:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-10 17:25:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2024-11-10 17:25:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1896 states, 1333 states have (on average 1.7486871717929482) internal successors, (2331), 1886 states have internal predecessors, (2331), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2355 transitions. [2024-11-10 17:25:00,953 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2355 transitions. Word has length 72 [2024-11-10 17:25:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2355 transitions. [2024-11-10 17:25:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:25:00,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2355 transitions. [2024-11-10 17:25:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:25:00,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:00,957 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] [2024-11-10 17:25:00,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:25:00,957 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:00,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash -854221678, now seen corresponding path program 1 times [2024-11-10 17:25:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871029026] [2024-11-10 17:25:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:01,346 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-10 17:25:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871029026] [2024-11-10 17:25:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871029026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:01,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:01,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:25:01,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526857983] [2024-11-10 17:25:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:01,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:25:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:25:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:01,349 INFO L87 Difference]: Start difference. First operand 1896 states and 2355 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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-10 17:25:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:02,448 INFO L93 Difference]: Finished difference Result 1812 states and 2271 transitions. [2024-11-10 17:25:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:25:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2024-11-10 17:25:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:02,452 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:25:02,453 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:25:02,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:25:02,453 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 1580 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:02,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 1566 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:25:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:25:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1532. [2024-11-10 17:25:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1053 states have (on average 1.667616334283001) internal successors, (1756), 1522 states have internal predecessors, (1756), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1780 transitions. [2024-11-10 17:25:02,476 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1780 transitions. Word has length 75 [2024-11-10 17:25:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1780 transitions. [2024-11-10 17:25:02,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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-10 17:25:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1780 transitions. [2024-11-10 17:25:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:25:02,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:02,479 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] [2024-11-10 17:25:02,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:25:02,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr617REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:02,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:02,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879306, now seen corresponding path program 1 times [2024-11-10 17:25:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:02,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978368788] [2024-11-10 17:25:02,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:02,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:02,749 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-10 17:25:02,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:02,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978368788] [2024-11-10 17:25:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978368788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:02,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:02,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:02,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824265806] [2024-11-10 17:25:02,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:02,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:02,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:02,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:02,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:02,752 INFO L87 Difference]: Start difference. First operand 1532 states and 1780 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10 17:25:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:03,619 INFO L93 Difference]: Finished difference Result 1531 states and 1779 transitions. [2024-11-10 17:25:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:25:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:03,622 INFO L225 Difference]: With dead ends: 1531 [2024-11-10 17:25:03,622 INFO L226 Difference]: Without dead ends: 1531 [2024-11-10 17:25:03,623 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-10 17:25:03,623 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 2 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4664 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:03,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4664 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:25:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-11-10 17:25:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-11-10 17:25:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1053 states have (on average 1.6666666666666667) internal successors, (1755), 1521 states have internal predecessors, (1755), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:25:03,639 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 80 [2024-11-10 17:25:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:03,640 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:25:03,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10 17:25:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:25:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:25:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:03,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] [2024-11-10 17:25:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:25:03,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr618REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879305, now seen corresponding path program 1 times [2024-11-10 17:25:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633674951] [2024-11-10 17:25:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:03,948 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-10 17:25:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633674951] [2024-11-10 17:25:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633674951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:25:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299193151] [2024-11-10 17:25:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:25:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:25:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:25:03,952 INFO L87 Difference]: Start difference. First operand 1531 states and 1779 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10 17:25:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:04,907 INFO L93 Difference]: Finished difference Result 1530 states and 1778 transitions. [2024-11-10 17:25:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:25:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:04,911 INFO L225 Difference]: With dead ends: 1530 [2024-11-10 17:25:04,911 INFO L226 Difference]: Without dead ends: 1530 [2024-11-10 17:25:04,911 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-10 17:25:04,912 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4692 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:04,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4692 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:25:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-10 17:25:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2024-11-10 17:25:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1052 states have (on average 1.667300380228137) internal successors, (1754), 1520 states have internal predecessors, (1754), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1778 transitions. [2024-11-10 17:25:04,929 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1778 transitions. Word has length 80 [2024-11-10 17:25:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:04,929 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1778 transitions. [2024-11-10 17:25:04,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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-10 17:25:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1778 transitions. [2024-11-10 17:25:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:25:04,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:04,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:04,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:25:04,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:04,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:04,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1481159437, now seen corresponding path program 1 times [2024-11-10 17:25:04,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:04,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657048524] [2024-11-10 17:25:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:04,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:05,136 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-10 17:25:05,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657048524] [2024-11-10 17:25:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657048524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:05,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:05,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:25:05,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452706497] [2024-11-10 17:25:05,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:05,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:25:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:25:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:25:05,140 INFO L87 Difference]: Start difference. First operand 1530 states and 1778 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:06,361 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:25:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:25:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-10 17:25:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:06,365 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:25:06,365 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:25:06,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:25:06,366 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 17 mSDsluCounter, 5632 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:06,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7210 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:25:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:25:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1536. [2024-11-10 17:25:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1057 states have (on average 1.6660359508041627) internal successors, (1761), 1525 states have internal predecessors, (1761), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:25:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1791 transitions. [2024-11-10 17:25:06,383 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1791 transitions. Word has length 88 [2024-11-10 17:25:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:06,383 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1791 transitions. [2024-11-10 17:25:06,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1791 transitions. [2024-11-10 17:25:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:25:06,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:06,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:06,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:25:06,384 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:06,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1481159436, now seen corresponding path program 1 times [2024-11-10 17:25:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608906645] [2024-11-10 17:25:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:06,768 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-10 17:25:06,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:06,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608906645] [2024-11-10 17:25:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608906645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:25:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343075435] [2024-11-10 17:25:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:25:06,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:25:06,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:25:06,771 INFO L87 Difference]: Start difference. First operand 1536 states and 1791 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:07,899 INFO L93 Difference]: Finished difference Result 1536 states and 1790 transitions. [2024-11-10 17:25:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:25:07,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2024-11-10 17:25:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:07,905 INFO L225 Difference]: With dead ends: 1536 [2024-11-10 17:25:07,905 INFO L226 Difference]: Without dead ends: 1536 [2024-11-10 17:25:07,906 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-10 17:25:07,906 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 18 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5999 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:07,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5999 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:25:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-10 17:25:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2024-11-10 17:25:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1057 states have (on average 1.6650898770104068) internal successors, (1760), 1525 states have internal predecessors, (1760), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:25:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1790 transitions. [2024-11-10 17:25:07,924 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1790 transitions. Word has length 88 [2024-11-10 17:25:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1790 transitions. [2024-11-10 17:25:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1790 transitions. [2024-11-10 17:25:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:25:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:07,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:25:07,925 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1674677226, now seen corresponding path program 1 times [2024-11-10 17:25:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971921345] [2024-11-10 17:25:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:07,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:08,305 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-10 17:25:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971921345] [2024-11-10 17:25:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971921345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:08,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344673085] [2024-11-10 17:25:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:08,310 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-10 17:25:08,311 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-10 17:25:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:08,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:25:08,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:08,553 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-10 17:25:08,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:08,662 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-10 17:25:08,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:08,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:08,741 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-10 17:25:08,766 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-10 17:25:08,769 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-10 17:25:08,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:08,812 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:25:08,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 21 treesize of output 20 [2024-11-10 17:25:08,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344673085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:08,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:08,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:25:08,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842831046] [2024-11-10 17:25:08,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:08,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:25:08,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:08,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:25:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=195, Unknown=7, NotChecked=0, Total=240 [2024-11-10 17:25:08,842 INFO L87 Difference]: Start difference. First operand 1536 states and 1790 transitions. Second operand has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:11,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:11,263 INFO L93 Difference]: Finished difference Result 1535 states and 1789 transitions. [2024-11-10 17:25:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:25:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-10 17:25:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:11,266 INFO L225 Difference]: With dead ends: 1535 [2024-11-10 17:25:11,266 INFO L226 Difference]: Without dead ends: 1535 [2024-11-10 17:25:11,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=451, Unknown=8, NotChecked=0, Total=552 [2024-11-10 17:25:11,267 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1569 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 6510 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 9972 SdHoareTripleChecker+Invalid, 6536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:11,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 9972 Invalid, 6536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6510 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:25:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-10 17:25:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2024-11-10 17:25:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1057 states have (on average 1.664143803216651) internal successors, (1759), 1524 states have internal predecessors, (1759), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-10 17:25:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1789 transitions. [2024-11-10 17:25:11,282 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1789 transitions. Word has length 89 [2024-11-10 17:25:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:11,282 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1789 transitions. [2024-11-10 17:25:11,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1789 transitions. [2024-11-10 17:25:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:25:11,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:11,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:11,298 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-10 17:25:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 17:25:11,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1674677225, now seen corresponding path program 1 times [2024-11-10 17:25:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:11,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311966528] [2024-11-10 17:25:11,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:12,137 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-10 17:25:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311966528] [2024-11-10 17:25:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311966528] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639981768] [2024-11-10 17:25:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:12,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:12,140 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-10 17:25:12,141 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-10 17:25:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:12,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:25:12,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:12,332 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-10 17:25:12,417 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-10 17:25:12,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:12,425 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-10 17:25:12,436 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-10 17:25:12,443 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-10 17:25:12,496 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-10 17:25:12,499 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-10 17:25:12,597 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:12,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:25:12,612 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-10 17:25:12,644 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-10 17:25:12,652 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-10 17:25:12,654 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-10 17:25:12,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639981768] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:12,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-10 17:25:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508929859] [2024-11-10 17:25:12,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:12,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:25:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:25:12,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=274, Unknown=12, NotChecked=0, Total=342 [2024-11-10 17:25:12,758 INFO L87 Difference]: Start difference. First operand 1535 states and 1789 transitions. Second operand has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:25:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:15,789 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:25:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:25:15,789 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 89 [2024-11-10 17:25:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:15,792 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:25:15,792 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:25:15,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=445, Unknown=15, NotChecked=0, Total=552 [2024-11-10 17:25:15,792 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1576 mSDsluCounter, 6840 mSDsCounter, 0 mSdLazyCounter, 6988 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 7862 SdHoareTripleChecker+Invalid, 7026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 6988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:15,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 7862 Invalid, 7026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6988 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 17:25:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:25:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1533. [2024-11-10 17:25:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1056 states have (on average 1.6638257575757576) internal successors, (1757), 1522 states have internal predecessors, (1757), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1781 transitions. [2024-11-10 17:25:15,808 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1781 transitions. Word has length 89 [2024-11-10 17:25:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:15,808 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1781 transitions. [2024-11-10 17:25:15,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:25:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1781 transitions. [2024-11-10 17:25:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:25:15,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:15,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:15,827 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-10 17:25:16,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 17:25:16,010 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:16,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:16,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1274952067, now seen corresponding path program 1 times [2024-11-10 17:25:16,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066887955] [2024-11-10 17:25:16,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:16,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:16,392 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-10 17:25:16,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066887955] [2024-11-10 17:25:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066887955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:25:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794572872] [2024-11-10 17:25:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:25:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:25:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:25:16,394 INFO L87 Difference]: Start difference. First operand 1533 states and 1781 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:19,175 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:25:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:25:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-10 17:25:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:19,178 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:25:19,178 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:25:19,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:25:19,179 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1574 mSDsluCounter, 10898 mSDsCounter, 0 mSdLazyCounter, 7864 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 11914 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:19,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 11914 Invalid, 7889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7864 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 17:25:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:25:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1542. [2024-11-10 17:25:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1064 states have (on average 1.6607142857142858) internal successors, (1767), 1530 states have internal predecessors, (1767), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1792 transitions. [2024-11-10 17:25:19,193 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1792 transitions. Word has length 91 [2024-11-10 17:25:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:19,193 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1792 transitions. [2024-11-10 17:25:19,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1792 transitions. [2024-11-10 17:25:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:25:19,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:19,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:19,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:25:19,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:19,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1274952068, now seen corresponding path program 1 times [2024-11-10 17:25:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55168676] [2024-11-10 17:25:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:19,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:19,714 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-10 17:25:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55168676] [2024-11-10 17:25:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55168676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:25:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079893632] [2024-11-10 17:25:19,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:25:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:19,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:25:19,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:25:19,716 INFO L87 Difference]: Start difference. First operand 1542 states and 1792 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:22,241 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:25:22,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:25:22,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2024-11-10 17:25:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:22,243 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:25:22,244 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:25:22,244 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-10 17:25:22,244 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 1591 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 6956 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 7871 SdHoareTripleChecker+Invalid, 6980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 6956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:22,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 7871 Invalid, 6980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6956 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:25:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:25:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:25:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1064 states have (on average 1.6597744360902256) internal successors, (1766), 1530 states have internal predecessors, (1766), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:25:22,259 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 91 [2024-11-10 17:25:22,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:22,259 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:25:22,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:25:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:25:22,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:22,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:22,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:25:22,260 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr609REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:22,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 32611200, now seen corresponding path program 1 times [2024-11-10 17:25:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979582086] [2024-11-10 17:25:22,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:22,636 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-10 17:25:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979582086] [2024-11-10 17:25:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979582086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973872353] [2024-11-10 17:25:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:22,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:22,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:22,639 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-10 17:25:22,640 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-10 17:25:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:22,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:25:22,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:22,843 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-10 17:25:22,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:22,953 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-10 17:25:22,960 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-10 17:25:23,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:23,018 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-10 17:25:23,059 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:25:23,072 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-10 17:25:23,075 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-10 17:25:23,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:23,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:25:23,090 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (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_946) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:25:23,122 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:25:23,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 17:25:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973872353] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:23,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-10 17:25:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77236990] [2024-11-10 17:25:23,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:25:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:23,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:25:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=6, NotChecked=66, Total=380 [2024-11-10 17:25:23,154 INFO L87 Difference]: Start difference. First operand 1542 states and 1791 transitions. Second operand has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:25,202 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:25:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:25:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-10 17:25:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:25,205 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:25:25,205 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:25:25,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=543, Unknown=6, NotChecked=98, Total=756 [2024-11-10 17:25:25,206 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1565 mSDsluCounter, 7948 mSDsCounter, 0 mSdLazyCounter, 5869 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 8964 SdHoareTripleChecker+Invalid, 5894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 5869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:25,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 8964 Invalid, 5894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 5869 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:25:25,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:25:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1541. [2024-11-10 17:25:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1064 states have (on average 1.6588345864661653) internal successors, (1765), 1529 states have internal predecessors, (1765), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1790 transitions. [2024-11-10 17:25:25,220 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1790 transitions. Word has length 92 [2024-11-10 17:25:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:25,221 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1790 transitions. [2024-11-10 17:25:25,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.866666666666667) internal successors, (133), 15 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1790 transitions. [2024-11-10 17:25:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:25:25,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:25,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:25,235 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-10 17:25:25,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:25,422 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:25,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 32611201, now seen corresponding path program 1 times [2024-11-10 17:25:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178814615] [2024-11-10 17:25:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:25,986 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-10 17:25:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178814615] [2024-11-10 17:25:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178814615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634179031] [2024-11-10 17:25:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:25,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:25,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:25,989 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-10 17:25:25,990 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-10 17:25:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:26,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:25:26,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:26,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:25:26,275 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:26,275 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-10 17:25:26,281 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-10 17:25:26,304 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-10 17:25:26,309 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-10 17:25:26,373 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-10 17:25:26,376 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-10 17:25:26,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:26,456 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-10 17:25:26,460 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-10 17:25:26,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:26,519 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-10 17:25:26,522 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-10 17:25:26,539 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-10 17:25:26,543 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-10 17:25:26,559 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-10 17:25:26,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:26,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1097 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:25:26,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1096 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102))) (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~mem50#1.base| v_ArrVal_1103) .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1097 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1097) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-10 17:25:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634179031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:26,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-10 17:25:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509242903] [2024-11-10 17:25:26,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:25:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:25:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=473, Unknown=4, NotChecked=90, Total=650 [2024-11-10 17:25:26,701 INFO L87 Difference]: Start difference. First operand 1541 states and 1790 transitions. Second operand has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-10 17:25:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:30,567 INFO L93 Difference]: Finished difference Result 1543 states and 1797 transitions. [2024-11-10 17:25:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:25:30,567 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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 92 [2024-11-10 17:25:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:30,569 INFO L225 Difference]: With dead ends: 1543 [2024-11-10 17:25:30,569 INFO L226 Difference]: Without dead ends: 1543 [2024-11-10 17:25:30,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=737, Unknown=4, NotChecked=114, Total=992 [2024-11-10 17:25:30,570 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 1571 mSDsluCounter, 9722 mSDsCounter, 0 mSdLazyCounter, 10721 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 10743 SdHoareTripleChecker+Invalid, 10761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:30,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 10743 Invalid, 10761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10721 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 17:25:30,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-10 17:25:30,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1531. [2024-11-10 17:25:30,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1056 states have (on average 1.6619318181818181) internal successors, (1755), 1520 states have internal predecessors, (1755), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:25:30,582 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 92 [2024-11-10 17:25:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:30,582 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:25:30,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.055555555555555) internal successors, (145), 20 states have internal predecessors, (145), 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-10 17:25:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:25:30,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:25:30,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:30,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, 1] [2024-11-10 17:25:30,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:25:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:30,788 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:30,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1702963148, now seen corresponding path program 1 times [2024-11-10 17:25:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285581143] [2024-11-10 17:25:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:31,204 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-10 17:25:31,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:31,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285581143] [2024-11-10 17:25:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285581143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:31,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:25:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029023543] [2024-11-10 17:25:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:31,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:25:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:25:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:25:31,206 INFO L87 Difference]: Start difference. First operand 1531 states and 1779 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:33,192 INFO L93 Difference]: Finished difference Result 1547 states and 1801 transitions. [2024-11-10 17:25:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:25:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-10 17:25:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:33,195 INFO L225 Difference]: With dead ends: 1547 [2024-11-10 17:25:33,195 INFO L226 Difference]: Without dead ends: 1547 [2024-11-10 17:25:33,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-10 17:25:33,196 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1579 mSDsluCounter, 7917 mSDsCounter, 0 mSdLazyCounter, 5906 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 8932 SdHoareTripleChecker+Invalid, 5932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:33,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 8932 Invalid, 5932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5906 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:25:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-10 17:25:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1543. [2024-11-10 17:25:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1067 states have (on average 1.6569821930646673) internal successors, (1768), 1531 states have internal predecessors, (1768), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1793 transitions. [2024-11-10 17:25:33,209 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1793 transitions. Word has length 94 [2024-11-10 17:25:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:33,209 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1793 transitions. [2024-11-10 17:25:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1793 transitions. [2024-11-10 17:25:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:25:33,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:33,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:33,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:25:33,210 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1702963149, now seen corresponding path program 1 times [2024-11-10 17:25:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603615250] [2024-11-10 17:25:33,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:25:33,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:33,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603615250] [2024-11-10 17:25:33,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603615250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:33,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:33,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:25:33,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17717105] [2024-11-10 17:25:33,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:33,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:25:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:33,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:25:33,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:25:33,776 INFO L87 Difference]: Start difference. First operand 1543 states and 1793 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:35,854 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:25:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:25:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2024-11-10 17:25:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:35,856 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:25:35,856 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:25:35,857 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-10 17:25:35,857 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1599 mSDsluCounter, 5081 mSDsCounter, 0 mSdLazyCounter, 5443 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 6103 SdHoareTripleChecker+Invalid, 5479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 5443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:35,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 6103 Invalid, 5479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 5443 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:25:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:25:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1543. [2024-11-10 17:25:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1067 states have (on average 1.656044985941893) internal successors, (1767), 1531 states have internal predecessors, (1767), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1792 transitions. [2024-11-10 17:25:35,870 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1792 transitions. Word has length 94 [2024-11-10 17:25:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:35,870 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1792 transitions. [2024-11-10 17:25:35,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:25:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1792 transitions. [2024-11-10 17:25:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:25:35,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:35,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:35,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:25:35,871 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr605REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:35,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash 859383983, now seen corresponding path program 1 times [2024-11-10 17:25:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715658188] [2024-11-10 17:25:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:35,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:36,306 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-10 17:25:36,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715658188] [2024-11-10 17:25:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715658188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851771625] [2024-11-10 17:25:36,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:36,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:36,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:36,309 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-10 17:25:36,309 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-10 17:25:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:36,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:25:36,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:36,530 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-10 17:25:36,607 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:36,607 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-10 17:25:36,613 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-10 17:25:36,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:36,667 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-10 17:25:36,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:36,700 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-10 17:25:36,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:36,728 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-10 17:25:36,738 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-10 17:25:36,741 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-10 17:25:36,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:36,748 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1391) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:25:36,753 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 (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_1391) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:25:36,844 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:25:36,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2024-11-10 17:25:36,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1394))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1390)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1391)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-10 17:25:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851771625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:36,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:36,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:25:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655485199] [2024-11-10 17:25:36,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:25:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:25:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=381, Unknown=20, NotChecked=126, Total=600 [2024-11-10 17:25:36,855 INFO L87 Difference]: Start difference. First operand 1543 states and 1792 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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-10 17:25:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:39,400 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:25:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:25:39,400 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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 95 [2024-11-10 17:25:39,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:39,402 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:25:39,402 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:25:39,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=771, Unknown=25, NotChecked=180, Total=1122 [2024-11-10 17:25:39,403 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1559 mSDsluCounter, 10874 mSDsCounter, 0 mSdLazyCounter, 7847 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 11889 SdHoareTripleChecker+Invalid, 7873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 7847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:39,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 11889 Invalid, 7873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 7847 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:25:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:25:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:25:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1067 states have (on average 1.655107778819119) internal successors, (1766), 1530 states have internal predecessors, (1766), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:25:39,415 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 95 [2024-11-10 17:25:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:25:39,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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-10 17:25:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:25:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:25:39,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:39,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:39,430 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-10 17:25:39,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 17:25:39,617 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr606REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash 859383984, now seen corresponding path program 1 times [2024-11-10 17:25:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:39,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898635625] [2024-11-10 17:25:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:39,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:40,265 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-10 17:25:40,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898635625] [2024-11-10 17:25:40,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898635625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:40,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881273711] [2024-11-10 17:25:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:40,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:40,267 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-10 17:25:40,269 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-10 17:25:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:40,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 17:25:40,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:40,469 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-10 17:25:40,532 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:40,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:25:40,536 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-10 17:25:40,545 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-10 17:25:40,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:25:40,585 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-10 17:25:40,589 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-10 17:25:40,665 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:40,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:25:40,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:25:40,721 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:40,722 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-10 17:25:40,727 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-10 17:25:40,763 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:40,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:25:40,769 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-10 17:25:40,781 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-10 17:25:40,784 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-10 17:25:40,785 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-10 17:25:40,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:40,830 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:25:40,842 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_1556 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:25:40,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) .cse0 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:25:40,868 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_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1553))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1554) .cse2 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-10 17:25:40,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse0 v_ArrVal_1554) (select (select (store .cse1 .cse0 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1556))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (v_ArrVal_1554 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1561))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1553))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1562) .cse3 v_ArrVal_1554) .cse4 v_ArrVal_1556) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:25:40,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881273711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:40,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:25:40,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-10 17:25:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818067945] [2024-11-10 17:25:40,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:25:40,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:25:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:25:40,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=362, Unknown=5, NotChecked=210, Total=650 [2024-11-10 17:25:40,929 INFO L87 Difference]: Start difference. First operand 1542 states and 1791 transitions. Second operand has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:45,279 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:25:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:25:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2024-11-10 17:25:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:45,282 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:25:45,282 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:25:45,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=749, Unknown=5, NotChecked=300, Total=1190 [2024-11-10 17:25:45,283 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 1566 mSDsluCounter, 8881 mSDsCounter, 0 mSdLazyCounter, 9874 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 9894 SdHoareTripleChecker+Invalid, 9902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:45,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 9894 Invalid, 9902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 9874 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-10 17:25:45,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:25:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1529. [2024-11-10 17:25:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1056 states have (on average 1.660037878787879) internal successors, (1753), 1518 states have internal predecessors, (1753), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:25:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1777 transitions. [2024-11-10 17:25:45,296 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1777 transitions. Word has length 95 [2024-11-10 17:25:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:45,296 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1777 transitions. [2024-11-10 17:25:45,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.352941176470589) internal successors, (142), 18 states have internal predecessors, (142), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:25:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1777 transitions. [2024-11-10 17:25:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:25:45,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:45,298 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-10 17:25:45,314 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-10 17:25:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:45,499 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:45,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:45,499 INFO L85 PathProgramCache]: Analyzing trace with hash 823168444, now seen corresponding path program 1 times [2024-11-10 17:25:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262186875] [2024-11-10 17:25:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:45,955 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-10 17:25:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262186875] [2024-11-10 17:25:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262186875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:45,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:25:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217810805] [2024-11-10 17:25:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:25:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:25:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:25:45,957 INFO L87 Difference]: Start difference. First operand 1529 states and 1777 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-10 17:25:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:48,350 INFO L93 Difference]: Finished difference Result 1548 states and 1802 transitions. [2024-11-10 17:25:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:25:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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 97 [2024-11-10 17:25:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:48,353 INFO L225 Difference]: With dead ends: 1548 [2024-11-10 17:25:48,353 INFO L226 Difference]: Without dead ends: 1548 [2024-11-10 17:25:48,353 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-10 17:25:48,353 INFO L432 NwaCegarLoop]: 1014 mSDtfsCounter, 1582 mSDsluCounter, 8909 mSDsCounter, 0 mSdLazyCounter, 6545 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 9923 SdHoareTripleChecker+Invalid, 6571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:48,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 9923 Invalid, 6571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6545 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:25:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-10 17:25:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1544. [2024-11-10 17:25:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1070 states have (on average 1.6532710280373832) internal successors, (1769), 1532 states have internal predecessors, (1769), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1794 transitions. [2024-11-10 17:25:48,366 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1794 transitions. Word has length 97 [2024-11-10 17:25:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:48,367 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1794 transitions. [2024-11-10 17:25:48,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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-10 17:25:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1794 transitions. [2024-11-10 17:25:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:25:48,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:48,368 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-10 17:25:48,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:25:48,368 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:48,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash 823168445, now seen corresponding path program 1 times [2024-11-10 17:25:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755190104] [2024-11-10 17:25:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:48,976 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-10 17:25:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:48,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755190104] [2024-11-10 17:25:48,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755190104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:25:48,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:25:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:25:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77564046] [2024-11-10 17:25:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:25:48,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:25:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:25:48,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:25:48,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:25:48,977 INFO L87 Difference]: Start difference. First operand 1544 states and 1794 transitions. Second operand has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-10 17:25:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:25:51,861 INFO L93 Difference]: Finished difference Result 1547 states and 1801 transitions. [2024-11-10 17:25:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:25:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-10 17:25:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:25:51,863 INFO L225 Difference]: With dead ends: 1547 [2024-11-10 17:25:51,863 INFO L226 Difference]: Without dead ends: 1547 [2024-11-10 17:25:51,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-10 17:25:51,864 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 1580 mSDsluCounter, 7587 mSDsCounter, 0 mSdLazyCounter, 7838 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 8608 SdHoareTripleChecker+Invalid, 7874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 7838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:25:51,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 8608 Invalid, 7874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 7838 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:25:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-10 17:25:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2024-11-10 17:25:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1070 states have (on average 1.652336448598131) internal successors, (1768), 1532 states have internal predecessors, (1768), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:25:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1793 transitions. [2024-11-10 17:25:51,876 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1793 transitions. Word has length 97 [2024-11-10 17:25:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:25:51,877 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1793 transitions. [2024-11-10 17:25:51,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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-10 17:25:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1793 transitions. [2024-11-10 17:25:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:25:51,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:25:51,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:25:51,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 17:25:51,878 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr601REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:25:51,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:25:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -390087175, now seen corresponding path program 1 times [2024-11-10 17:25:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:25:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705082857] [2024-11-10 17:25:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:51,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:25:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:25:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:52,303 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-10 17:25:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:25:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705082857] [2024-11-10 17:25:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705082857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:25:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988649095] [2024-11-10 17:25:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:25:52,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:25:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:25:52,306 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-10 17:25:52,307 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-10 17:25:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:25:52,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:25:52,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:25:52,523 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-10 17:25:52,593 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:25:52,593 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-10 17:25:52,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:25:52,629 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:52,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 17:25:52,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:52,656 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-10 17:25:52,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:52,685 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-10 17:25:52,723 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:25:52,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:25:52,732 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-10 17:25:52,734 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-10 17:25:52,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:25:52,742 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1875) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:25:52,773 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:25:52,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-10 17:25:52,777 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1874))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1875)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem53#1.base|)) is different from false [2024-11-10 17:26:00,907 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1875 (Array Int Int)) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1873 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1878))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1873)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_1874))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1875)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3))))) is different from false [2024-11-10 17:26:00,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988649095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:00,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:26:00,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 18 [2024-11-10 17:26:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836283615] [2024-11-10 17:26:00,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:26:00,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:26:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:00,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:26:00,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=409, Unknown=24, NotChecked=132, Total=650 [2024-11-10 17:26:00,909 INFO L87 Difference]: Start difference. First operand 1544 states and 1793 transitions. Second operand has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:03,837 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:26:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:26:03,838 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:26:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:03,840 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:26:03,840 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:26:03,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=160, Invalid=758, Unknown=24, NotChecked=180, Total=1122 [2024-11-10 17:26:03,841 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 1565 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 6470 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9979 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 6470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:03,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 9979 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 6470 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:26:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:26:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1543. [2024-11-10 17:26:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1070 states have (on average 1.6514018691588785) internal successors, (1767), 1531 states have internal predecessors, (1767), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 8 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-10 17:26:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1792 transitions. [2024-11-10 17:26:03,853 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1792 transitions. Word has length 98 [2024-11-10 17:26:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:03,854 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1792 transitions. [2024-11-10 17:26:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.411764705882353) internal successors, (143), 18 states have internal predecessors, (143), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:26:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1792 transitions. [2024-11-10 17:26:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:26:03,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:03,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:03,869 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-10 17:26:04,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:26:04,055 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr602REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:26:04,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash -390087174, now seen corresponding path program 1 times [2024-11-10 17:26:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867439141] [2024-11-10 17:26:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:26:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:04,702 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-10 17:26:04,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867439141] [2024-11-10 17:26:04,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867439141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050139174] [2024-11-10 17:26:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:04,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:26:04,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:26:04,705 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-10 17:26:04,706 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-10 17:26:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:04,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 17:26:04,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:26:04,929 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-10 17:26:05,175 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-10 17:26:05,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:26:05,183 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-10 17:26:05,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 17:26:05,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-10 17:26:05,298 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 18 treesize of output 10 [2024-11-10 17:26:05,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 17:26:05,396 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 17:26:05,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 17:26:05,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 17:26:05,476 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 17:26:05,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 17:26:05,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 17:26:05,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2024-11-10 17:26:05,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 17:26:05,588 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 17:26:05,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-10 17:26:05,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-10 17:26:05,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-10 17:26:05,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-10 17:26:05,632 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-10 17:26:05,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:26:05,742 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_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2054 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-10 17:26:05,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_#t~mem53#1.offset| 4))) (and (forall ((v_ArrVal_2052 (Array Int Int))) (or (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2052))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2051) .cse0 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (store .cse3 .cse4 (select v_ArrVal_2052 .cse4)) v_ArrVal_2052)))) (forall ((v_ArrVal_2052 (Array Int Int))) (or (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2051) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (not (= (store .cse3 .cse4 (select v_ArrVal_2052 .cse4)) v_ArrVal_2052)))))) is different from false [2024-11-10 17:26:05,815 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (and (forall ((v_ArrVal_2052 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2052 .cse1)) v_ArrVal_2052)) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2052))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2051) .cse3 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 24) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_2052 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2052 .cse1)) v_ArrVal_2052)) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_2051) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 20))))))))) is different from false [2024-11-10 17:26:05,858 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2049))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2050)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_2052 (let ((.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2052 .cse2))))) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (let ((.cse6 (store .cse0 .cse1 v_ArrVal_2052))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store .cse3 .cse1 v_ArrVal_2051) .cse5 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2049))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2050)) (.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= v_ArrVal_2052 (let ((.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (store (select .cse7 .cse8) .cse9 (select v_ArrVal_2052 .cse9))))) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse10 .cse8 v_ArrVal_2051) (select (select (store .cse7 .cse8 v_ArrVal_2052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 20))))))))) is different from false [2024-11-10 17:26:05,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_2049))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_2050)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2052 .cse2))) v_ArrVal_2052)) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse3 .cse1 v_ArrVal_2051) (select (select (store .cse0 .cse1 v_ArrVal_2052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 20))))))) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_2049))) (let ((.cse9 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_2050)) (.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (or (not (= (let ((.cse8 (+ (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 4))) (store (select .cse6 .cse7) .cse8 (select v_ArrVal_2052 .cse8))) v_ArrVal_2052)) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (let ((.cse11 (store .cse6 .cse7 v_ArrVal_2052))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (<= (+ (select (select (store (store .cse9 .cse7 v_ArrVal_2051) .cse10 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 24) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))) is different from false [2024-11-10 17:26:05,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2059))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse8 .cse7 v_ArrVal_2049))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2060) .cse7 v_ArrVal_2050))) (or (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2053 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2052))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store .cse0 .cse1 v_ArrVal_2051) .cse2 v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) (not (= (let ((.cse6 (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (store (select .cse5 .cse1) .cse6 (select v_ArrVal_2052 .cse6))) v_ArrVal_2052)))))))) (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2059 (Array Int Int)) (v_ArrVal_2052 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2059))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse14 .cse13 v_ArrVal_2049))) (let ((.cse12 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2060) .cse13 v_ArrVal_2050)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (not (= (let ((.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4))) (store (select .cse9 .cse10) .cse11 (select v_ArrVal_2052 .cse11))) v_ArrVal_2052)) (forall ((v_ArrVal_2054 (Array Int Int)) (v_ArrVal_2051 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse12 .cse10 v_ArrVal_2051) (select (select (store .cse9 .cse10 v_ArrVal_2052) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2054) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))))))))) is different from false [2024-11-10 17:26:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050139174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:26:05,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:26:05,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2024-11-10 17:26:05,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106125985] [2024-11-10 17:26:05,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:26:06,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 17:26:06,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 17:26:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=764, Unknown=21, NotChecked=366, Total=1260 [2024-11-10 17:26:06,002 INFO L87 Difference]: Start difference. First operand 1543 states and 1792 transitions. Second operand has 27 states, 24 states have (on average 7.875) internal successors, (189), 26 states have internal predecessors, (189), 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-10 17:26:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:26:12,127 INFO L93 Difference]: Finished difference Result 2433 states and 2863 transitions. [2024-11-10 17:26:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 17:26:12,127 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 7.875) internal successors, (189), 26 states have internal predecessors, (189), 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 98 [2024-11-10 17:26:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:26:12,131 INFO L225 Difference]: With dead ends: 2433 [2024-11-10 17:26:12,131 INFO L226 Difference]: Without dead ends: 2433 [2024-11-10 17:26:12,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1429, Unknown=22, NotChecked=498, Total=2162 [2024-11-10 17:26:12,132 INFO L432 NwaCegarLoop]: 1006 mSDtfsCounter, 4053 mSDsluCounter, 12251 mSDsCounter, 0 mSdLazyCounter, 12610 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 13257 SdHoareTripleChecker+Invalid, 12720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 12610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:26:12,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 13257 Invalid, 12720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 12610 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-10 17:26:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2024-11-10 17:26:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 1527. [2024-11-10 17:26:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1056 states have (on average 1.6581439393939394) internal successors, (1751), 1516 states have internal predecessors, (1751), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-10 17:26:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1775 transitions. [2024-11-10 17:26:12,145 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1775 transitions. Word has length 98 [2024-11-10 17:26:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:26:12,145 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1775 transitions. [2024-11-10 17:26:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 7.875) internal successors, (189), 26 states have internal predecessors, (189), 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-10 17:26:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1775 transitions. [2024-11-10 17:26:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 17:26:12,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:26:12,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:26:12,161 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-10 17:26:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 17:26:12,347 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr597REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 709 more)] === [2024-11-10 17:26:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:26:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -108473098, now seen corresponding path program 1 times [2024-11-10 17:26:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:26:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123833693] [2024-11-10 17:26:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:26:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:26:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:26:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:26:12,896 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-10 17:26:12,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:26:12,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123833693] [2024-11-10 17:26:12,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123833693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:26:12,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:26:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 17:26:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354112397] [2024-11-10 17:26:12,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:26:12,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:26:12,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:26:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:26:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-10 17:26:12,898 INFO L87 Difference]: Start difference. First operand 1527 states and 1775 transitions. Second operand has 17 states, 15 states have (on average 6.6) internal successors, (99), 16 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)