./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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_SAX_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 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:38:52,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:38:53,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:38:53,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:38:53,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:38:53,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:38:53,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:38:53,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:38:53,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:38:53,111 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:38:53,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:38:53,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:38:53,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:38:53,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:38:53,114 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:38:53,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:38:53,115 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:38:53,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:38:53,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:38:53,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:38:53,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:38:53,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:38:53,120 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:38:53,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:38:53,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:38:53,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:38:53,121 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:38:53,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:38:53,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:38:53,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:38:53,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:38:53,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:38:53,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:38:53,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:38:53,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:38:53,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:38:53,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:38:53,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:38:53,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:38:53,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:38:53,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:38:53,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:38:53,125 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 -> 1a17e1f9edfd37607fb472869452b377d4af1281c9808dec0371b4f943952037 [2024-11-10 17:38:53,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:38:53,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:38:53,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:38:53,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:38:53,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:38:53,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-10 17:38:54,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:38:55,178 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:38:55,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test5-1.i [2024-11-10 17:38:55,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91acf9872/d8bb4df245594d9ca349b3770b98dcfa/FLAG1d6ec0352 [2024-11-10 17:38:55,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91acf9872/d8bb4df245594d9ca349b3770b98dcfa [2024-11-10 17:38:55,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:38:55,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:38:55,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:55,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:38:55,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:38:55,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:55" (1/1) ... [2024-11-10 17:38:55,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a862ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:55, skipping insertion in model container [2024-11-10 17:38:55,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:55" (1/1) ... [2024-11-10 17:38:55,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:38:55,746 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:38:55,794 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:38:55,799 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:38:55,805 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:38:55,814 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:38:55,848 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:38:55,850 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:38:55,853 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:38:55,857 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:38:55,890 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:38:55,891 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:38:55,898 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:38:55,898 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:38:55,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:55,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:38:56,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:56,087 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:38:56,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56 WrapperNode [2024-11-10 17:38:56,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:56,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:56,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:38:56,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:38:56,095 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:38:56" (1/1) ... [2024-11-10 17:38:56,132 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:38:56" (1/1) ... [2024-11-10 17:38:56,221 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2006 [2024-11-10 17:38:56,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:56,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:38:56,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:38:56,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:38:56,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,438 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 24, 323]. 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, 1, 82]. [2024-11-10 17:38:56,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:38:56,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:38:56,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:38:56,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:38:56,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (1/1) ... [2024-11-10 17:38:56,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:38:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:56,583 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:38:56,590 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:38:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:38:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:38:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:38:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:38:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 17:38:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:38:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:38:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:38:56,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 17:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:56,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:38:56,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:56,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:56,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:38:56,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 17:38:56,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:38:56,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:38:56,934 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:38:56,936 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:38:59,711 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:38:59,925 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-11-10 17:38:59,926 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:39:00,026 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:39:00,027 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:39:00,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:39:00 BoogieIcfgContainer [2024-11-10 17:39:00,027 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:39:00,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:39:00,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:39:00,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:39:00,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:38:55" (1/3) ... [2024-11-10 17:39:00,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d9ed14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:39:00, skipping insertion in model container [2024-11-10 17:39:00,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:56" (2/3) ... [2024-11-10 17:39:00,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d9ed14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:39:00, skipping insertion in model container [2024-11-10 17:39:00,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:39:00" (3/3) ... [2024-11-10 17:39:00,038 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test5-1.i [2024-11-10 17:39:00,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:39:00,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 712 error locations. [2024-11-10 17:39:00,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:39:00,158 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;@44ef8a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:39:00,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 712 error locations. [2024-11-10 17:39:00,173 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:39:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:39:00,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:00,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:39:00,182 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:39:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329309, now seen corresponding path program 1 times [2024-11-10 17:39:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672021719] [2024-11-10 17:39:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:00,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:00,376 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:39:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672021719] [2024-11-10 17:39:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672021719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:39:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466945281] [2024-11-10 17:39:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:00,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:39:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:00,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:39:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:39:00,422 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:39:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:00,671 INFO L93 Difference]: Finished difference Result 1746 states and 2006 transitions. [2024-11-10 17:39:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:39:00,674 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:39:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:00,701 INFO L225 Difference]: With dead ends: 1746 [2024-11-10 17:39:00,702 INFO L226 Difference]: Without dead ends: 1743 [2024-11-10 17:39:00,703 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:39:00,707 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:00,710 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.2s Time] [2024-11-10 17:39:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-11-10 17:39:00,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1743. [2024-11-10 17:39:00,821 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:39:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2003 transitions. [2024-11-10 17:39:00,831 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2003 transitions. Word has length 6 [2024-11-10 17:39:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2003 transitions. [2024-11-10 17:39:00,831 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:39:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2003 transitions. [2024-11-10 17:39:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:39:00,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:00,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:39:00,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:39:00,833 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:39:00,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329340, now seen corresponding path program 1 times [2024-11-10 17:39:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832736834] [2024-11-10 17:39:00,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:00,939 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:39:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832736834] [2024-11-10 17:39:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832736834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:39:00,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210232661] [2024-11-10 17:39:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:00,945 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:39:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:02,222 INFO L93 Difference]: Finished difference Result 1980 states and 2328 transitions. [2024-11-10 17:39:02,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:02,222 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:39:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:02,230 INFO L225 Difference]: With dead ends: 1980 [2024-11-10 17:39:02,231 INFO L226 Difference]: Without dead ends: 1980 [2024-11-10 17:39:02,231 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:39:02,232 INFO L432 NwaCegarLoop]: 1541 mSDtfsCounter, 1763 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:02,233 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.2s Time] [2024-11-10 17:39:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2024-11-10 17:39:02,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1651. [2024-11-10 17:39:02,295 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:39:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 1911 transitions. [2024-11-10 17:39:02,302 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 1911 transitions. Word has length 6 [2024-11-10 17:39:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:02,303 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 1911 transitions. [2024-11-10 17:39:02,303 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:39:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1911 transitions. [2024-11-10 17:39:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:39:02,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:02,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:39:02,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:39:02,305 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:39:02,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:02,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329341, now seen corresponding path program 1 times [2024-11-10 17:39:02,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:02,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258557244] [2024-11-10 17:39:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:02,414 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:39:02,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:02,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258557244] [2024-11-10 17:39:02,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258557244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:02,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:02,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:39:02,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580064455] [2024-11-10 17:39:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:02,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:02,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:02,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:02,420 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:39:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:03,726 INFO L93 Difference]: Finished difference Result 2404 states and 2828 transitions. [2024-11-10 17:39:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:03,727 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:39:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:03,737 INFO L225 Difference]: With dead ends: 2404 [2024-11-10 17:39:03,738 INFO L226 Difference]: Without dead ends: 2404 [2024-11-10 17:39:03,740 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:39:03,742 INFO L432 NwaCegarLoop]: 1909 mSDtfsCounter, 1236 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:03,744 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.2s Time] [2024-11-10 17:39:03,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-10 17:39:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1921. [2024-11-10 17:39:03,786 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:39:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2392 transitions. [2024-11-10 17:39:03,794 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2392 transitions. Word has length 6 [2024-11-10 17:39:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:03,794 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2392 transitions. [2024-11-10 17:39:03,795 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:39:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2392 transitions. [2024-11-10 17:39:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:39:03,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:03,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:39:03,796 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:39:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1020955448, now seen corresponding path program 1 times [2024-11-10 17:39:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142813328] [2024-11-10 17:39:03,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:03,851 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:39:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142813328] [2024-11-10 17:39:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142813328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180349395] [2024-11-10 17:39:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:03,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:03,854 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:39:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:04,081 INFO L93 Difference]: Finished difference Result 3822 states and 4764 transitions. [2024-11-10 17:39:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:04,082 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:39:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:04,095 INFO L225 Difference]: With dead ends: 3822 [2024-11-10 17:39:04,095 INFO L226 Difference]: Without dead ends: 3822 [2024-11-10 17:39:04,096 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:39:04,097 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:39:04,097 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:39:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2024-11-10 17:39:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 1925. [2024-11-10 17:39:04,139 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:39:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2396 transitions. [2024-11-10 17:39:04,145 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2396 transitions. Word has length 8 [2024-11-10 17:39:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:04,146 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2396 transitions. [2024-11-10 17:39:04,146 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:39:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2396 transitions. [2024-11-10 17:39:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:39:04,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:04,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:04,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:39:04,147 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:39:04,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782018, now seen corresponding path program 1 times [2024-11-10 17:39:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224336074] [2024-11-10 17:39:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:04,255 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:39:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224336074] [2024-11-10 17:39:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224336074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334110298] [2024-11-10 17:39:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:04,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:04,258 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:39:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:05,483 INFO L93 Difference]: Finished difference Result 1951 states and 2449 transitions. [2024-11-10 17:39:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:05,484 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:39:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:05,492 INFO L225 Difference]: With dead ends: 1951 [2024-11-10 17:39:05,492 INFO L226 Difference]: Without dead ends: 1951 [2024-11-10 17:39:05,492 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:39:05,494 INFO L432 NwaCegarLoop]: 1123 mSDtfsCounter, 2031 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:05,495 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.2s Time] [2024-11-10 17:39:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-11-10 17:39:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1902. [2024-11-10 17:39:05,532 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:39:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2373 transitions. [2024-11-10 17:39:05,539 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2373 transitions. Word has length 13 [2024-11-10 17:39:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2373 transitions. [2024-11-10 17:39:05,540 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:39:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2373 transitions. [2024-11-10 17:39:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:39:05,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:05,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:05,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:39:05,545 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:39:05,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1400782017, now seen corresponding path program 1 times [2024-11-10 17:39:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:05,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980774286] [2024-11-10 17:39:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:05,647 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:39:05,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:05,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980774286] [2024-11-10 17:39:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980774286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086069776] [2024-11-10 17:39:05,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:05,649 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:39:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:05,766 INFO L93 Difference]: Finished difference Result 1827 states and 2270 transitions. [2024-11-10 17:39:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:05,766 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:39:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:05,772 INFO L225 Difference]: With dead ends: 1827 [2024-11-10 17:39:05,772 INFO L226 Difference]: Without dead ends: 1827 [2024-11-10 17:39:05,773 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:39:05,774 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:39:05,774 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:39:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-10 17:39:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2024-11-10 17:39:05,806 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:39:05,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2270 transitions. [2024-11-10 17:39:05,811 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2270 transitions. Word has length 13 [2024-11-10 17:39:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:05,812 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2270 transitions. [2024-11-10 17:39:05,812 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:39:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2270 transitions. [2024-11-10 17:39:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:39:05,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:05,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:05,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:39:05,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:39:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1826839390, now seen corresponding path program 1 times [2024-11-10 17:39:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747964243] [2024-11-10 17:39:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747964243] [2024-11-10 17:39:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747964243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:05,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670965760] [2024-11-10 17:39:05,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:05,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:05,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:05,874 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:39:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:06,065 INFO L93 Difference]: Finished difference Result 1812 states and 2248 transitions. [2024-11-10 17:39:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:06,066 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:39:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:06,073 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:39:06,073 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:39:06,073 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:39:06,074 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:06,075 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.2s Time] [2024-11-10 17:39:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:39:06,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1812. [2024-11-10 17:39:06,102 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:39:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2248 transitions. [2024-11-10 17:39:06,130 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2248 transitions. Word has length 15 [2024-11-10 17:39:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:06,131 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2248 transitions. [2024-11-10 17:39:06,131 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:39:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2248 transitions. [2024-11-10 17:39:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:39:06,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:06,132 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:39:06,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:39:06,133 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:39:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2106893528, now seen corresponding path program 1 times [2024-11-10 17:39:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573376304] [2024-11-10 17:39:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:06,300 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:39:06,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:06,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573376304] [2024-11-10 17:39:06,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573376304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:06,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:06,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288537220] [2024-11-10 17:39:06,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:06,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:06,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:06,303 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:39:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:07,861 INFO L93 Difference]: Finished difference Result 2342 states and 2758 transitions. [2024-11-10 17:39:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:07,862 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:39:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:07,870 INFO L225 Difference]: With dead ends: 2342 [2024-11-10 17:39:07,871 INFO L226 Difference]: Without dead ends: 2342 [2024-11-10 17:39:07,871 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:39:07,873 INFO L432 NwaCegarLoop]: 1405 mSDtfsCounter, 1241 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:07,873 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.5s Time] [2024-11-10 17:39:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2024-11-10 17:39:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 1808. [2024-11-10 17:39:07,912 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:39:07,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2244 transitions. [2024-11-10 17:39:07,916 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2244 transitions. Word has length 29 [2024-11-10 17:39:07,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:07,919 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2244 transitions. [2024-11-10 17:39:07,919 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:39:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2244 transitions. [2024-11-10 17:39:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:39:07,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:07,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:07,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:39:07,923 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:39:07,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1736803853, now seen corresponding path program 1 times [2024-11-10 17:39:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:07,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609083112] [2024-11-10 17:39:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:08,043 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:39:08,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609083112] [2024-11-10 17:39:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609083112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:08,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070282341] [2024-11-10 17:39:08,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:08,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:08,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:08,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:08,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:08,046 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:39:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:08,185 INFO L93 Difference]: Finished difference Result 1802 states and 2234 transitions. [2024-11-10 17:39:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:08,190 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:39:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:08,195 INFO L225 Difference]: With dead ends: 1802 [2024-11-10 17:39:08,195 INFO L226 Difference]: Without dead ends: 1802 [2024-11-10 17:39:08,195 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:39:08,196 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:39:08,196 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:39:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-10 17:39:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2024-11-10 17:39:08,221 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:39:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2234 transitions. [2024-11-10 17:39:08,224 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2234 transitions. Word has length 64 [2024-11-10 17:39:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:08,225 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2234 transitions. [2024-11-10 17:39:08,225 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:39:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2234 transitions. [2024-11-10 17:39:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 17:39:08,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:08,227 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:39:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:39:08,227 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:39:08,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -475789525, now seen corresponding path program 1 times [2024-11-10 17:39:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785689326] [2024-11-10 17:39:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:08,369 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:39:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785689326] [2024-11-10 17:39:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785689326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:08,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571985050] [2024-11-10 17:39:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:08,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:08,372 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:39:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:08,503 INFO L93 Difference]: Finished difference Result 1896 states and 2355 transitions. [2024-11-10 17:39:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:08,504 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:39:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:08,511 INFO L225 Difference]: With dead ends: 1896 [2024-11-10 17:39:08,512 INFO L226 Difference]: Without dead ends: 1896 [2024-11-10 17:39:08,512 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:39:08,512 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:39:08,513 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:39:08,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2024-11-10 17:39:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2024-11-10 17:39:08,544 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:39:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2355 transitions. [2024-11-10 17:39:08,548 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2355 transitions. Word has length 72 [2024-11-10 17:39:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:08,549 INFO L471 AbstractCegarLoop]: Abstraction has 1896 states and 2355 transitions. [2024-11-10 17:39:08,550 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:39:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2355 transitions. [2024-11-10 17:39:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:39:08,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:08,553 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:39:08,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:39:08,553 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:39:08,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash -854221678, now seen corresponding path program 1 times [2024-11-10 17:39:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062465749] [2024-11-10 17:39:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,084 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:39:09,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:09,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062465749] [2024-11-10 17:39:09,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062465749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:09,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:39:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380018313] [2024-11-10 17:39:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:09,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:39:09,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:39:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:39:09,088 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:39:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:10,281 INFO L93 Difference]: Finished difference Result 1812 states and 2271 transitions. [2024-11-10 17:39:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:10,281 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:39:10,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:10,287 INFO L225 Difference]: With dead ends: 1812 [2024-11-10 17:39:10,287 INFO L226 Difference]: Without dead ends: 1812 [2024-11-10 17:39:10,288 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:39:10,288 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:10,289 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.2s Time] [2024-11-10 17:39:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-10 17:39:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1532. [2024-11-10 17:39:10,319 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:39:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1780 transitions. [2024-11-10 17:39:10,322 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1780 transitions. Word has length 75 [2024-11-10 17:39:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1780 transitions. [2024-11-10 17:39:10,322 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:39:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1780 transitions. [2024-11-10 17:39:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:39:10,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:10,324 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:39:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:39:10,324 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:39:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879306, now seen corresponding path program 1 times [2024-11-10 17:39:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462210337] [2024-11-10 17:39:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:10,582 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:39:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462210337] [2024-11-10 17:39:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462210337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586050999] [2024-11-10 17:39:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:39:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:39:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:39:10,585 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:39:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:11,650 INFO L93 Difference]: Finished difference Result 1531 states and 1779 transitions. [2024-11-10 17:39:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:11,651 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:39:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:11,655 INFO L225 Difference]: With dead ends: 1531 [2024-11-10 17:39:11,655 INFO L226 Difference]: Without dead ends: 1531 [2024-11-10 17:39:11,656 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:39:11,656 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 2 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:11,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4664 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:39:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-11-10 17:39:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-11-10 17:39:11,676 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:39:11,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:39:11,678 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 80 [2024-11-10 17:39:11,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:11,678 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:39:11,679 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:39:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:39:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:39:11,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:11,680 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:39:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:39:11,680 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:39:11,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1472879305, now seen corresponding path program 1 times [2024-11-10 17:39:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962851510] [2024-11-10 17:39:11,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:12,184 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:39:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962851510] [2024-11-10 17:39:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962851510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:12,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868024723] [2024-11-10 17:39:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:12,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:39:12,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:12,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:39:12,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:39:12,187 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:39:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:13,494 INFO L93 Difference]: Finished difference Result 1530 states and 1778 transitions. [2024-11-10 17:39:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:13,494 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:39:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:13,498 INFO L225 Difference]: With dead ends: 1530 [2024-11-10 17:39:13,498 INFO L226 Difference]: Without dead ends: 1530 [2024-11-10 17:39:13,498 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:39:13,499 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:13,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4692 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:39:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2024-11-10 17:39:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1530. [2024-11-10 17:39:13,521 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:39:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1778 transitions. [2024-11-10 17:39:13,524 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1778 transitions. Word has length 80 [2024-11-10 17:39:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:13,525 INFO L471 AbstractCegarLoop]: Abstraction has 1530 states and 1778 transitions. [2024-11-10 17:39:13,525 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:39:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1778 transitions. [2024-11-10 17:39:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:39:13,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:13,528 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:39:13,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:39:13,529 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:39:13,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -652296333, now seen corresponding path program 1 times [2024-11-10 17:39:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:13,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959456913] [2024-11-10 17:39:13,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:13,851 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:39:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959456913] [2024-11-10 17:39:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959456913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:39:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976134657] [2024-11-10 17:39:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:13,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:39:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:39:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:13,855 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:39:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:15,437 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:39:15,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:39:15,438 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:39:15,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:15,442 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:39:15,442 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:39:15,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:39:15,443 INFO L432 NwaCegarLoop]: 1578 mSDtfsCounter, 17 mSDsluCounter, 5632 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:15,443 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.5s Time] [2024-11-10 17:39:15,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:39:15,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1536. [2024-11-10 17:39:15,461 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:39:15,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1791 transitions. [2024-11-10 17:39:15,463 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1791 transitions. Word has length 88 [2024-11-10 17:39:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:15,464 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1791 transitions. [2024-11-10 17:39:15,464 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:39:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1791 transitions. [2024-11-10 17:39:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:39:15,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:15,465 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:39:15,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:39:15,465 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:39:15,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash -652296332, now seen corresponding path program 1 times [2024-11-10 17:39:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762226679] [2024-11-10 17:39:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:15,947 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:39:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762226679] [2024-11-10 17:39:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762226679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:15,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:39:15,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096720461] [2024-11-10 17:39:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:15,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:39:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:15,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:39:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:15,950 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:39:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:17,490 INFO L93 Difference]: Finished difference Result 1536 states and 1790 transitions. [2024-11-10 17:39:17,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:17,490 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:39:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:17,494 INFO L225 Difference]: With dead ends: 1536 [2024-11-10 17:39:17,494 INFO L226 Difference]: Without dead ends: 1536 [2024-11-10 17:39:17,495 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:39:17,495 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 18 mSDsluCounter, 4414 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:17,495 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.5s Time] [2024-11-10 17:39:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-10 17:39:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2024-11-10 17:39:17,516 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:39:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1790 transitions. [2024-11-10 17:39:17,519 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1790 transitions. Word has length 88 [2024-11-10 17:39:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:17,519 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 1790 transitions. [2024-11-10 17:39:17,520 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:39:17,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1790 transitions. [2024-11-10 17:39:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:39:17,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:17,521 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:39:17,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:39:17,521 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:39:17,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:17,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1740489568, now seen corresponding path program 1 times [2024-11-10 17:39:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746754070] [2024-11-10 17:39:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:17,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:18,027 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:39:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746754070] [2024-11-10 17:39:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746754070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335711624] [2024-11-10 17:39:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:18,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:18,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:18,032 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:39:18,033 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:39:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:18,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:39:18,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:18,323 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:39:18,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:18,467 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:39:18,481 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:39:18,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:18,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:39:18,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 31 treesize of output 13 [2024-11-10 17:39:18,588 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:39:18,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:18,646 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:39:18,647 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:39:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335711624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:18,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:39:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763867814] [2024-11-10 17:39:18,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:39:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:39:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=199, Unknown=3, NotChecked=0, Total=240 [2024-11-10 17:39:18,701 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:39:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:21,777 INFO L93 Difference]: Finished difference Result 1535 states and 1789 transitions. [2024-11-10 17:39:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:21,777 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:39:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:21,781 INFO L225 Difference]: With dead ends: 1535 [2024-11-10 17:39:21,781 INFO L226 Difference]: Without dead ends: 1535 [2024-11-10 17:39:21,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=456, Unknown=3, NotChecked=0, Total=552 [2024-11-10 17:39:21,782 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1569 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 6510 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:21,782 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.9s Time] [2024-11-10 17:39:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2024-11-10 17:39:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2024-11-10 17:39:21,803 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:39:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1789 transitions. [2024-11-10 17:39:21,807 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1789 transitions. Word has length 89 [2024-11-10 17:39:21,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:21,807 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 1789 transitions. [2024-11-10 17:39:21,807 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:39:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1789 transitions. [2024-11-10 17:39:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:39:21,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:21,808 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:39:21,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:22,012 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:39:22,013 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:39:22,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1740489567, now seen corresponding path program 1 times [2024-11-10 17:39:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303405407] [2024-11-10 17:39:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:22,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:22,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:22,777 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:39:22,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303405407] [2024-11-10 17:39:22,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303405407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:22,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750396989] [2024-11-10 17:39:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:22,780 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:39:22,782 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:39:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:23,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 17:39:23,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:23,019 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:39:23,134 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:39:23,145 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:23,145 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:39:23,161 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:39:23,169 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:39:23,241 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:39:23,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:39:23,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:23,383 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:39:23,393 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:39:23,424 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:39:23,432 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:39:23,433 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:39:23,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:23,533 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_682 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_681 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:39:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750396989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:23,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-10 17:39:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442080676] [2024-11-10 17:39:23,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:39:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:39:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-10 17:39:23,538 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:39:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:27,123 INFO L93 Difference]: Finished difference Result 1542 states and 1796 transitions. [2024-11-10 17:39:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:39:27,123 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:39:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:27,126 INFO L225 Difference]: With dead ends: 1542 [2024-11-10 17:39:27,127 INFO L226 Difference]: Without dead ends: 1542 [2024-11-10 17:39:27,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-10 17:39:27,128 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1576 mSDsluCounter, 6840 mSDsCounter, 0 mSdLazyCounter, 6988 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:27,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 7862 Invalid, 7026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 6988 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 17:39:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2024-11-10 17:39:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1533. [2024-11-10 17:39:27,147 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:39:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1781 transitions. [2024-11-10 17:39:27,149 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1781 transitions. Word has length 89 [2024-11-10 17:39:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:27,149 INFO L471 AbstractCegarLoop]: Abstraction has 1533 states and 1781 transitions. [2024-11-10 17:39:27,150 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:39:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1781 transitions. [2024-11-10 17:39:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:39:27,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:27,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:27,169 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:39:27,351 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:39:27,351 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:39:27,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:27,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2126268669, now seen corresponding path program 1 times [2024-11-10 17:39:27,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31569565] [2024-11-10 17:39:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:27,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:27,865 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:39:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31569565] [2024-11-10 17:39:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31569565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:39:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153335673] [2024-11-10 17:39:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:27,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:39:27,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:27,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:39:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:39:27,868 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:39:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:31,056 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:39:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:39:31,057 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:39:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:31,060 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:39:31,060 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:39:31,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:39:31,061 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1574 mSDsluCounter, 10898 mSDsCounter, 0 mSdLazyCounter, 7864 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:31,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 11914 Invalid, 7889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7864 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 17:39:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:39:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1542. [2024-11-10 17:39:31,079 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:39:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1792 transitions. [2024-11-10 17:39:31,082 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1792 transitions. Word has length 91 [2024-11-10 17:39:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1792 transitions. [2024-11-10 17:39:31,082 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:39:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1792 transitions. [2024-11-10 17:39:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:39:31,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:31,083 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:39:31,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:39:31,084 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:39:31,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:31,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2126268668, now seen corresponding path program 1 times [2024-11-10 17:39:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793139703] [2024-11-10 17:39:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:31,779 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:39:31,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:31,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793139703] [2024-11-10 17:39:31,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793139703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:31,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:31,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:39:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844210937] [2024-11-10 17:39:31,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:31,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:39:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:39:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:39:31,783 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:39:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:35,009 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:39:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:39:35,009 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:39:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:35,012 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:39:35,012 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:39:35,012 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:39:35,013 INFO L432 NwaCegarLoop]: 1023 mSDtfsCounter, 1591 mSDsluCounter, 6848 mSDsCounter, 0 mSdLazyCounter, 6956 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:35,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 7871 Invalid, 6980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 6956 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 17:39:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:39:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:39:35,039 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:39:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:39:35,042 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 91 [2024-11-10 17:39:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:35,043 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:39:35,043 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:39:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:39:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:39:35,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:35,044 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:39:35,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:39:35,044 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:39:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2077782346, now seen corresponding path program 1 times [2024-11-10 17:39:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:35,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003742793] [2024-11-10 17:39:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:35,542 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:39:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003742793] [2024-11-10 17:39:35,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003742793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760516862] [2024-11-10 17:39:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:35,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:35,545 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:39:35,547 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:39:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:35,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:39:35,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:35,809 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:39:35,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:35,906 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:39:35,914 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:39:36,009 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:36,010 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:39:36,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:36,070 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:39:36,083 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:39:36,085 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:39:36,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:36,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_945) |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:39:36,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_945) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:39:36,145 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:39:36,146 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:39:36,153 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_948 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_948))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_945)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-10 17:39:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760516862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:36,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:36,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2024-11-10 17:39:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993422736] [2024-11-10 17:39:36,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:36,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:39:36,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:36,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:39:36,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=259, Unknown=3, NotChecked=102, Total=420 [2024-11-10 17:39:36,158 INFO L87 Difference]: Start difference. First operand 1542 states and 1791 transitions. Second operand has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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:39:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:38,651 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:39:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:38,652 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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 92 [2024-11-10 17:39:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:38,655 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:39:38,655 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:39:38,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=546, Unknown=3, NotChecked=150, Total=812 [2024-11-10 17:39:38,656 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 1571 mSDsluCounter, 7948 mSDsCounter, 0 mSdLazyCounter, 5887 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 8964 SdHoareTripleChecker+Invalid, 5924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 5887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:38,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 8964 Invalid, 5924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 5887 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:39:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:39:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1541. [2024-11-10 17:39:38,673 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:39:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 1790 transitions. [2024-11-10 17:39:38,676 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 1790 transitions. Word has length 92 [2024-11-10 17:39:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:38,676 INFO L471 AbstractCegarLoop]: Abstraction has 1541 states and 1790 transitions. [2024-11-10 17:39:38,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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:39:38,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 1790 transitions. [2024-11-10 17:39:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:39:38,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:38,678 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:39:38,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 17:39:38,881 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:39:38,882 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:39:38,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2077782345, now seen corresponding path program 1 times [2024-11-10 17:39:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:38,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385513057] [2024-11-10 17:39:38,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:39,658 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:39:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385513057] [2024-11-10 17:39:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385513057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:39,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443930511] [2024-11-10 17:39:39,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:39,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:39,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:39,661 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:39:39,663 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:39:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:39,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:39:39,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:39,927 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:39:40,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:40,018 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:39:40,028 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:39:40,040 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:39:40,043 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:39:40,084 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:39:40,089 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:39:40,182 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:40,183 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:39:40,192 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:39:40,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:40,244 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:39:40,250 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:39:40,266 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:39:40,270 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:39:40,274 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:39:40,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:40,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1095 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:39:40,339 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1095 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:39:40,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1094 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1101))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1100) .cse0 v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1095 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1100) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1095) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-10 17:39:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443930511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:40,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-10 17:39:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487798872] [2024-11-10 17:39:40,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:40,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:39:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:39:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=293, Unknown=3, NotChecked=108, Total=462 [2024-11-10 17:39:40,392 INFO L87 Difference]: Start difference. First operand 1541 states and 1790 transitions. Second operand has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 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:39:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:45,149 INFO L93 Difference]: Finished difference Result 1543 states and 1797 transitions. [2024-11-10 17:39:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:45,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-10 17:39:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:45,152 INFO L225 Difference]: With dead ends: 1543 [2024-11-10 17:39:45,152 INFO L226 Difference]: Without dead ends: 1543 [2024-11-10 17:39:45,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=599, Unknown=3, NotChecked=156, Total=870 [2024-11-10 17:39:45,153 INFO L432 NwaCegarLoop]: 1014 mSDtfsCounter, 1567 mSDsluCounter, 8114 mSDsCounter, 0 mSdLazyCounter, 8996 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 9128 SdHoareTripleChecker+Invalid, 9025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 8996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:45,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 9128 Invalid, 9025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 8996 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 17:39:45,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-11-10 17:39:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1531. [2024-11-10 17:39:45,183 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:39:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1779 transitions. [2024-11-10 17:39:45,185 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1779 transitions. Word has length 92 [2024-11-10 17:39:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:45,186 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1779 transitions. [2024-11-10 17:39:45,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 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:39:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1779 transitions. [2024-11-10 17:39:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:39:45,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:45,187 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:39:45,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 17:39:45,387 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:39:45,387 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:39:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1490503092, now seen corresponding path program 1 times [2024-11-10 17:39:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943323352] [2024-11-10 17:39:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:45,984 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:39:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:45,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943323352] [2024-11-10 17:39:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943323352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:45,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:39:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11502779] [2024-11-10 17:39:45,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:45,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:39:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:39:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:39:45,988 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:39:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:48,557 INFO L93 Difference]: Finished difference Result 1547 states and 1801 transitions. [2024-11-10 17:39:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:48,557 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:39:48,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:48,560 INFO L225 Difference]: With dead ends: 1547 [2024-11-10 17:39:48,560 INFO L226 Difference]: Without dead ends: 1547 [2024-11-10 17:39:48,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-10 17:39:48,561 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1598 mSDsluCounter, 7942 mSDsCounter, 0 mSdLazyCounter, 5903 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 8957 SdHoareTripleChecker+Invalid, 5929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:48,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 8957 Invalid, 5929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5903 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:39:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-11-10 17:39:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1543. [2024-11-10 17:39:48,579 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:39:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1793 transitions. [2024-11-10 17:39:48,582 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1793 transitions. Word has length 94 [2024-11-10 17:39:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:48,583 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1793 transitions. [2024-11-10 17:39:48,583 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:39:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1793 transitions. [2024-11-10 17:39:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:39:48,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:48,584 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:39:48,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:39:48,584 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:39:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1490503091, now seen corresponding path program 1 times [2024-11-10 17:39:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585957757] [2024-11-10 17:39:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:49,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:49,487 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:39:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585957757] [2024-11-10 17:39:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585957757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:39:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792312114] [2024-11-10 17:39:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:49,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:39:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:39:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:39:49,491 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:39:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:53,254 INFO L93 Difference]: Finished difference Result 1546 states and 1800 transitions. [2024-11-10 17:39:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:39:53,254 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:39:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:53,257 INFO L225 Difference]: With dead ends: 1546 [2024-11-10 17:39:53,257 INFO L226 Difference]: Without dead ends: 1546 [2024-11-10 17:39:53,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:39:53,258 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 1573 mSDsluCounter, 8581 mSDsCounter, 0 mSdLazyCounter, 8477 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 9603 SdHoareTripleChecker+Invalid, 8501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 8477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:53,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 9603 Invalid, 8501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 8477 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 17:39:53,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-11-10 17:39:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1543. [2024-11-10 17:39:53,276 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:39:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1792 transitions. [2024-11-10 17:39:53,279 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1792 transitions. Word has length 94 [2024-11-10 17:39:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:53,279 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 1792 transitions. [2024-11-10 17:39:53,279 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:39:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1792 transitions. [2024-11-10 17:39:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:39:53,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:53,281 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:39:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:39:53,281 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:39:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash -143466055, now seen corresponding path program 1 times [2024-11-10 17:39:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710638637] [2024-11-10 17:39:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:53,893 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:39:53,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710638637] [2024-11-10 17:39:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710638637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880543537] [2024-11-10 17:39:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:53,895 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:39:53,896 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:39:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:54,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:39:54,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:54,155 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:39:54,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:54,241 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:39:54,250 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:39:54,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,326 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:39:54,375 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,376 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:39:54,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,417 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:39:54,426 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:39:54,428 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:39:54,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:54,440 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1389) |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:39:54,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1389) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:39:54,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1388 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1388))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1389)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:39:54,521 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:39:54,522 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:39:54,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1389 (Array Int Int)) (v_ArrVal_1388 (Array Int Int)) (v_ArrVal_1392 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1392))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1388)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1389)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-10 17:39:54,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880543537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:54,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:54,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:39:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412665641] [2024-11-10 17:39:54,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:54,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:39:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:39:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=357, Unknown=7, NotChecked=164, Total=600 [2024-11-10 17:39:54,532 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:39:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:58,211 INFO L93 Difference]: Finished difference Result 1545 states and 1799 transitions. [2024-11-10 17:39:58,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:39:58,212 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:39:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:58,214 INFO L225 Difference]: With dead ends: 1545 [2024-11-10 17:39:58,214 INFO L226 Difference]: Without dead ends: 1545 [2024-11-10 17:39:58,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=735, Unknown=7, NotChecked=236, Total=1122 [2024-11-10 17:39:58,215 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 1565 mSDsluCounter, 12896 mSDsCounter, 0 mSdLazyCounter, 9122 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 13911 SdHoareTripleChecker+Invalid, 9160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 9122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:58,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 13911 Invalid, 9160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 9122 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-10 17:39:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-10 17:39:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1542. [2024-11-10 17:39:58,232 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:39:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 1791 transitions. [2024-11-10 17:39:58,234 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 1791 transitions. Word has length 95 [2024-11-10 17:39:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:58,234 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 1791 transitions. [2024-11-10 17:39:58,235 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:39:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1791 transitions. [2024-11-10 17:39:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:39:58,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:58,236 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:39:58,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 17:39:58,437 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:39:58,437 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:39:58,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -143466054, now seen corresponding path program 1 times [2024-11-10 17:39:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304465715] [2024-11-10 17:39:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:59,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:59,334 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:39:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304465715] [2024-11-10 17:39:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304465715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415824681] [2024-11-10 17:39:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:59,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:59,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:59,337 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:39:59,339 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:39:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:59,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 17:39:59,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:59,628 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:39:59,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:59,727 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:39:59,734 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:39:59,743 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:39:59,753 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:39:59,801 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:39:59,805 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:39:59,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:59,909 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:39:59,918 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:39:59,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:59,974 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:39:59,982 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:40:00,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:40:00,033 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:40:00,038 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:40:00,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:40:00,053 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:40:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:00,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:00,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1553 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-10 17:40:00,184 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1551) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1550))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1551) .cse1 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:40:00,197 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1550))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) .cse1 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1551) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-10 17:40:00,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1558))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1559) .cse0 v_ArrVal_1551) (select (select (store .cse1 .cse0 v_ArrVal_1550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1553))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1558))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1550))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1559) .cse3 v_ArrVal_1551) .cse4 v_ArrVal_1553) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:40:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415824681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:40:00,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2024-11-10 17:40:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77364471] [2024-11-10 17:40:00,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:00,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:40:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:00,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:40:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=385, Unknown=15, NotChecked=172, Total=650 [2024-11-10 17:40:00,258 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:40:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:05,535 INFO L93 Difference]: Finished difference Result 1544 states and 1798 transitions. [2024-11-10 17:40:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:40:05,536 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:40:05,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:05,538 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:40:05,539 INFO L226 Difference]: Without dead ends: 1544 [2024-11-10 17:40:05,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=783, Unknown=17, NotChecked=244, Total=1190 [2024-11-10 17:40:05,540 INFO L432 NwaCegarLoop]: 1013 mSDtfsCounter, 1565 mSDsluCounter, 8882 mSDsCounter, 0 mSdLazyCounter, 9852 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 9895 SdHoareTripleChecker+Invalid, 9881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:05,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 9895 Invalid, 9881 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 9852 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-10 17:40:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2024-11-10 17:40:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1529. [2024-11-10 17:40:05,556 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:40:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 1777 transitions. [2024-11-10 17:40:05,558 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 1777 transitions. Word has length 95 [2024-11-10 17:40:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 1777 transitions. [2024-11-10 17:40:05,559 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:40:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1777 transitions. [2024-11-10 17:40:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:40:05,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:05,560 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:40:05,581 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:40:05,761 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:40:05,762 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:40:05,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2090986300, now seen corresponding path program 1 times [2024-11-10 17:40:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:05,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466045134] [2024-11-10 17:40:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:40:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:06,424 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:40:06,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:06,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466045134] [2024-11-10 17:40:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466045134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:40:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75837984] [2024-11-10 17:40:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:40:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:40:06,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:40:06,426 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)