./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/packet_filter.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:00:46,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:00:46,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:00:46,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:00:46,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:00:46,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:00:46,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:00:46,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:00:46,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:00:46,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:00:46,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:00:46,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:00:46,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:00:46,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:00:46,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:00:46,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:00:46,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:00:46,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:00:46,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:00:46,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:00:46,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:00:46,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:00:46,802 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:00:46,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:00:46,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:00:46,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:00:46,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:00:46,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:00:46,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:00:46,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:00:46,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:00:46,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:00:46,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:00:46,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:00:46,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:00:46,805 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:00:46,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:00:46,805 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 ! call(reach_error())) ) 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 -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2024-11-09 22:00:47,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:00:47,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:00:47,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:00:47,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:00:47,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:00:47,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2024-11-09 22:00:48,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:00:48,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:00:48,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-09 22:00:48,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e41e4998/67ffdc3139044da0ac874b9d07972d77/FLAG2f0238e15 [2024-11-09 22:00:48,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e41e4998/67ffdc3139044da0ac874b9d07972d77 [2024-11-09 22:00:48,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:00:48,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:00:48,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:00:48,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:00:48,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:00:48,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:48" (1/1) ... [2024-11-09 22:00:48,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5ebe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:48, skipping insertion in model container [2024-11-09 22:00:48,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:00:48" (1/1) ... [2024-11-09 22:00:48,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:00:49,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2024-11-09 22:00:49,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2024-11-09 22:00:49,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:00:49,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:00:49,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[23925,23938] [2024-11-09 22:00:49,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i[24159,24172] [2024-11-09 22:00:49,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:00:49,212 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:00:49,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49 WrapperNode [2024-11-09 22:00:49,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:00:49,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:00:49,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:00:49,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:00:49,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,255 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2024-11-09 22:00:49,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:00:49,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:00:49,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:00:49,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:00:49,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,282 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 6, 6, 6, 16, 15, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 2, 0, 0, 3, 0]. The 14 writes are split as follows [0, 3, 1, 3, 4, 0, 3]. [2024-11-09 22:00:49,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,308 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:00:49,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:00:49,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:00:49,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:00:49,325 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (1/1) ... [2024-11-09 22:00:49,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:00:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:00:49,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 22:00:49,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 22:00:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 22:00:49,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:00:49,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-11-09 22:00:49,408 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 22:00:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 22:00:49,409 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-11-09 22:00:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:00:49,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 22:00:49,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:00:49,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:00:49,541 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:00:49,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:00:49,751 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L587: havoc receive_#t~mem6#1;havoc receive_#t~mem7#1;havoc receive_#t~mem8#1.base, receive_#t~mem8#1.offset;call ULTIMATE.dealloc(receive_~#packet~0#1.base, receive_~#packet~0#1.offset);havoc receive_~#packet~0#1.base, receive_~#packet~0#1.offset; [2024-11-09 22:00:49,751 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: call ULTIMATE.dealloc(main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset);havoc main_~#prio_queue~0#1.base, main_~#prio_queue~0#1.offset;call ULTIMATE.dealloc(main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset);havoc main_~#normal_queue~0#1.base, main_~#normal_queue~0#1.offset; [2024-11-09 22:00:49,781 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-09 22:00:49,781 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:00:49,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:00:49,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:00:49,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:00:49 BoogieIcfgContainer [2024-11-09 22:00:49,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:00:49,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:00:49,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:00:49,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:00:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:00:48" (1/3) ... [2024-11-09 22:00:49,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a36b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:00:49, skipping insertion in model container [2024-11-09 22:00:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:00:49" (2/3) ... [2024-11-09 22:00:49,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a36b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:00:49, skipping insertion in model container [2024-11-09 22:00:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:00:49" (3/3) ... [2024-11-09 22:00:49,796 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-11-09 22:00:49,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:00:49,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 22:00:49,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:00:49,864 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=LoopHeads, 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;@36ac6a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:00:49,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 22:00:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:49,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 22:00:49,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:49,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:49,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:49,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -557090537, now seen corresponding path program 1 times [2024-11-09 22:00:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:49,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961785392] [2024-11-09 22:00:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:49,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961785392] [2024-11-09 22:00:50,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961785392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:00:50,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:00:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:00:50,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732410645] [2024-11-09 22:00:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:00:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:00:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:00:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:00:50,061 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 39 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:00:50,079 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-09 22:00:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:00:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 22:00:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:00:50,086 INFO L225 Difference]: With dead ends: 76 [2024-11-09 22:00:50,086 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 22:00:50,089 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-09 22:00:50,093 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:00:50,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:00:50,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 22:00:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 22:00:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-09 22:00:50,128 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 9 [2024-11-09 22:00:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:00:50,129 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-09 22:00:50,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-09 22:00:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 22:00:50,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:50,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:00:50,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:50,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1315749333, now seen corresponding path program 1 times [2024-11-09 22:00:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:50,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180463095] [2024-11-09 22:00:50,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:50,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180463095] [2024-11-09 22:00:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180463095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:00:50,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:00:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:00:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612954077] [2024-11-09 22:00:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:00:50,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:00:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:00:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:00:50,357 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:00:50,418 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2024-11-09 22:00:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:00:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 22:00:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:00:50,420 INFO L225 Difference]: With dead ends: 78 [2024-11-09 22:00:50,420 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 22:00:50,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:00:50,422 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:00:50,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:00:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 22:00:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-11-09 22:00:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 42 states have internal predecessors, (52), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-09 22:00:50,431 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 10 [2024-11-09 22:00:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:00:50,431 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 22:00:50,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-11-09 22:00:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 22:00:50,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:50,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:50,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:00:50,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 674412744, now seen corresponding path program 1 times [2024-11-09 22:00:50,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:50,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311028679] [2024-11-09 22:00:50,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311028679] [2024-11-09 22:00:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311028679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:00:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:00:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:00:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648979613] [2024-11-09 22:00:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:00:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:00:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:00:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:00:50,522 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:00:50,593 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2024-11-09 22:00:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:00:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 22:00:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:00:50,594 INFO L225 Difference]: With dead ends: 71 [2024-11-09 22:00:50,594 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 22:00:50,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:00:50,595 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:00:50,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:00:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 22:00:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-09 22:00:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-09 22:00:50,607 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 14 [2024-11-09 22:00:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:00:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-09 22:00:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:00:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-09 22:00:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 22:00:50,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:50,609 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:50,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:00:50,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:50,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1527176156, now seen corresponding path program 1 times [2024-11-09 22:00:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:50,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831298215] [2024-11-09 22:00:50,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:50,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:00:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831298215] [2024-11-09 22:00:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831298215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:00:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:00:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:00:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302128008] [2024-11-09 22:00:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:00:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:00:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:00:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:00:51,972 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:00:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:00:52,614 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-11-09 22:00:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 22:00:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 21 [2024-11-09 22:00:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:00:52,616 INFO L225 Difference]: With dead ends: 92 [2024-11-09 22:00:52,616 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 22:00:52,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:00:52,617 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:00:52,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 323 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 22:00:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 22:00:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2024-11-09 22:00:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 49 states have internal predecessors, (61), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2024-11-09 22:00:52,624 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 21 [2024-11-09 22:00:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:00:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2024-11-09 22:00:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:00:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2024-11-09 22:00:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 22:00:52,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:52,625 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:00:52,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1598749334, now seen corresponding path program 1 times [2024-11-09 22:00:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240355568] [2024-11-09 22:00:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:53,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:00:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240355568] [2024-11-09 22:00:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240355568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:00:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:00:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:00:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197925933] [2024-11-09 22:00:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:00:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:00:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:00:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:00:53,339 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:00:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:00:53,729 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2024-11-09 22:00:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:00:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 22 [2024-11-09 22:00:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:00:53,733 INFO L225 Difference]: With dead ends: 78 [2024-11-09 22:00:53,733 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 22:00:53,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:00:53,734 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:00:53,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 355 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:00:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 22:00:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2024-11-09 22:00:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 58 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 22:00:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-11-09 22:00:53,750 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 22 [2024-11-09 22:00:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:00:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-11-09 22:00:53,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:00:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-11-09 22:00:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 22:00:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:00:53,752 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:00:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:00:53,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:00:53,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:00:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2024312906, now seen corresponding path program 1 times [2024-11-09 22:00:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:00:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110113110] [2024-11-09 22:00:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:00:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:00:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:54,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:00:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110113110] [2024-11-09 22:00:54,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110113110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:00:54,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806916952] [2024-11-09 22:00:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:00:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:00:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:00:54,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:00:54,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 22:00:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:00:54,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 22:00:54,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:00:54,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 22:00:58,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from false [2024-11-09 22:00:58,459 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse2 .cse3) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse2 (select |c_#memory_$Pointer$#2.offset| .cse2)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse3))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4)))))))) is different from true [2024-11-09 22:00:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:00:58,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:00:58,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806916952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:00:58,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:00:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2024-11-09 22:00:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077058737] [2024-11-09 22:00:58,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:00:58,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:00:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:00:58,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:00:58,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=48, Unknown=6, NotChecked=14, Total=90 [2024-11-09 22:00:58,605 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:01:02,704 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from false [2024-11-09 22:01:02,712 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (and (or .cse0 (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (not (= .cse1 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))))))) .cse2) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#2.offset|))) (and (= .cse3 .cse4) (= (select (select |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_#memory_$Pointer$#2.offset| (store |v_#memory_$Pointer$#2.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3)))))) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse4 (select |c_#memory_$Pointer$#2.base| .cse4)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse4))))) (and .cse0 (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| .cse5 (select |c_#memory_$Pointer$#2.base| .cse5)) |c_#memory_$Pointer$#2.base|) (= 0 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_1| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| .cse5))))))) .cse2)) is different from true [2024-11-09 22:01:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:02,788 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2024-11-09 22:01:02,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:01:02,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2024-11-09 22:01:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:02,789 INFO L225 Difference]: With dead ends: 109 [2024-11-09 22:01:02,789 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 22:01:02,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=8, NotChecked=30, Total=110 [2024-11-09 22:01:02,793 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 16 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:02,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 212 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 70 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2024-11-09 22:01:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 22:01:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2024-11-09 22:01:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 69 states have internal predecessors, (89), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:01:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-09 22:01:02,801 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 22 [2024-11-09 22:01:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:02,802 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-09 22:01:02,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:01:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-09 22:01:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 22:01:02,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:02,803 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:02,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 22:01:03,007 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,SelfDestructingSolverStorable5 [2024-11-09 22:01:03,008 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -92971113, now seen corresponding path program 1 times [2024-11-09 22:01:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335917444] [2024-11-09 22:01:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:01:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:03,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335917444] [2024-11-09 22:01:03,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335917444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:03,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:03,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:01:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481330713] [2024-11-09 22:01:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:01:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:01:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:01:03,247 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:03,457 INFO L93 Difference]: Finished difference Result 102 states and 132 transitions. [2024-11-09 22:01:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:01:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 25 [2024-11-09 22:01:03,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:03,458 INFO L225 Difference]: With dead ends: 102 [2024-11-09 22:01:03,458 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 22:01:03,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:01:03,459 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:03,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 226 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:01:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 22:01:03,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-09 22:01:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:01:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2024-11-09 22:01:03,473 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 25 [2024-11-09 22:01:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:03,473 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2024-11-09 22:01:03,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2024-11-09 22:01:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:01:03,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:03,475 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:03,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:01:03,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:03,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1386629309, now seen corresponding path program 1 times [2024-11-09 22:01:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:03,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401880445] [2024-11-09 22:01:03,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:03,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:01:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401880445] [2024-11-09 22:01:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401880445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 22:01:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428267711] [2024-11-09 22:01:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:01:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:04,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:01:04,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:01:04,037 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:04,368 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2024-11-09 22:01:04,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:01:04,369 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 26 [2024-11-09 22:01:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:04,370 INFO L225 Difference]: With dead ends: 107 [2024-11-09 22:01:04,370 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 22:01:04,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:01:04,371 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 23 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:04,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 410 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:01:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 22:01:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2024-11-09 22:01:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 82 states have internal predecessors, (104), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:01:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 118 transitions. [2024-11-09 22:01:04,377 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 118 transitions. Word has length 26 [2024-11-09 22:01:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:04,378 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 118 transitions. [2024-11-09 22:01:04,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2024-11-09 22:01:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:01:04,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:04,378 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:01:04,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1386630270, now seen corresponding path program 1 times [2024-11-09 22:01:04,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:04,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637953935] [2024-11-09 22:01:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:01:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:05,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637953935] [2024-11-09 22:01:05,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637953935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:01:05,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:01:05,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 22:01:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947438227] [2024-11-09 22:01:05,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:01:05,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:01:05,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:01:05,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:01:05,166 INFO L87 Difference]: Start difference. First operand 92 states and 118 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:06,063 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2024-11-09 22:01:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 22:01:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 26 [2024-11-09 22:01:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:06,065 INFO L225 Difference]: With dead ends: 119 [2024-11-09 22:01:06,065 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 22:01:06,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-09 22:01:06,066 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:06,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 423 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:01:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 22:01:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-11-09 22:01:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:01:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2024-11-09 22:01:06,084 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 26 [2024-11-09 22:01:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:06,085 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2024-11-09 22:01:06,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:01:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2024-11-09 22:01:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 22:01:06,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:06,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:06,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 22:01:06,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1156709865, now seen corresponding path program 1 times [2024-11-09 22:01:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518173667] [2024-11-09 22:01:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:01:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:01:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518173667] [2024-11-09 22:01:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518173667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300378106] [2024-11-09 22:01:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:06,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:06,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:06,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:06,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 22:01:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:06,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 22:01:06,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:06,988 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 34 treesize of output 15 [2024-11-09 22:01:06,995 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 30 treesize of output 31 [2024-11-09 22:01:07,001 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 15 treesize of output 11 [2024-11-09 22:01:07,039 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:01:07,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 22:01:07,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-09 22:01:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:07,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300378106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:01:07,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:01:07,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 16 [2024-11-09 22:01:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914650418] [2024-11-09 22:01:07,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:07,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 22:01:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:07,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 22:01:07,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:01:07,430 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:01:08,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:08,297 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2024-11-09 22:01:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:01:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-11-09 22:01:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:08,299 INFO L225 Difference]: With dead ends: 165 [2024-11-09 22:01:08,299 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 22:01:08,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:01:08,299 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:08,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 431 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:01:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 22:01:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2024-11-09 22:01:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.25) internal successors, (145), 117 states have internal predecessors, (145), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 22:01:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2024-11-09 22:01:08,309 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 31 [2024-11-09 22:01:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:08,309 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2024-11-09 22:01:08,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:01:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2024-11-09 22:01:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 22:01:08,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:08,310 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:08,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:01:08,510 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,SelfDestructingSolverStorable9 [2024-11-09 22:01:08,511 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:08,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 742062105, now seen corresponding path program 1 times [2024-11-09 22:01:08,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:08,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107499444] [2024-11-09 22:01:08,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:09,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:01:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 22:01:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:01:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107499444] [2024-11-09 22:01:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107499444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522462149] [2024-11-09 22:01:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:09,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:09,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:09,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:09,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 22:01:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:10,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-09 22:01:10,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:10,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 22:01:10,307 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-09 22:01:10,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2024-11-09 22:01:10,331 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 46 treesize of output 36 [2024-11-09 22:01:10,366 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:01:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2024-11-09 22:01:10,499 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 40 treesize of output 16 [2024-11-09 22:01:10,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 15 [2024-11-09 22:01:10,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:10,552 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 15 treesize of output 9 [2024-11-09 22:01:10,556 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 15 treesize of output 1 [2024-11-09 22:01:10,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:01:10,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:10,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-09 22:01:10,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:10,708 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 22:01:10,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 27 [2024-11-09 22:01:10,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:10,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 22:01:10,885 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-09 22:01:10,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2024-11-09 22:01:10,894 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 36 treesize of output 27 [2024-11-09 22:01:10,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 22:01:10,908 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 19 treesize of output 18 [2024-11-09 22:01:10,985 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 19 treesize of output 11 [2024-11-09 22:01:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:11,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522462149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:11,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:01:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2024-11-09 22:01:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390085661] [2024-11-09 22:01:11,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 22:01:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 22:01:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-09 22:01:11,239 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 27 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:01:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:13,288 INFO L93 Difference]: Finished difference Result 215 states and 278 transitions. [2024-11-09 22:01:13,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 22:01:13,289 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2024-11-09 22:01:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:13,290 INFO L225 Difference]: With dead ends: 215 [2024-11-09 22:01:13,290 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 22:01:13,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=367, Invalid=2083, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 22:01:13,291 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:13,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 696 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 22:01:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 22:01:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 145. [2024-11-09 22:01:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.265625) internal successors, (162), 129 states have internal predecessors, (162), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 22:01:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2024-11-09 22:01:13,307 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 33 [2024-11-09 22:01:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:13,307 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2024-11-09 22:01:13,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.12) internal successors, (53), 25 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:01:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2024-11-09 22:01:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:01:13,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:13,309 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:13,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 22:01:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:13,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -939450273, now seen corresponding path program 1 times [2024-11-09 22:01:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696949191] [2024-11-09 22:01:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:01:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:01:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:01:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696949191] [2024-11-09 22:01:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696949191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214789140] [2024-11-09 22:01:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:14,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:14,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 22:01:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:15,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-09 22:01:15,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:15,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 22:01:15,471 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 17 treesize of output 9 [2024-11-09 22:01:15,510 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2024-11-09 22:01:15,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:15,524 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 15 treesize of output 9 [2024-11-09 22:01:15,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 11 [2024-11-09 22:01:15,538 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 15 treesize of output 1 [2024-11-09 22:01:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:01:15,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:15,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-09 22:01:15,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:15,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:15,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2024-11-09 22:01:15,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 22:01:15,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2024-11-09 22:01:15,938 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2024-11-09 22:01:15,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 42 [2024-11-09 22:01:15,945 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 38 treesize of output 29 [2024-11-09 22:01:15,950 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 23 treesize of output 11 [2024-11-09 22:01:15,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-09 22:01:16,052 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 21 treesize of output 13 [2024-11-09 22:01:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:16,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214789140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:16,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:01:16,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2024-11-09 22:01:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258159089] [2024-11-09 22:01:16,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:16,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 22:01:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 22:01:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2024-11-09 22:01:16,341 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:01:20,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:01:24,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:01:29,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:01:33,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 22:01:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:34,624 INFO L93 Difference]: Finished difference Result 192 states and 257 transitions. [2024-11-09 22:01:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 22:01:34,625 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 34 [2024-11-09 22:01:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:34,626 INFO L225 Difference]: With dead ends: 192 [2024-11-09 22:01:34,626 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 22:01:34,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=489, Invalid=2703, Unknown=0, NotChecked=0, Total=3192 [2024-11-09 22:01:34,627 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:34,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 689 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1349 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2024-11-09 22:01:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 22:01:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2024-11-09 22:01:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2857142857142858) internal successors, (180), 141 states have internal predecessors, (180), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 22:01:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2024-11-09 22:01:34,641 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 34 [2024-11-09 22:01:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2024-11-09 22:01:34,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 22:01:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2024-11-09 22:01:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 22:01:34,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:34,642 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:34,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:01:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:34,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:34,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1617208513, now seen corresponding path program 2 times [2024-11-09 22:01:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101252780] [2024-11-09 22:01:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:35,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:01:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:01:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 22:01:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:35,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101252780] [2024-11-09 22:01:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101252780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114268480] [2024-11-09 22:01:35,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:01:35,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:35,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:35,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:35,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:01:35,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:01:35,578 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:01:35,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-09 22:01:35,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:35,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 22:01:39,695 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from false [2024-11-09 22:01:39,698 WARN L873 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse0))))) (or (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| .cse1 (select |c_#memory_$Pointer$#2.offset| .cse1))) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse1) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from true [2024-11-09 22:01:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2024-11-09 22:01:39,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:39,848 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2275 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2276 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2024-11-09 22:01:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114268480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:39,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:01:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2024-11-09 22:01:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362925833] [2024-11-09 22:01:39,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:39,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:01:39,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:39,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:01:39,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=40, Unknown=3, NotChecked=26, Total=90 [2024-11-09 22:01:39,850 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:01:39,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse1 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1 (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse3) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))))) is different from false [2024-11-09 22:01:39,954 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (.cse0 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (and .cse0 (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or .cse1 (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_11| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_#memory_$Pointer$#2.base|))) (and (= |c_#memory_$Pointer$#2.base| (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| .cse2 (select |c_#memory_$Pointer$#2.base| .cse2))) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse2))))) .cse1 (or .cse0 (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_#memory_$Pointer$#2.offset|))) (and (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| .cse3 (select |c_#memory_$Pointer$#2.offset| .cse3))) (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| .cse3) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_7| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))))) is different from true [2024-11-09 22:01:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:40,030 INFO L93 Difference]: Finished difference Result 200 states and 260 transitions. [2024-11-09 22:01:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:01:40,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-09 22:01:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:40,033 INFO L225 Difference]: With dead ends: 200 [2024-11-09 22:01:40,033 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 22:01:40,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=23, Invalid=40, Unknown=5, NotChecked=42, Total=110 [2024-11-09 22:01:40,034 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:40,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 77 Unchecked, 0.2s Time] [2024-11-09 22:01:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 22:01:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 160. [2024-11-09 22:01:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 142 states have (on average 1.295774647887324) internal successors, (184), 143 states have internal predecessors, (184), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 22:01:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2024-11-09 22:01:40,049 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 34 [2024-11-09 22:01:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:40,050 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2024-11-09 22:01:40,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:01:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2024-11-09 22:01:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 22:01:40,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:40,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:40,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 22:01:40,251 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,SelfDestructingSolverStorable12 [2024-11-09 22:01:40,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -617492772, now seen corresponding path program 1 times [2024-11-09 22:01:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120621182] [2024-11-09 22:01:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:40,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:01:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:40,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:01:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:01:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120621182] [2024-11-09 22:01:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120621182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374271776] [2024-11-09 22:01:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:40,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:40,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:40,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:40,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:01:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:40,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 22:01:40,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:40,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 22:01:44,880 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from false [2024-11-09 22:01:44,883 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))) (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) is different from true [2024-11-09 22:01:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 22:01:44,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:45,050 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2529 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_2529) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2530 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base| v_ArrVal_2530) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2024-11-09 22:01:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374271776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:45,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:01:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2024-11-09 22:01:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402526010] [2024-11-09 22:01:45,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:45,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:01:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:01:45,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=68, Unknown=3, NotChecked=34, Total=132 [2024-11-09 22:01:45,052 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:01:45,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))) .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse1)) is different from false [2024-11-09 22:01:45,231 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#2.base_BEFORE_CALL_15| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_#memory_$Pointer$#2.base|))) (and (= (store |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| .cse0 (select |c_#memory_$Pointer$#2.base| .cse0)) |c_#memory_$Pointer$#2.base|) (= (select (select |v_#memory_$Pointer$#2.base_BEFORE_CALL_15| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|))))) .cse1) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) .cse1)) is different from true [2024-11-09 22:01:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:45,385 INFO L93 Difference]: Finished difference Result 246 states and 318 transitions. [2024-11-09 22:01:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:01:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-11-09 22:01:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:45,386 INFO L225 Difference]: With dead ends: 246 [2024-11-09 22:01:45,386 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 22:01:45,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=53, Invalid=136, Unknown=5, NotChecked=78, Total=272 [2024-11-09 22:01:45,387 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 60 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:45,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 84 Invalid, 0 Unknown, 129 Unchecked, 0.2s Time] [2024-11-09 22:01:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 22:01:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-11-09 22:01:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 151 states have internal predecessors, (196), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 22:01:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 224 transitions. [2024-11-09 22:01:45,405 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 224 transitions. Word has length 35 [2024-11-09 22:01:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:45,405 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 224 transitions. [2024-11-09 22:01:45,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 22:01:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 224 transitions. [2024-11-09 22:01:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 22:01:45,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:45,406 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:45,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:01:45,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:45,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:45,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:45,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1163176353, now seen corresponding path program 1 times [2024-11-09 22:01:45,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:45,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044318943] [2024-11-09 22:01:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:01:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 22:01:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044318943] [2024-11-09 22:01:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044318943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024893185] [2024-11-09 22:01:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:46,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:46,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:01:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:46,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 22:01:46,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:46,494 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 30 treesize of output 31 [2024-11-09 22:01:46,498 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 30 treesize of output 31 [2024-11-09 22:01:46,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:01:46,506 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 15 treesize of output 11 [2024-11-09 22:01:46,514 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_append_to_queue_~q.offset_51 Int)) (let ((.cse1 (select |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base|)) (.cse2 (select |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_51))) (and (= (select (select |c_#memory_$Pointer$#4.base| .cse0) 12) (select .cse1 v_append_to_queue_~q.offset_51)) (= |c_#memory_$Pointer$#2.base| (store |c_old(#memory_$Pointer$#2.base)| |c_append_to_queue_#in~q.base| (store .cse1 v_append_to_queue_~q.offset_51 .cse0))) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |c_append_to_queue_#in~q.base| (store .cse2 v_append_to_queue_~q.offset_51 0))) (= (select .cse2 v_append_to_queue_~q.offset_51) (select (select |c_#memory_$Pointer$#4.offset| .cse0) 12))))) is different from true [2024-11-09 22:01:46,547 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2024-11-09 22:01:46,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 37 [2024-11-09 22:01:46,571 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-11-09 22:01:46,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-11-09 22:01:46,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:01:46,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 102 [2024-11-09 22:01:46,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:01:46,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 114 [2024-11-09 22:01:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:47,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:47,428 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 229 treesize of output 209 [2024-11-09 22:01:47,432 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 156 treesize of output 152 [2024-11-09 22:01:47,437 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 536 treesize of output 496 [2024-11-09 22:01:47,444 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 247 treesize of output 243 [2024-11-09 22:01:47,624 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 186 treesize of output 166 [2024-11-09 22:01:47,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 22:01:47,673 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:01:47,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-09 22:01:47,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 22:01:47,694 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 186 treesize of output 166 [2024-11-09 22:01:47,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 22:01:47,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:01:47,750 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 80 treesize of output 60 [2024-11-09 22:01:47,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-09 22:01:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:47,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024893185] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:01:47,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:01:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-11-09 22:01:47,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604109926] [2024-11-09 22:01:47,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:47,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 22:01:47,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:47,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 22:01:47,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2024-11-09 22:01:47,855 INFO L87 Difference]: Start difference. First operand 169 states and 224 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 22:01:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:48,532 INFO L93 Difference]: Finished difference Result 220 states and 294 transitions. [2024-11-09 22:01:48,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:01:48,532 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-09 22:01:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:48,533 INFO L225 Difference]: With dead ends: 220 [2024-11-09 22:01:48,533 INFO L226 Difference]: Without dead ends: 191 [2024-11-09 22:01:48,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=463, Unknown=1, NotChecked=44, Total=600 [2024-11-09 22:01:48,534 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:48,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 468 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 257 Invalid, 0 Unknown, 118 Unchecked, 0.5s Time] [2024-11-09 22:01:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-09 22:01:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2024-11-09 22:01:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 156 states have (on average 1.3012820512820513) internal successors, (203), 157 states have internal predecessors, (203), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:01:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 233 transitions. [2024-11-09 22:01:48,551 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 233 transitions. Word has length 36 [2024-11-09 22:01:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 233 transitions. [2024-11-09 22:01:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 16 states have internal predecessors, (69), 4 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 22:01:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 233 transitions. [2024-11-09 22:01:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 22:01:48,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:48,552 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:48,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 22:01:48,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:48,753 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:01:48,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:01:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1987711238, now seen corresponding path program 2 times [2024-11-09 22:01:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:01:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322748368] [2024-11-09 22:01:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:01:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:01:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:01:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:01:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:50,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:01:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:01:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:01:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:01:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322748368] [2024-11-09 22:01:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322748368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:50,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235694270] [2024-11-09 22:01:50,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:01:50,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:01:50,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:01:50,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:01:50,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:01:50,923 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:01:50,923 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:01:50,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 22:01:50,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:01:50,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-11-09 22:01:51,121 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 15 treesize of output 1 [2024-11-09 22:01:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 22:01:51,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2024-11-09 22:01:51,270 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 22:01:51,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 61 [2024-11-09 22:01:51,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:01:51,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 55 [2024-11-09 22:01:51,463 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 22:01:51,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 49 treesize of output 19 [2024-11-09 22:01:51,546 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 34 treesize of output 15 [2024-11-09 22:01:51,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2024-11-09 22:01:51,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-09 22:01:51,655 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-11-09 22:01:51,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 30 [2024-11-09 22:01:51,663 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:01:51,742 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 45 treesize of output 29 [2024-11-09 22:01:51,966 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 19 treesize of output 11 [2024-11-09 22:01:51,968 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 7 treesize of output 3 [2024-11-09 22:01:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 22:01:52,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:01:52,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235694270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:01:52,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:01:52,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 33 [2024-11-09 22:01:52,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183664290] [2024-11-09 22:01:52,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:01:52,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 22:01:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:01:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 22:01:52,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 22:01:52,421 INFO L87 Difference]: Start difference. First operand 176 states and 233 transitions. Second operand has 33 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:01:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:01:59,940 INFO L93 Difference]: Finished difference Result 419 states and 536 transitions. [2024-11-09 22:01:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-09 22:01:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-09 22:01:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:01:59,942 INFO L225 Difference]: With dead ends: 419 [2024-11-09 22:01:59,942 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 22:01:59,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1780 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=645, Invalid=7545, Unknown=0, NotChecked=0, Total=8190 [2024-11-09 22:01:59,944 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 165 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:01:59,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1109 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1985 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 22:01:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 22:01:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 261. [2024-11-09 22:01:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 231 states have internal predecessors, (295), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 22:01:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 341 transitions. [2024-11-09 22:01:59,967 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 341 transitions. Word has length 42 [2024-11-09 22:01:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:01:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 341 transitions. [2024-11-09 22:01:59,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.2) internal successors, (66), 29 states have internal predecessors, (66), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:01:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 341 transitions. [2024-11-09 22:01:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 22:01:59,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:01:59,968 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:01:59,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 22:02:00,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 22:02:00,169 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:02:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:02:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 306296180, now seen corresponding path program 1 times [2024-11-09 22:02:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:02:00,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437003283] [2024-11-09 22:02:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:02:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:02:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:02:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:02:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:02:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 22:02:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:02:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:02:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:02:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 22:02:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:02:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437003283] [2024-11-09 22:02:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437003283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:02:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512193802] [2024-11-09 22:02:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:02:01,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:02:01,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:02:01,875 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:02:01,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:02:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:02:02,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-09 22:02:02,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:02:02,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-11-09 22:02:02,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 77 [2024-11-09 22:02:02,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 22:02:02,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2024-11-09 22:02:02,620 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 15 treesize of output 1 [2024-11-09 22:02:02,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2024-11-09 22:02:02,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 22:02:03,103 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-09 22:02:03,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 239 treesize of output 279 [2024-11-09 22:02:03,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:02:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 152 [2024-11-09 22:02:04,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:04,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:05,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 22:02:06,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 22:02:06,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 326 treesize of output 878