./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:39:14,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:39:14,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:39:14,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:39:14,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:39:14,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:39:14,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:39:14,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:39:14,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:39:14,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:39:14,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:39:14,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:39:14,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:39:14,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:39:14,787 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:39:14,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:39:14,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:39:14,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:39:14,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:39:14,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:39:14,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:39:14,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:39:14,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:39:14,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:39:14,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:39:14,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:39:14,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:39:14,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:39:14,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:39:14,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:39:14,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:39:14,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:39:14,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:14,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:39:14,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:39:14,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:39:14,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:39:14,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:39:14,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:39:14,797 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:39:14,797 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:39:14,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:39:14,797 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-clean/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-clean/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 -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2024-10-11 01:39:15,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:39:15,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:39:15,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:39:15,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:39:15,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:39:15,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-10-11 01:39:16,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:39:16,775 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:39:16,777 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2024-10-11 01:39:16,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/262ca9259/34e8c4c4be394c57b61dc0b87cf5a828/FLAG9818eacd5 [2024-10-11 01:39:17,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/262ca9259/34e8c4c4be394c57b61dc0b87cf5a828 [2024-10-11 01:39:17,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:39:17,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:39:17,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:17,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:39:17,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:39:17,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669b0238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17, skipping insertion in model container [2024-10-11 01:39:17,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:39:17,466 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-10-11 01:39:17,472 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-10-11 01:39:17,474 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-10-11 01:39:17,479 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-10-11 01:39:17,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-10-11 01:39:17,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:17,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:39:17,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22663,22676] [2024-10-11 01:39:17,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22734,22747] [2024-10-11 01:39:17,526 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[22862,22875] [2024-10-11 01:39:17,528 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23275,23288] [2024-10-11 01:39:17,529 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i[23364,23377] [2024-10-11 01:39:17,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:39:17,554 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:39:17,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17 WrapperNode [2024-10-11 01:39:17,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:39:17,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:17,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:39:17,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:39:17,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,594 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2024-10-11 01:39:17,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:39:17,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:39:17,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:39:17,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:39:17,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,627 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2024-10-11 01:39:17,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:39:17,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:39:17,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:39:17,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:39:17,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (1/1) ... [2024-10-11 01:39:17,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:39:17,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:17,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:39:17,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:39:17,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:39:17,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:39:17,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:39:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:39:17,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:39:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:39:17,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:39:17,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:39:17,836 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:39:17,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:39:18,079 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-10-11 01:39:18,079 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:39:18,121 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:39:18,122 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 01:39:18,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:18 BoogieIcfgContainer [2024-10-11 01:39:18,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:39:18,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:39:18,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:39:18,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:39:18,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:39:17" (1/3) ... [2024-10-11 01:39:18,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3311ff8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:18, skipping insertion in model container [2024-10-11 01:39:18,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:39:17" (2/3) ... [2024-10-11 01:39:18,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3311ff8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:39:18, skipping insertion in model container [2024-10-11 01:39:18,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:39:18" (3/3) ... [2024-10-11 01:39:18,131 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2024-10-11 01:39:18,145 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:39:18,146 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-11 01:39:18,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:39:18,206 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;@5697f2cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:39:18,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 01:39:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 40 states have internal predecessors, (68), 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-10-11 01:39:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 01:39:18,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:18,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:18,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 271680228, now seen corresponding path program 1 times [2024-10-11 01:39:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:18,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711541787] [2024-10-11 01:39:18,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:18,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711541787] [2024-10-11 01:39:18,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711541787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:18,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:18,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135516952] [2024-10-11 01:39:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:18,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:39:18,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:18,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:39:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:39:18,691 INFO L87 Difference]: Start difference. First operand has 41 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 40 states have internal predecessors, (68), 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:18,838 INFO L93 Difference]: Finished difference Result 98 states and 168 transitions. [2024-10-11 01:39:18,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:39:18,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 01:39:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:18,853 INFO L225 Difference]: With dead ends: 98 [2024-10-11 01:39:18,853 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 01:39:18,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:18,860 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:18,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 69 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 01:39:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2024-10-11 01:39:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 39 states have internal predecessors, (48), 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-10-11 01:39:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-11 01:39:18,894 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 7 [2024-10-11 01:39:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:18,895 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-11 01:39:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-11 01:39:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 01:39:18,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:18,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:39:18,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:18,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:18,897 INFO L85 PathProgramCache]: Analyzing trace with hash -131581983, now seen corresponding path program 1 times [2024-10-11 01:39:18,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:18,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142885454] [2024-10-11 01:39:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:18,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:19,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:19,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142885454] [2024-10-11 01:39:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142885454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511732345] [2024-10-11 01:39:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:19,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:19,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:19,014 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:19,070 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-10-11 01:39:19,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 01:39:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:19,072 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:39:19,072 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:39:19,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:19,074 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:19,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:39:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:39:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-11 01:39:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 37 states have internal predecessors, (46), 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-10-11 01:39:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-11 01:39:19,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 8 [2024-10-11 01:39:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:19,082 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-11 01:39:19,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-10-11 01:39:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:19,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:19,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:19,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:39:19,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 215961798, now seen corresponding path program 1 times [2024-10-11 01:39:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:19,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710501263] [2024-10-11 01:39:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710501263] [2024-10-11 01:39:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710501263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:39:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044339529] [2024-10-11 01:39:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:19,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:39:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:39:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:39:19,529 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-10-11 01:39:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:19,689 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2024-10-11 01:39:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:39:19,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-10-11 01:39:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:19,690 INFO L225 Difference]: With dead ends: 57 [2024-10-11 01:39:19,692 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 01:39:19,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:19,693 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:19,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 01:39:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-10-11 01:39:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.3) internal successors, (52), 42 states have internal predecessors, (52), 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-10-11 01:39:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-10-11 01:39:19,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 9 [2024-10-11 01:39:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:19,703 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-10-11 01:39:19,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-10-11 01:39:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-10-11 01:39:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:39:19,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:19,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:19,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:39:19,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:19,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:19,707 INFO L85 PathProgramCache]: Analyzing trace with hash -908178552, now seen corresponding path program 1 times [2024-10-11 01:39:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:19,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715434093] [2024-10-11 01:39:19,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715434093] [2024-10-11 01:39:19,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715434093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:39:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825563116] [2024-10-11 01:39:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:19,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:39:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:39:19,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:19,788 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:19,862 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-10-11 01:39:19,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:39:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 01:39:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:19,863 INFO L225 Difference]: With dead ends: 43 [2024-10-11 01:39:19,864 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 01:39:19,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:39:19,866 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:19,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:39:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 01:39:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 01:39:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 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-10-11 01:39:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-10-11 01:39:19,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 9 [2024-10-11 01:39:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-10-11 01:39:19,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-10-11 01:39:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:39:19,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:19,882 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:19,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:39:19,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1837347927, now seen corresponding path program 1 times [2024-10-11 01:39:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:19,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406239205] [2024-10-11 01:39:19,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:19,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:20,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406239205] [2024-10-11 01:39:20,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406239205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066328800] [2024-10-11 01:39:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:20,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:20,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:20,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:20,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:39:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:20,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 01:39:20,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:20,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 01:39:20,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:39:20,903 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-10-11 01:39:20,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 64 [2024-10-11 01:39:20,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:20,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:20,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:20,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 31 [2024-10-11 01:39:20,924 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 23 [2024-10-11 01:39:20,946 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:39:20,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2024-10-11 01:39:20,962 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 23 treesize of output 11 [2024-10-11 01:39:21,136 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 01:39:21,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 39 [2024-10-11 01:39:21,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2024-10-11 01:39:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:21,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066328800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:21,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-10-11 01:39:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067014892] [2024-10-11 01:39:21,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:39:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:39:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:39:21,536 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:22,102 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2024-10-11 01:39:22,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:39:22,103 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 01:39:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:22,104 INFO L225 Difference]: With dead ends: 72 [2024-10-11 01:39:22,104 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 01:39:22,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-11 01:39:22,105 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:22,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:39:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 01:39:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2024-10-11 01:39:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.25) internal successors, (55), 45 states have internal predecessors, (55), 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-10-11 01:39:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-10-11 01:39:22,124 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 14 [2024-10-11 01:39:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-10-11 01:39:22,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:22,125 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-10-11 01:39:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:39:22,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:22,126 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:22,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:39:22,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:22,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:22,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2050427348, now seen corresponding path program 1 times [2024-10-11 01:39:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:22,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951755093] [2024-10-11 01:39:22,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951755093] [2024-10-11 01:39:22,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951755093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:22,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308912384] [2024-10-11 01:39:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:22,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:22,560 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:22,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:39:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:22,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 01:39:22,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:22,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:22,750 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-10-11 01:39:22,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2024-10-11 01:39:22,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 01:39:22,778 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-10-11 01:39:22,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 41 [2024-10-11 01:39:22,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:22,875 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 49 treesize of output 36 [2024-10-11 01:39:22,903 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-10-11 01:39:22,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 01:39:22,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 40 treesize of output 29 [2024-10-11 01:39:23,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:23,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 31 treesize of output 15 [2024-10-11 01:39:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:23,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308912384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:23,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2024-10-11 01:39:23,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296447918] [2024-10-11 01:39:23,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:39:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:23,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:39:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=116, Unknown=3, NotChecked=0, Total=156 [2024-10-11 01:39:23,116 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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-10-11 01:39:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:23,767 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2024-10-11 01:39:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:39:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 01:39:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:23,769 INFO L225 Difference]: With dead ends: 133 [2024-10-11 01:39:23,769 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 01:39:23,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=290, Unknown=3, NotChecked=0, Total=420 [2024-10-11 01:39:23,770 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 217 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:23,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 271 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:39:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 01:39:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 70. [2024-10-11 01:39:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 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-10-11 01:39:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2024-10-11 01:39:23,792 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 15 [2024-10-11 01:39:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2024-10-11 01:39:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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-10-11 01:39:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2024-10-11 01:39:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:39:23,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:23,793 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:23,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:39:23,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:23,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:23,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash -927855815, now seen corresponding path program 2 times [2024-10-11 01:39:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878834274] [2024-10-11 01:39:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:23,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878834274] [2024-10-11 01:39:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878834274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:24,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86632355] [2024-10-11 01:39:24,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:39:24,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:24,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:24,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:24,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:39:24,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:39:24,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:39:24,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 01:39:24,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:24,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:24,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:24,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:24,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-10-11 01:39:24,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 43 treesize of output 22 [2024-10-11 01:39:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 7 [2024-10-11 01:39:24,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:24,882 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 27 treesize of output 16 [2024-10-11 01:39:24,962 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 01:39:24,963 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 01:39:24,991 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-11 01:39:24,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-11 01:39:25,022 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 21 treesize of output 20 [2024-10-11 01:39:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 01:39:25,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:39:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86632355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:39:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-11 01:39:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735140658] [2024-10-11 01:39:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:25,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:39:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:39:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:39:25,145 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:25,479 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2024-10-11 01:39:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 01:39:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:25,481 INFO L225 Difference]: With dead ends: 172 [2024-10-11 01:39:25,481 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 01:39:25,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-11 01:39:25,482 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:25,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 129 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 01:39:25,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2024-10-11 01:39:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 97 states have internal predecessors, (121), 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-10-11 01:39:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2024-10-11 01:39:25,501 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 17 [2024-10-11 01:39:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2024-10-11 01:39:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2024-10-11 01:39:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:39:25,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:25,503 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:25,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:39:25,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:25,708 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:25,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:25,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2497807, now seen corresponding path program 1 times [2024-10-11 01:39:25,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:25,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064671341] [2024-10-11 01:39:25,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:25,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064671341] [2024-10-11 01:39:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064671341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900243666] [2024-10-11 01:39:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:26,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:26,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:26,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:26,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:39:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:26,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-11 01:39:26,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:26,336 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 01:39:26,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 24 treesize of output 28 [2024-10-11 01:39:26,366 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2024-10-11 01:39:26,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 97 [2024-10-11 01:39:26,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2024-10-11 01:39:26,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:26,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:26,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 11 [2024-10-11 01:39:26,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:26,402 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-10-11 01:39:26,403 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 1 case distinctions, treesize of input 43 treesize of output 38 [2024-10-11 01:39:26,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-11 01:39:26,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:26,517 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 45 treesize of output 34 [2024-10-11 01:39:26,533 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:39:26,534 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 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 01:39:26,561 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-10-11 01:39:26,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 01:39:26,572 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 16 treesize of output 11 [2024-10-11 01:39:26,625 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 16 treesize of output 11 [2024-10-11 01:39:26,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2024-10-11 01:39:26,637 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-10-11 01:39:26,816 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 35 treesize of output 19 [2024-10-11 01:39:26,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-11 01:39:26,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:26,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:26,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_833 (Array Int Int)) (v_ArrVal_835 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_835) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_833) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) 1)) is different from false [2024-10-11 01:39:26,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:26,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2024-10-11 01:39:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900243666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:27,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-10-11 01:39:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684005912] [2024-10-11 01:39:27,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:39:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:27,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:39:27,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=301, Unknown=1, NotChecked=34, Total=380 [2024-10-11 01:39:27,068 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-10-11 01:39:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:28,332 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2024-10-11 01:39:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:39:28,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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 18 [2024-10-11 01:39:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:28,334 INFO L225 Difference]: With dead ends: 232 [2024-10-11 01:39:28,334 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 01:39:28,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=721, Unknown=1, NotChecked=58, Total=992 [2024-10-11 01:39:28,335 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 245 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:28,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 386 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 559 Invalid, 0 Unknown, 100 Unchecked, 0.6s Time] [2024-10-11 01:39:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 01:39:28,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2024-10-11 01:39:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 157 states have internal predecessors, (197), 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-10-11 01:39:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 197 transitions. [2024-10-11 01:39:28,368 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 197 transitions. Word has length 18 [2024-10-11 01:39:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:28,369 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 197 transitions. [2024-10-11 01:39:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-10-11 01:39:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 197 transitions. [2024-10-11 01:39:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:39:28,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:28,370 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:28,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 01:39:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 01:39:28,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1164713114, now seen corresponding path program 2 times [2024-10-11 01:39:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499837469] [2024-10-11 01:39:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:29,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499837469] [2024-10-11 01:39:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499837469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:29,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432784663] [2024-10-11 01:39:29,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:39:29,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:29,559 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:29,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:39:29,891 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:39:29,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:39:29,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 01:39:29,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:29,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:39:29,917 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:39:29,945 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2024-10-11 01:39:29,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2024-10-11 01:39:29,958 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-10-11 01:39:29,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 43 [2024-10-11 01:39:29,969 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 19 treesize of output 31 [2024-10-11 01:39:29,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 1 [2024-10-11 01:39:29,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:29,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 50 [2024-10-11 01:39:29,985 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 19 treesize of output 31 [2024-10-11 01:39:29,998 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 23 treesize of output 11 [2024-10-11 01:39:30,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:30,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2024-10-11 01:39:30,167 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-10-11 01:39:30,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 122 treesize of output 73 [2024-10-11 01:39:30,374 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-10-11 01:39:30,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 122 treesize of output 73 [2024-10-11 01:39:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:30,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2024-10-11 01:39:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:30,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:35,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432784663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:35,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2024-10-11 01:39:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362333206] [2024-10-11 01:39:35,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:35,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 01:39:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 01:39:35,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=391, Unknown=1, NotChecked=0, Total=462 [2024-10-11 01:39:35,412 INFO L87 Difference]: Start difference. First operand 158 states and 197 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 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-10-11 01:39:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:36,424 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2024-10-11 01:39:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 01:39:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 01:39:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:36,426 INFO L225 Difference]: With dead ends: 189 [2024-10-11 01:39:36,426 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 01:39:36,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=138, Invalid=673, Unknown=1, NotChecked=0, Total=812 [2024-10-11 01:39:36,430 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 45 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:36,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 339 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 01:39:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 01:39:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 163. [2024-10-11 01:39:36,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 162 states have internal predecessors, (202), 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-10-11 01:39:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-10-11 01:39:36,470 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 19 [2024-10-11 01:39:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:36,471 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-10-11 01:39:36,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 21 states have internal predecessors, (50), 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-10-11 01:39:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-10-11 01:39:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:39:36,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:36,472 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:36,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:39:36,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:36,673 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:36,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash 874958036, now seen corresponding path program 1 times [2024-10-11 01:39:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796565232] [2024-10-11 01:39:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:37,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796565232] [2024-10-11 01:39:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796565232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159115600] [2024-10-11 01:39:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:37,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:37,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:37,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:37,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:39:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:37,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-11 01:39:37,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:37,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 01:39:37,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 01:39:37,627 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-10-11 01:39:37,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 83 [2024-10-11 01:39:37,670 INFO L349 Elim1Store]: treesize reduction 102, result has 32.5 percent of original size [2024-10-11 01:39:37,671 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 2 case distinctions, treesize of input 45 treesize of output 54 [2024-10-11 01:39:37,675 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 23 treesize of output 11 [2024-10-11 01:39:37,692 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 23 treesize of output 11 [2024-10-11 01:39:37,730 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2024-10-11 01:39:37,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 70 [2024-10-11 01:39:37,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 15 [2024-10-11 01:39:37,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:37,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:37,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:37,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-10-11 01:39:37,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:37,868 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-11 01:39:37,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 72 [2024-10-11 01:39:37,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:37,903 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-10-11 01:39:37,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 01:39:37,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-11 01:39:38,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2024-10-11 01:39:38,058 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-11 01:39:38,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 70 [2024-10-11 01:39:38,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:38,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-10-11 01:39:38,515 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-11 01:39:38,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 47 [2024-10-11 01:39:38,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:39:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:38,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:38,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1156 (Array Int Int)) (v_ArrVal_1155 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1156)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1155))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ 8 (select (select .cse3 .cse1) .cse2))))) 2)) is different from false [2024-10-11 01:39:38,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:38,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 63 [2024-10-11 01:39:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159115600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:38,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:38,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-11 01:39:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924680968] [2024-10-11 01:39:38,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 01:39:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 01:39:38,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-10-11 01:39:38,830 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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-10-11 01:39:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:40,351 INFO L93 Difference]: Finished difference Result 337 states and 422 transitions. [2024-10-11 01:39:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:39:40,352 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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 20 [2024-10-11 01:39:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:40,353 INFO L225 Difference]: With dead ends: 337 [2024-10-11 01:39:40,353 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 01:39:40,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=903, Unknown=1, NotChecked=64, Total=1190 [2024-10-11 01:39:40,355 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 238 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:40,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 416 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 627 Invalid, 0 Unknown, 138 Unchecked, 0.8s Time] [2024-10-11 01:39:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 01:39:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 215. [2024-10-11 01:39:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 1.267605633802817) internal successors, (270), 214 states have internal predecessors, (270), 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-10-11 01:39:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2024-10-11 01:39:40,403 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 20 [2024-10-11 01:39:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:40,403 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2024-10-11 01:39:40,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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-10-11 01:39:40,404 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2024-10-11 01:39:40,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:39:40,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:40,405 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] [2024-10-11 01:39:40,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 01:39:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 01:39:40,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:40,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1766894150, now seen corresponding path program 1 times [2024-10-11 01:39:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:40,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461379629] [2024-10-11 01:39:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:41,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461379629] [2024-10-11 01:39:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461379629] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78089674] [2024-10-11 01:39:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:41,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:41,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:41,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:39:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:41,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 01:39:41,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:41,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:41,869 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-10-11 01:39:41,870 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 1 case distinctions, treesize of input 35 treesize of output 20 [2024-10-11 01:39:41,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:41,883 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-11 01:39:41,884 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 1 case distinctions, treesize of input 21 treesize of output 1 [2024-10-11 01:39:41,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:39:41,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:39:41,940 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 11 treesize of output 7 [2024-10-11 01:39:42,302 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-10-11 01:39:42,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 01:39:42,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:39:42,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 27 treesize of output 15 [2024-10-11 01:39:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 01:39:42,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 01:39:42,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:42,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:42,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (or (not (= v_ArrVal_1322 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0 (select v_ArrVal_1322 .cse0)))) (= (select v_ArrVal_1322 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1322) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 4)))))) is different from false [2024-10-11 01:39:42,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1322 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (or (not (= v_ArrVal_1322 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0 (select v_ArrVal_1322 .cse0)))) (= (select v_ArrVal_1322 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 4)))))) is different from false [2024-10-11 01:39:42,671 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 108 treesize of output 102 [2024-10-11 01:39:42,680 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 170 treesize of output 158 [2024-10-11 01:39:42,840 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse5 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse8 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse1 (and (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse8 .cse9 v_ArrVal_1321)))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse17 (select (store .cse19 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) v_arrayElimCell_106)) (.cse18 (select v_ArrVal_1322 .cse7))) (or (= (select .cse17 .cse6) .cse18) (= (select .cse17 (+ v_arrayElimCell_107 4)) .cse18)))) (not (= (store (select .cse19 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5 (select v_ArrVal_1322 .cse5)) v_ArrVal_1322))))) (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse8 .cse9 v_ArrVal_1321)))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select (select (store .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) v_arrayElimCell_106) (+ v_arrayElimCell_107 4)) (select v_ArrVal_1322 .cse7))) (not (= (store (select .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5 (select v_ArrVal_1322 .cse5)) v_ArrVal_1322))))))) (.cse3 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse2 (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse8 .cse9 v_ArrVal_1321)))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322)) (.cse15 (select v_ArrVal_1322 .cse7))) (or (= (select (select .cse14 v_arrayElimCell_106) (+ v_arrayElimCell_107 4)) .cse15) (not (= (store (select .cse16 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5 (select v_ArrVal_1322 .cse5)) v_ArrVal_1322)) (= (select (select .cse14 |c_ULTIMATE.start_main_~item~0#1.base|) .cse6) .cse15))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse8 .cse9 v_ArrVal_1321)))) (or (not (= (store (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5 (select v_ArrVal_1322 .cse5)) v_ArrVal_1322)) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~item~0#1.base|) .cse6) (select v_ArrVal_1322 .cse7))))) (not .cse3) (not .cse0)) (or .cse1 .cse3) (or .cse0 .cse2) (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse8 .cse9 v_ArrVal_1321)))) (let ((.cse12 (store .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322)) (.cse11 (select v_ArrVal_1322 .cse7))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse10 (select .cse12 v_arrayElimCell_106))) (or (= (select .cse10 .cse6) .cse11) (= (select .cse10 (+ v_arrayElimCell_107 4)) .cse11)))) (not (= (store (select .cse13 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse5 (select v_ArrVal_1322 .cse5)) v_ArrVal_1322)) (= (select (select .cse12 |c_ULTIMATE.start_main_~item~0#1.base|) .cse6) .cse11)))))))) is different from false [2024-10-11 01:39:44,790 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2024-10-11 01:39:44,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 144 [2024-10-11 01:39:44,812 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-11 01:39:44,813 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 208 treesize of output 204 [2024-10-11 01:39:44,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:44,962 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 85 treesize of output 97 [2024-10-11 01:39:45,265 INFO L349 Elim1Store]: treesize reduction 6, result has 95.4 percent of original size [2024-10-11 01:39:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 300 treesize of output 304 [2024-10-11 01:39:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 01:39:45,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78089674] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:45,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:45,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-10-11 01:39:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894606285] [2024-10-11 01:39:45,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:45,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 01:39:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:45,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 01:39:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=803, Unknown=3, NotChecked=180, Total=1122 [2024-10-11 01:39:45,512 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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-10-11 01:39:49,056 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|)) (.cse15 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse17 (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int)) (v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse15 v_ArrVal_1321)))) (let ((.cse25 (store .cse27 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322)) (.cse26 (select v_ArrVal_1322 .cse14))) (or (= (select (select .cse25 v_arrayElimCell_106) (+ v_arrayElimCell_107 4)) .cse26) (not (= (store (select .cse27 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1322 .cse13)) v_ArrVal_1322)) (= (select (select .cse25 |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) .cse26)))))) (.cse19 (= |c_ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse16 (= |c_ULTIMATE.start_main_~bcki~0#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse18 (and (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse23 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse15 v_ArrVal_1321)))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) v_arrayElimCell_106)) (.cse22 (select v_ArrVal_1322 .cse14))) (or (= (select .cse21 .cse0) .cse22) (= (select .cse21 (+ v_arrayElimCell_107 4)) .cse22)))) (not (= (store (select .cse23 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1322 .cse13)) v_ArrVal_1322))))) (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse15 v_ArrVal_1321)))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (= (select (select (store .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) v_arrayElimCell_106) (+ v_arrayElimCell_107 4)) (select v_ArrVal_1322 .cse14))) (not (= (store (select .cse24 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1322 .cse13)) v_ArrVal_1322)))))))) (let ((.cse3 (or .cse16 .cse18)) (.cse4 (or .cse17 .cse19)) (.cse5 (or (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse15 v_ArrVal_1321)))) (or (not (= (store (select .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1322 .cse13)) v_ArrVal_1322)) (= (select (select (store .cse20 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322) |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (select v_ArrVal_1322 .cse14))))) (not .cse19) (not .cse16))) (.cse6 (or .cse18 .cse19)) (.cse7 (or .cse16 .cse17)) (.cse8 (forall ((v_ArrVal_1321 Int) (v_ArrVal_1322 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 .cse15 v_ArrVal_1321)))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_1322)) (.cse10 (select v_ArrVal_1322 .cse14))) (or (forall ((v_arrayElimCell_106 Int) (v_arrayElimCell_107 Int)) (let ((.cse9 (select .cse11 v_arrayElimCell_106))) (or (= (select .cse9 .cse0) .cse10) (= (select .cse9 (+ v_arrayElimCell_107 4)) .cse10)))) (not (= (store (select .cse12 |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse13 (select v_ArrVal_1322 .cse13)) v_ArrVal_1322)) (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) .cse10))))))) (let ((.cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) (and (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (or (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0) (select .cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse2) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|) 1) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) .cse4 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) .cse5 .cse6 .cse7 (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse2) .cse8))))) is different from false [2024-10-11 01:39:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:49,581 INFO L93 Difference]: Finished difference Result 427 states and 538 transitions. [2024-10-11 01:39:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-11 01:39:49,582 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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 23 [2024-10-11 01:39:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:49,584 INFO L225 Difference]: With dead ends: 427 [2024-10-11 01:39:49,584 INFO L226 Difference]: Without dead ends: 392 [2024-10-11 01:39:49,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=729, Invalid=3839, Unknown=4, NotChecked=540, Total=5112 [2024-10-11 01:39:49,586 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 458 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 878 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:49,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 400 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 699 Invalid, 2 Unknown, 878 Unchecked, 1.4s Time] [2024-10-11 01:39:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-11 01:39:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 310. [2024-10-11 01:39:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 308 states have (on average 1.2694805194805194) internal successors, (391), 309 states have internal predecessors, (391), 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-10-11 01:39:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 391 transitions. [2024-10-11 01:39:49,661 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 391 transitions. Word has length 23 [2024-10-11 01:39:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:49,661 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 391 transitions. [2024-10-11 01:39:49,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 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-10-11 01:39:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 391 transitions. [2024-10-11 01:39:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:39:49,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:49,662 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 01:39:49,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:49,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1692517815, now seen corresponding path program 3 times [2024-10-11 01:39:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210898998] [2024-10-11 01:39:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210898998] [2024-10-11 01:39:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210898998] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732259846] [2024-10-11 01:39:50,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:39:50,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:50,616 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:50,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 01:39:51,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 01:39:51,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:39:51,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 01:39:51,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:51,684 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:39:51,692 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2024-10-11 01:39:51,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 32 treesize of output 36 [2024-10-11 01:39:51,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 25 treesize of output 30 [2024-10-11 01:39:51,735 INFO L349 Elim1Store]: treesize reduction 70, result has 6.7 percent of original size [2024-10-11 01:39:51,735 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 146 treesize of output 121 [2024-10-11 01:39:51,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:51,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:51,743 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 35 treesize of output 19 [2024-10-11 01:39:51,750 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 19 treesize of output 31 [2024-10-11 01:39:51,757 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-10-11 01:39:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:51,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 30 [2024-10-11 01:39:51,773 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 31 treesize of output 15 [2024-10-11 01:39:51,917 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-10-11 01:39:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 107 treesize of output 66 [2024-10-11 01:39:51,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:51,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-10-11 01:39:52,083 INFO L349 Elim1Store]: treesize reduction 45, result has 13.5 percent of original size [2024-10-11 01:39:52,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 107 treesize of output 66 [2024-10-11 01:39:52,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:52,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-11 01:39:52,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:52,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2024-10-11 01:39:52,242 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 01:39:52,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 59 [2024-10-11 01:39:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:52,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732259846] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:53,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:53,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-10-11 01:39:53,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819847504] [2024-10-11 01:39:53,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:39:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:39:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:39:53,197 INFO L87 Difference]: Start difference. First operand 310 states and 391 transitions. Second operand has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:53,796 INFO L93 Difference]: Finished difference Result 325 states and 407 transitions. [2024-10-11 01:39:53,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:39:53,797 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 01:39:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:53,798 INFO L225 Difference]: With dead ends: 325 [2024-10-11 01:39:53,799 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 01:39:53,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:39:53,800 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:53,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 276 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 01:39:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 01:39:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-10-11 01:39:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 295 states have (on average 1.2779661016949153) internal successors, (377), 296 states have internal predecessors, (377), 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-10-11 01:39:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 377 transitions. [2024-10-11 01:39:53,874 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 377 transitions. Word has length 24 [2024-10-11 01:39:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 377 transitions. [2024-10-11 01:39:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 20 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:39:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 377 transitions. [2024-10-11 01:39:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:39:53,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:53,876 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] [2024-10-11 01:39:53,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 01:39:54,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 01:39:54,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash -87353757, now seen corresponding path program 1 times [2024-10-11 01:39:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075906153] [2024-10-11 01:39:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:54,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075906153] [2024-10-11 01:39:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075906153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:39:54,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252253810] [2024-10-11 01:39:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:54,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:54,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:39:54,816 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:39:54,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 01:39:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:54,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 01:39:54,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:39:55,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 01:39:55,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 01:39:55,026 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-10-11 01:39:55,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,060 INFO L349 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2024-10-11 01:39:55,060 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 1 case distinctions, treesize of input 35 treesize of output 20 [2024-10-11 01:39:55,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 11 [2024-10-11 01:39:55,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 16 [2024-10-11 01:39:55,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:39:55,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-11 01:39:55,168 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 01:39:55,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 01:39:55,183 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 16 treesize of output 11 [2024-10-11 01:39:55,233 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 16 treesize of output 11 [2024-10-11 01:39:55,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-10-11 01:39:55,260 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 13 treesize of output 9 [2024-10-11 01:39:55,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:39:55,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-10-11 01:39:55,908 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:39:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-10-11 01:39:55,927 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-11 01:39:55,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2024-10-11 01:39:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:56,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:39:56,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((v_ArrVal_1686 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)))) is different from false [2024-10-11 01:39:56,277 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= .cse0 (select (select |c_#memory_int#1| .cse1) (+ 8 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))))) (= .cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1685) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1686 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1686) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0)))))) is different from false [2024-10-11 01:39:56,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)))) (or (not (= .cse0 (select (select |c_#memory_int#1| .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((v_ArrVal_1686 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1686) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1685) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse2) 0)))) (= .cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base|) (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 8))))) is different from false [2024-10-11 01:39:56,345 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-10-11 01:39:56,346 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 105 treesize of output 100 [2024-10-11 01:39:56,379 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1684 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1684))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1686)) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1)))) (forall ((v_ArrVal_1686 (Array Int Int)) (v_ArrVal_1684 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1684))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= 0 (select (select (store .cse2 .cse3 v_ArrVal_1686) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1)) (= .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|))))) (forall ((v_ArrVal_1685 (Array Int Int)) (v_ArrVal_1684 (Array Int Int)) (v_ArrVal_1683 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1684) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1683) .cse4 v_ArrVal_1685) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0) (= .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_ArrVal_1685 (Array Int Int)) (v_ArrVal_1684 (Array Int Int)) (v_ArrVal_1683 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1683))) (or (= (select (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) (= (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1684) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1685) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse1) 0)))))) is different from false [2024-10-11 01:39:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 01:39:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252253810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:39:56,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:39:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2024-10-11 01:39:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244785777] [2024-10-11 01:39:56,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:39:56,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 01:39:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 01:39:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=642, Unknown=4, NotChecked=220, Total=992 [2024-10-11 01:39:56,583 INFO L87 Difference]: Start difference. First operand 297 states and 377 transitions. Second operand has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 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-10-11 01:39:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:58,525 INFO L93 Difference]: Finished difference Result 405 states and 507 transitions. [2024-10-11 01:39:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 01:39:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 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 26 [2024-10-11 01:39:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:58,527 INFO L225 Difference]: With dead ends: 405 [2024-10-11 01:39:58,527 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 01:39:58,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=397, Invalid=1507, Unknown=4, NotChecked=348, Total=2256 [2024-10-11 01:39:58,528 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 317 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:58,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 416 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 608 Invalid, 0 Unknown, 457 Unchecked, 0.9s Time] [2024-10-11 01:39:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 01:39:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 336. [2024-10-11 01:39:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 335 states have internal predecessors, (425), 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-10-11 01:39:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 425 transitions. [2024-10-11 01:39:58,600 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 425 transitions. Word has length 26 [2024-10-11 01:39:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:58,600 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 425 transitions. [2024-10-11 01:39:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.21875) internal successors, (71), 31 states have internal predecessors, (71), 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-10-11 01:39:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 425 transitions. [2024-10-11 01:39:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:39:58,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:58,602 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-10-11 01:39:58,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 01:39:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:39:58,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1196561827, now seen corresponding path program 1 times [2024-10-11 01:39:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:58,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405603979] [2024-10-11 01:39:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:39:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:39:59,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:39:59,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405603979] [2024-10-11 01:39:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405603979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:39:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:39:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:39:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952274210] [2024-10-11 01:39:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:39:59,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:39:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:39:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:39:59,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:39:59,283 INFO L87 Difference]: Start difference. First operand 336 states and 425 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-10-11 01:39:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:39:59,726 INFO L93 Difference]: Finished difference Result 429 states and 543 transitions. [2024-10-11 01:39:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:39:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-10-11 01:39:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:39:59,729 INFO L225 Difference]: With dead ends: 429 [2024-10-11 01:39:59,729 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 01:39:59,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:39:59,730 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:39:59,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 94 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:39:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 01:39:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2024-10-11 01:39:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 334 states have (on average 1.2634730538922156) internal successors, (422), 335 states have internal predecessors, (422), 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-10-11 01:39:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 422 transitions. [2024-10-11 01:39:59,813 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 422 transitions. Word has length 26 [2024-10-11 01:39:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:39:59,813 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 422 transitions. [2024-10-11 01:39:59,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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-10-11 01:39:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 422 transitions. [2024-10-11 01:39:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:39:59,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:39:59,815 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:39:59,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 01:39:59,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:39:59,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:39:59,815 INFO L85 PathProgramCache]: Analyzing trace with hash -456299194, now seen corresponding path program 1 times [2024-10-11 01:39:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:39:59,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239876779] [2024-10-11 01:39:59,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:39:59,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:39:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:00,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239876779] [2024-10-11 01:40:00,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239876779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:00,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429968445] [2024-10-11 01:40:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:00,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:40:00,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 01:40:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:00,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-10-11 01:40:00,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:00,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 32 [2024-10-11 01:40:00,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:40:00,919 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 43 [2024-10-11 01:40:00,935 INFO L349 Elim1Store]: treesize reduction 70, result has 6.7 percent of original size [2024-10-11 01:40:00,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 106 [2024-10-11 01:40:00,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:00,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 31 [2024-10-11 01:40:00,949 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 23 treesize of output 11 [2024-10-11 01:40:00,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:00,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 11 [2024-10-11 01:40:00,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:00,983 INFO L349 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2024-10-11 01:40:00,984 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 1 case distinctions, treesize of input 43 treesize of output 38 [2024-10-11 01:40:00,991 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 7 [2024-10-11 01:40:01,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:01,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:01,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2024-10-11 01:40:01,110 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2024-10-11 01:40:01,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2024-10-11 01:40:01,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 01:40:01,133 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 16 treesize of output 11 [2024-10-11 01:40:01,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2024-10-11 01:40:01,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-10-11 01:40:01,232 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 21 treesize of output 20 [2024-10-11 01:40:01,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:01,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2024-10-11 01:40:02,124 INFO L349 Elim1Store]: treesize reduction 62, result has 27.9 percent of original size [2024-10-11 01:40:02,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 86 [2024-10-11 01:40:02,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:02,148 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-11 01:40:02,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2024-10-11 01:40:02,184 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 29 treesize of output 23 [2024-10-11 01:40:02,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:02,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:40:03,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:03,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 224 [2024-10-11 01:40:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:03,103 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-11 01:40:03,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 27 treesize of output 4 [2024-10-11 01:40:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429968445] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:40:03,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:40:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 34 [2024-10-11 01:40:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067830921] [2024-10-11 01:40:03,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:40:03,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 01:40:03,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 01:40:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=997, Unknown=13, NotChecked=0, Total=1190 [2024-10-11 01:40:03,365 INFO L87 Difference]: Start difference. First operand 336 states and 422 transitions. Second operand has 35 states, 35 states have (on average 2.2) internal successors, (77), 34 states have internal predecessors, (77), 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-10-11 01:40:11,479 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 [1] [2024-10-11 01:40:15,498 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 [1] [2024-10-11 01:40:19,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 01:40:20,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (.cse5 (and (forall ((v_ArrVal_1949 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1949) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_1950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1950) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0))))) (and (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (and (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (= |c_ULTIMATE.start_main_~bucket~0#1.base| 0)) (not (= .cse0 (select (select |c_#memory_int#1| .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 8)))) (and (forall ((v_ArrVal_1950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1950) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)) (forall ((v_ArrVal_1949 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1949) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse4) 0)))))) (or (not (= .cse0 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8)))) .cse5) (or (not (= |c_ULTIMATE.start_main_#t~mem11#1| |c_ULTIMATE.start_main_#t~mem10#1|)) .cse5)))) is different from false [2024-10-11 01:40:20,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (and (forall ((v_ArrVal_1949 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1949) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) .cse3))) (or (and (forall ((v_ArrVal_1950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1950) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1949 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1949) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0))) (not (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4)) (select (select |c_#memory_int#1| .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse2) .cse3) 8)))) (and (= |c_ULTIMATE.start_main_~bcki~0#1.offset| 0) (= |c_ULTIMATE.start_main_~bcki~0#1.base| 0))))) (forall ((v_ArrVal_1950 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1950) |c_ULTIMATE.start_main_~bucket~0#1.base|) .cse0) 0)))) is different from false [2024-10-11 01:40:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:20,678 INFO L93 Difference]: Finished difference Result 604 states and 763 transitions. [2024-10-11 01:40:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-11 01:40:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2) internal successors, (77), 34 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 01:40:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:20,681 INFO L225 Difference]: With dead ends: 604 [2024-10-11 01:40:20,681 INFO L226 Difference]: Without dead ends: 481 [2024-10-11 01:40:20,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=817, Invalid=3331, Unknown=20, NotChecked=254, Total=4422 [2024-10-11 01:40:20,683 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 468 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 52 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:20,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 717 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1276 Invalid, 51 Unknown, 101 Unchecked, 14.5s Time] [2024-10-11 01:40:20,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-11 01:40:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 382. [2024-10-11 01:40:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 1.2710526315789474) internal successors, (483), 381 states have internal predecessors, (483), 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-10-11 01:40:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 483 transitions. [2024-10-11 01:40:20,823 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 483 transitions. Word has length 28 [2024-10-11 01:40:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 483 transitions. [2024-10-11 01:40:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2) internal successors, (77), 34 states have internal predecessors, (77), 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-10-11 01:40:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 483 transitions. [2024-10-11 01:40:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:40:20,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:20,825 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] [2024-10-11 01:40:20,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 01:40:21,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 01:40:21,026 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:40:21,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:21,026 INFO L85 PathProgramCache]: Analyzing trace with hash -378647849, now seen corresponding path program 1 times [2024-10-11 01:40:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896054394] [2024-10-11 01:40:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:21,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896054394] [2024-10-11 01:40:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896054394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:22,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484780752] [2024-10-11 01:40:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:22,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:22,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:22,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:40:22,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 01:40:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:22,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 01:40:22,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:22,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:40:22,481 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 16 treesize of output 8 [2024-10-11 01:40:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:22,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:40:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484780752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:40:22,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:40:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-10-11 01:40:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885138078] [2024-10-11 01:40:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:40:22,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:40:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:40:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-11 01:40:22,497 INFO L87 Difference]: Start difference. First operand 382 states and 483 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:22,784 INFO L93 Difference]: Finished difference Result 414 states and 527 transitions. [2024-10-11 01:40:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:40:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 01:40:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:22,786 INFO L225 Difference]: With dead ends: 414 [2024-10-11 01:40:22,786 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 01:40:22,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:40:22,786 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:22,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:40:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 01:40:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 398. [2024-10-11 01:40:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 396 states have (on average 1.27020202020202) internal successors, (503), 397 states have internal predecessors, (503), 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-10-11 01:40:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 503 transitions. [2024-10-11 01:40:22,888 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 503 transitions. Word has length 28 [2024-10-11 01:40:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 503 transitions. [2024-10-11 01:40:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 503 transitions. [2024-10-11 01:40:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:40:22,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:22,889 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] [2024-10-11 01:40:22,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 01:40:23,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 01:40:23,090 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:40:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:23,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1611997331, now seen corresponding path program 1 times [2024-10-11 01:40:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913253072] [2024-10-11 01:40:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:23,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913253072] [2024-10-11 01:40:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913253072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489149532] [2024-10-11 01:40:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:23,715 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:40:23,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 01:40:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:23,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 01:40:23,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:23,928 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-10-11 01:40:23,932 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-10-11 01:40:23,940 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-10-11 01:40:23,944 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-10-11 01:40:24,066 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 22 [2024-10-11 01:40:24,076 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 27 treesize of output 15 [2024-10-11 01:40:24,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:24,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 18 [2024-10-11 01:40:24,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 24 [2024-10-11 01:40:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:24,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:40:24,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_2279 (Array Int Int))) (or (not (= v_ArrVal_2279 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 (select v_ArrVal_2279 .cse0)))) (forall ((|ULTIMATE.start_main_~bucket~0#1.base| Int) (v_ArrVal_2286 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2279))) (store .cse1 |ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_2286))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) (forall ((|ULTIMATE.start_main_~bucket~0#1.base| Int) (v_ArrVal_2287 Int) (v_ArrVal_2280 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse0 v_ArrVal_2280)))) (store .cse3 |ULTIMATE.start_main_~bucket~0#1.base| (store (select .cse3 |ULTIMATE.start_main_~bucket~0#1.base|) .cse2 v_ArrVal_2287))) |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)))) is different from false [2024-10-11 01:40:24,495 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:40:24,495 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 76 treesize of output 76 [2024-10-11 01:40:24,500 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:40:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489149532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:40:24,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:40:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 19 [2024-10-11 01:40:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732887393] [2024-10-11 01:40:24,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:40:24,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:40:24,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:40:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=280, Unknown=1, NotChecked=34, Total=380 [2024-10-11 01:40:24,522 INFO L87 Difference]: Start difference. First operand 398 states and 503 transitions. Second operand has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 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-10-11 01:40:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:25,508 INFO L93 Difference]: Finished difference Result 425 states and 537 transitions. [2024-10-11 01:40:25,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 01:40:25,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 01:40:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:25,511 INFO L225 Difference]: With dead ends: 425 [2024-10-11 01:40:25,511 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 01:40:25,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=372, Unknown=1, NotChecked=40, Total=506 [2024-10-11 01:40:25,513 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 32 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:25,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 215 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 310 Invalid, 0 Unknown, 61 Unchecked, 0.5s Time] [2024-10-11 01:40:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 01:40:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 402. [2024-10-11 01:40:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 400 states have (on average 1.27) internal successors, (508), 401 states have internal predecessors, (508), 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-10-11 01:40:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 508 transitions. [2024-10-11 01:40:25,627 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 508 transitions. Word has length 28 [2024-10-11 01:40:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 508 transitions. [2024-10-11 01:40:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.95) internal successors, (59), 19 states have internal predecessors, (59), 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-10-11 01:40:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 508 transitions. [2024-10-11 01:40:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 01:40:25,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:25,628 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] [2024-10-11 01:40:25,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 01:40:25,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 01:40:25,828 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:40:25,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1128441754, now seen corresponding path program 1 times [2024-10-11 01:40:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044598467] [2024-10-11 01:40:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:25,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044598467] [2024-10-11 01:40:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044598467] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813342813] [2024-10-11 01:40:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:26,314 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:40:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 01:40:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:26,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 01:40:26,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:26,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2024-10-11 01:40:26,588 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-10-11 01:40:26,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 91 [2024-10-11 01:40:26,591 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 23 treesize of output 11 [2024-10-11 01:40:26,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2024-10-11 01:40:26,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:26,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:26,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 31 [2024-10-11 01:40:26,609 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 23 [2024-10-11 01:40:26,634 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2024-10-11 01:40:26,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 41 [2024-10-11 01:40:26,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:26,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:26,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2024-10-11 01:40:26,719 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-11 01:40:26,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 56 [2024-10-11 01:40:26,746 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:40:26,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 01:40:26,841 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 01:40:26,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 53 [2024-10-11 01:40:26,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2024-10-11 01:40:27,409 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:40:27,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 40 [2024-10-11 01:40:27,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-10-11 01:40:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:27,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:40:27,666 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_2462 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2462 .cse1)) v_ArrVal_2462)) (= .cse2 0) (forall ((v_ArrVal_2463 (Array Int Int))) (or (not (= v_ArrVal_2463 (store .cse3 .cse1 (select v_ArrVal_2463 .cse1)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2463))) (select (select .cse4 .cse2) (+ (select (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4))) 0)))))) (forall ((v_ArrVal_2462 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2462 .cse1)) v_ArrVal_2462)) (forall ((v_ArrVal_2463 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2463))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse5 0) (not (= v_ArrVal_2463 (store .cse3 .cse1 (select v_ArrVal_2463 .cse1)))) (= (select (select .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ .cse5 4)) 0))))))) (forall ((v_ArrVal_2462 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2462))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2462 .cse1)) v_ArrVal_2462)) (= .cse7 0) (forall ((v_ArrVal_2463 (Array Int Int))) (or (= (select (select .cse8 .cse7) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2463) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 4)) 0) (not (= v_ArrVal_2463 (store .cse3 .cse1 (select v_ArrVal_2463 .cse1)))))))))) (forall ((v_ArrVal_2462 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_2462 .cse1)) v_ArrVal_2462)) (forall ((v_ArrVal_2463 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2463) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (= .cse9 0) (= (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_2462))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (+ .cse9 4)) 0) (not (= v_ArrVal_2463 (store .cse3 .cse1 (select v_ArrVal_2463 .cse1))))))))))) is different from false [2024-10-11 01:40:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813342813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:40:27,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:40:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2024-10-11 01:40:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402899743] [2024-10-11 01:40:27,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:40:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:40:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:40:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:40:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=317, Unknown=1, NotChecked=36, Total=420 [2024-10-11 01:40:27,957 INFO L87 Difference]: Start difference. First operand 402 states and 508 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:40:29,436 INFO L93 Difference]: Finished difference Result 659 states and 831 transitions. [2024-10-11 01:40:29,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 01:40:29,437 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 01:40:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:40:29,439 INFO L225 Difference]: With dead ends: 659 [2024-10-11 01:40:29,439 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 01:40:29,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=583, Unknown=1, NotChecked=52, Total=812 [2024-10-11 01:40:29,440 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 157 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 01:40:29,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 437 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 425 Invalid, 0 Unknown, 95 Unchecked, 0.9s Time] [2024-10-11 01:40:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 01:40:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 502. [2024-10-11 01:40:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 500 states have (on average 1.268) internal successors, (634), 501 states have internal predecessors, (634), 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-10-11 01:40:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 634 transitions. [2024-10-11 01:40:29,586 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 634 transitions. Word has length 29 [2024-10-11 01:40:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:40:29,587 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 634 transitions. [2024-10-11 01:40:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:40:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 634 transitions. [2024-10-11 01:40:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 01:40:29,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:40:29,588 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-10-11 01:40:29,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 01:40:29,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 01:40:29,793 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-10-11 01:40:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:40:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1324095270, now seen corresponding path program 1 times [2024-10-11 01:40:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:40:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002840079] [2024-10-11 01:40:29,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:40:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:31,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:31,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:40:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002840079] [2024-10-11 01:40:31,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002840079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:40:31,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742505600] [2024-10-11 01:40:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:40:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:40:31,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:40:31,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:40:31,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 01:40:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:40:31,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-10-11 01:40:31,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:40:31,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 01:40:31,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:31,486 INFO L349 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2024-10-11 01:40:31,487 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 1 case distinctions, treesize of input 33 treesize of output 25 [2024-10-11 01:40:31,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2024-10-11 01:40:31,508 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2024-10-11 01:40:31,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 52 [2024-10-11 01:40:31,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 11 [2024-10-11 01:40:31,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:31,565 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 33 treesize of output 24 [2024-10-11 01:40:31,578 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:40:31,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 01:40:31,588 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 16 treesize of output 11 [2024-10-11 01:40:31,638 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 16 treesize of output 11 [2024-10-11 01:40:31,645 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 11 treesize of output 7 [2024-10-11 01:40:31,650 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 32 treesize of output 23 [2024-10-11 01:40:32,138 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 01:40:32,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 96 [2024-10-11 01:40:32,144 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 27 treesize of output 22 [2024-10-11 01:40:32,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2024-10-11 01:40:32,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 01:40:32,313 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-10-11 01:40:32,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 54 [2024-10-11 01:40:32,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-10-11 01:40:32,510 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 01:40:32,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 46 [2024-10-11 01:40:32,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 01:40:32,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:40:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:40:32,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:40:32,677 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (or (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2663) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0) 4)) (select v_ArrVal_2663 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 8))) (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse0 (select v_ArrVal_2663 .cse0)) v_ArrVal_2663))))) is different from false [2024-10-11 01:40:32,686 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse1 (+ .cse2 4))) (or (not (= v_ArrVal_2663 (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_2663 .cse1)))) (= (select v_ArrVal_2663 (+ 8 .cse2)) (select (select (store |c_#memory_int#1| .cse0 v_ArrVal_2663) (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (+ (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1) 4))))))) is different from false [2024-10-11 01:40:32,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2662 Int) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2660 (Array Int Int)) (v_ArrVal_2658 Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2660)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~bcki~0#1.offset|)) (.cse2 (+ .cse3 4))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2663 .cse2)) v_ArrVal_2663)) (= (select v_ArrVal_2663 (+ 8 .cse3)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (select (select (store .cse0 .cse1 v_ArrVal_2663) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse4 .cse5 v_ArrVal_2658)) .cse1) .cse2)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse6 .cse5 v_ArrVal_2662)) .cse1) .cse2) 4))))))))) is different from false [2024-10-11 01:40:32,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2662 Int) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2660 (Array Int Int)) (v_ArrVal_2658 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_2660)) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ .cse6 4))) (or (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2663 .cse2)) v_ArrVal_2663)) (= (let ((.cse4 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store .cse0 .cse1 v_ArrVal_2663) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 .cse4 v_ArrVal_2658)) .cse1) .cse2)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse5 .cse4 v_ArrVal_2662)) .cse1) .cse2) 4))) (select v_ArrVal_2663 (+ .cse6 8)))))))) is different from false [2024-10-11 01:40:32,776 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2662 Int) (v_ArrVal_2663 (Array Int Int)) (v_ArrVal_2656 Int) (v_ArrVal_2660 (Array Int Int)) (v_ArrVal_2658 Int)) (let ((.cse9 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse9 |c_ULTIMATE.start_main_~item~0#1.offset|)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse9 |c_ULTIMATE.start_main_~item~0#1.base|))) (.cse8 (select .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse5 (select .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~bcki~0#1.base|) .cse9 v_ArrVal_2656)) |c_ULTIMATE.start_main_~bucket~0#1.base| v_ArrVal_2660)) (.cse1 (select .cse5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (+ .cse3 4))) (or (not (= v_ArrVal_2663 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_2663 .cse2)))) (= (select v_ArrVal_2663 (+ .cse3 8)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4))) (select (select (store .cse0 .cse1 v_ArrVal_2663) (select (select (store .cse4 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse5 .cse6 v_ArrVal_2658)) .cse1) .cse2)) (+ (select (select (store .cse7 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse8 .cse6 v_ArrVal_2662)) .cse1) .cse2) 4))))))))))) is different from false [2024-10-11 01:40:33,736 INFO L349 Elim1Store]: treesize reduction 78, result has 58.3 percent of original size [2024-10-11 01:40:33,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 763 treesize of output 749 [2024-10-11 01:40:33,844 INFO L349 Elim1Store]: treesize reduction 236, result has 66.7 percent of original size [2024-10-11 01:40:33,845 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 5273 treesize of output 5343 [2024-10-11 01:40:33,901 INFO L349 Elim1Store]: treesize reduction 442, result has 52.7 percent of original size [2024-10-11 01:40:33,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1303 treesize of output 1528 [2024-10-11 01:40:34,034 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 8 treesize of output 4 [2024-10-11 01:40:34,174 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 15 treesize of output 4 [2024-10-11 01:40:34,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:40:34,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1734 treesize of output 1734 [2024-10-11 01:40:34,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:40:34,713 INFO L349 Elim1Store]: treesize reduction 93, result has 1.1 percent of original size [2024-10-11 01:40:34,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1239 treesize of output 1144 [2024-10-11 01:40:35,411 INFO L349 Elim1Store]: treesize reduction 4605, result has 29.5 percent of original size [2024-10-11 01:40:35,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 2733 treesize of output 3881