./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/loops/insertion_sort-1-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/insertion_sort-1-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:32:11,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:32:11,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:32:11,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:32:11,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:32:11,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:32:11,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:32:11,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:32:11,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:32:11,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:32:11,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:32:11,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:32:11,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:32:11,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:32:11,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:32:11,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:32:11,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:32:11,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:32:11,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:32:11,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:32:11,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:32:11,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:32:11,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:32:11,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:32:11,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:32:11,514 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2024-11-06 22:32:11,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:32:11,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:32:11,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:32:11,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:32:11,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:32:11,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-06 22:32:13,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:32:13,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:32:13,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2024-11-06 22:32:13,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1c906498/69e9c3bf17ce41e8b00901273845acc9/FLAG131f941ad [2024-11-06 22:32:13,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1c906498/69e9c3bf17ce41e8b00901273845acc9 [2024-11-06 22:32:13,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:32:13,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:32:13,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:32:13,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:32:13,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:32:13,444 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e95aff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13, skipping insertion in model container [2024-11-06 22:32:13,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:32:13,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c[330,343] [2024-11-06 22:32:13,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:32:13,619 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:32:13,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c[330,343] [2024-11-06 22:32:13,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:32:13,651 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:32:13,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13 WrapperNode [2024-11-06 22:32:13,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:32:13,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:32:13,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:32:13,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:32:13,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,691 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-11-06 22:32:13,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:32:13,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:32:13,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:32:13,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:32:13,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,716 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-06 22:32:13,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:32:13,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:32:13,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:32:13,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:32:13,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (1/1) ... [2024-11-06 22:32:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:32:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:13,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:32:13,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:32:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:32:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:32:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:32:13,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:32:13,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:32:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:32:13,857 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:32:13,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:32:14,016 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-06 22:32:14,016 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:32:14,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:32:14,024 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-06 22:32:14,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:14 BoogieIcfgContainer [2024-11-06 22:32:14,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:32:14,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:32:14,026 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:32:14,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:32:14,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:32:13" (1/3) ... [2024-11-06 22:32:14,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b9a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:14, skipping insertion in model container [2024-11-06 22:32:14,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:13" (2/3) ... [2024-11-06 22:32:14,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b9a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:14, skipping insertion in model container [2024-11-06 22:32:14,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:14" (3/3) ... [2024-11-06 22:32:14,033 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-1-2.c [2024-11-06 22:32:14,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:32:14,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:32:14,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:32:14,093 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;@6306c575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:32:14,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:32:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 22:32:14,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:14,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:14,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1491357889, now seen corresponding path program 1 times [2024-11-06 22:32:14,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:14,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935357982] [2024-11-06 22:32:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:14,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935357982] [2024-11-06 22:32:14,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935357982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:32:14,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:32:14,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:32:14,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919352516] [2024-11-06 22:32:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:32:14,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:32:14,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:32:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:32:14,269 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:14,283 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2024-11-06 22:32:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:32:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-06 22:32:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:14,289 INFO L225 Difference]: With dead ends: 45 [2024-11-06 22:32:14,289 INFO L226 Difference]: Without dead ends: 21 [2024-11-06 22:32:14,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:32:14,294 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:14,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:32:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-06 22:32:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-06 22:32:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-11-06 22:32:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-06 22:32:14,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 10 [2024-11-06 22:32:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:14,320 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-06 22:32:14,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-06 22:32:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 22:32:14,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:14,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:14,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:32:14,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:14,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:14,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1773554617, now seen corresponding path program 1 times [2024-11-06 22:32:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813229564] [2024-11-06 22:32:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:14,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813229564] [2024-11-06 22:32:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813229564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:32:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:32:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:32:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620006474] [2024-11-06 22:32:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:32:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:32:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:32:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:32:14,568 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:14,629 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-06 22:32:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:32:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-06 22:32:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:14,632 INFO L225 Difference]: With dead ends: 37 [2024-11-06 22:32:14,632 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 22:32:14,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:32:14,633 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:14,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:32:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 22:32:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2024-11-06 22:32:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-06 22:32:14,639 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2024-11-06 22:32:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:14,639 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-06 22:32:14,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-06 22:32:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-06 22:32:14,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:14,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:14,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:32:14,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:14,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 385530252, now seen corresponding path program 1 times [2024-11-06 22:32:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:14,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203607001] [2024-11-06 22:32:14,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203607001] [2024-11-06 22:32:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203607001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:32:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:32:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 22:32:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576457497] [2024-11-06 22:32:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:32:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 22:32:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:14,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 22:32:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:32:14,888 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:14,923 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-06 22:32:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 22:32:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-06 22:32:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:14,924 INFO L225 Difference]: With dead ends: 41 [2024-11-06 22:32:14,924 INFO L226 Difference]: Without dead ends: 24 [2024-11-06 22:32:14,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 22:32:14,925 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:14,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:32:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-06 22:32:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-06 22:32:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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-11-06 22:32:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-06 22:32:14,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2024-11-06 22:32:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-06 22:32:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-06 22:32:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-06 22:32:14,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:14,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:32:14,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1021685782, now seen corresponding path program 1 times [2024-11-06 22:32:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793361744] [2024-11-06 22:32:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793361744] [2024-11-06 22:32:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793361744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323919451] [2024-11-06 22:32:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:15,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:32:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:15,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 22:32:15,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:15,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323919451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:15,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-06 22:32:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406206655] [2024-11-06 22:32:15,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:15,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 22:32:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 22:32:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:32:15,414 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-11-06 22:32:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:15,478 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-11-06 22:32:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:32:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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 18 [2024-11-06 22:32:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:15,479 INFO L225 Difference]: With dead ends: 50 [2024-11-06 22:32:15,479 INFO L226 Difference]: Without dead ends: 33 [2024-11-06 22:32:15,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-06 22:32:15,482 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:15,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:32:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-06 22:32:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-11-06 22:32:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 22:32:15,488 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2024-11-06 22:32:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:15,488 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 22:32:15,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-11-06 22:32:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 22:32:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-06 22:32:15,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:15,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:15,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 22:32:15,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:15,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:15,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash -441596216, now seen corresponding path program 2 times [2024-11-06 22:32:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:15,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017519390] [2024-11-06 22:32:15,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:15,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017519390] [2024-11-06 22:32:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017519390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033937293] [2024-11-06 22:32:16,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:32:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:16,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:16,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:32:16,707 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:32:16,707 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:32:16,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-06 22:32:16,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:16,907 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-11-06 22:32:16,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:16,971 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 26 treesize of output 10 [2024-11-06 22:32:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:32:16,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:17,155 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 43 treesize of output 37 [2024-11-06 22:32:17,178 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-06 22:32:17,178 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 73 treesize of output 66 [2024-11-06 22:32:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:32:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033937293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:17,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 25 [2024-11-06 22:32:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39115522] [2024-11-06 22:32:17,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 22:32:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 22:32:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2024-11-06 22:32:17,269 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:17,936 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2024-11-06 22:32:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-06 22:32:17,937 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-11-06 22:32:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:17,938 INFO L225 Difference]: With dead ends: 95 [2024-11-06 22:32:17,938 INFO L226 Difference]: Without dead ends: 80 [2024-11-06 22:32:17,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 22:32:17,940 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 141 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:17,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 111 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 22:32:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-06 22:32:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 42. [2024-11-06 22:32:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-06 22:32:17,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 20 [2024-11-06 22:32:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-06 22:32:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-06 22:32:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:32:17,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:17,955 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] [2024-11-06 22:32:17,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 22:32:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:18,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1096856990, now seen corresponding path program 1 times [2024-11-06 22:32:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686358597] [2024-11-06 22:32:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686358597] [2024-11-06 22:32:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686358597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672091094] [2024-11-06 22:32:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:18,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:18,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:18,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:18,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 22:32:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:18,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 22:32:18,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:18,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672091094] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:18,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-06 22:32:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992190844] [2024-11-06 22:32:18,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:18,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:32:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:32:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:32:18,745 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:18,892 INFO L93 Difference]: Finished difference Result 132 states and 172 transitions. [2024-11-06 22:32:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 22:32:18,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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-11-06 22:32:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:18,894 INFO L225 Difference]: With dead ends: 132 [2024-11-06 22:32:18,895 INFO L226 Difference]: Without dead ends: 93 [2024-11-06 22:32:18,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-11-06 22:32:18,896 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 75 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:18,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 165 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:32:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-06 22:32:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2024-11-06 22:32:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2024-11-06 22:32:18,913 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 24 [2024-11-06 22:32:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:18,913 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2024-11-06 22:32:18,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2024-11-06 22:32:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-06 22:32:18,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:18,914 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] [2024-11-06 22:32:18,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 22:32:19,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:19,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1110592866, now seen corresponding path program 1 times [2024-11-06 22:32:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449999026] [2024-11-06 22:32:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449999026] [2024-11-06 22:32:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449999026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314655863] [2024-11-06 22:32:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:19,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:19,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:19,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 22:32:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:19,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 22:32:19,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:19,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-11-06 22:32:20,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:20,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-06 22:32:20,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:20,204 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 32 treesize of output 12 [2024-11-06 22:32:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:32:20,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:20,678 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 64 treesize of output 56 [2024-11-06 22:32:20,689 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-06 22:32:20,690 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 334 treesize of output 282 [2024-11-06 22:32:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 22:32:20,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314655863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:20,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:20,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 37 [2024-11-06 22:32:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000407008] [2024-11-06 22:32:20,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:20,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-06 22:32:20,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:20,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-06 22:32:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2024-11-06 22:32:20,755 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:29,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-06 22:32:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:31,849 INFO L93 Difference]: Finished difference Result 158 states and 207 transitions. [2024-11-06 22:32:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-06 22:32:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 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 25 [2024-11-06 22:32:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:31,851 INFO L225 Difference]: With dead ends: 158 [2024-11-06 22:32:31,852 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 22:32:31,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=805, Invalid=4744, Unknown=1, NotChecked=0, Total=5550 [2024-11-06 22:32:31,856 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 137 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:31,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 99 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 22:32:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 22:32:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 45. [2024-11-06 22:32:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-11-06 22:32:31,871 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 25 [2024-11-06 22:32:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-11-06 22:32:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-06 22:32:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 22:32:31,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:31,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:31,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 22:32:32,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-06 22:32:32,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash 820049039, now seen corresponding path program 2 times [2024-11-06 22:32:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:32,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110094450] [2024-11-06 22:32:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110094450] [2024-11-06 22:32:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110094450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3448316] [2024-11-06 22:32:32,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 22:32:32,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:32,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:32,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:32,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 22:32:32,817 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 22:32:32,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:32:32,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 22:32:32,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:33,019 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-11-06 22:32:33,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:33,149 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 26 treesize of output 10 [2024-11-06 22:32:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:33,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:33,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-06 22:32:33,324 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-06 22:32:33,324 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 69 treesize of output 58 [2024-11-06 22:32:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 22:32:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3448316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:33,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 26 [2024-11-06 22:32:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430754397] [2024-11-06 22:32:33,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-06 22:32:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-06 22:32:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-06 22:32:33,351 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:34,019 INFO L93 Difference]: Finished difference Result 136 states and 174 transitions. [2024-11-06 22:32:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 22:32:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 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 32 [2024-11-06 22:32:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:34,021 INFO L225 Difference]: With dead ends: 136 [2024-11-06 22:32:34,021 INFO L226 Difference]: Without dead ends: 114 [2024-11-06 22:32:34,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1249, Unknown=0, NotChecked=0, Total=1482 [2024-11-06 22:32:34,022 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:34,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 303 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 22:32:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-06 22:32:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2024-11-06 22:32:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2024-11-06 22:32:34,030 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 32 [2024-11-06 22:32:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:34,031 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2024-11-06 22:32:34,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2024-11-06 22:32:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 22:32:34,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:34,032 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:34,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 22:32:34,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:34,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:34,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1076471781, now seen corresponding path program 3 times [2024-11-06 22:32:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866934181] [2024-11-06 22:32:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:34,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 22:32:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:34,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866934181] [2024-11-06 22:32:34,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866934181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:34,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203595834] [2024-11-06 22:32:34,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 22:32:34,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:34,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:34,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:34,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 22:32:34,560 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 22:32:34,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 22:32:34,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 22:32:34,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 22:32:34,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 22:32:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203595834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:34,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2024-11-06 22:32:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23446597] [2024-11-06 22:32:34,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 22:32:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 22:32:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-06 22:32:34,933 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:35,127 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-06 22:32:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 22:32:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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 36 [2024-11-06 22:32:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:35,128 INFO L225 Difference]: With dead ends: 221 [2024-11-06 22:32:35,129 INFO L226 Difference]: Without dead ends: 169 [2024-11-06 22:32:35,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-06 22:32:35,130 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 65 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:35,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 329 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 22:32:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-06 22:32:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2024-11-06 22:32:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.295774647887324) internal successors, (184), 142 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2024-11-06 22:32:35,152 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 36 [2024-11-06 22:32:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:35,152 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2024-11-06 22:32:35,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2024-11-06 22:32:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 22:32:35,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:35,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:35,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-06 22:32:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-06 22:32:35,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash 948644129, now seen corresponding path program 1 times [2024-11-06 22:32:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226030587] [2024-11-06 22:32:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:36,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226030587] [2024-11-06 22:32:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226030587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686926618] [2024-11-06 22:32:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:36,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:36,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:36,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:36,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 22:32:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:36,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-06 22:32:36,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:36,501 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 20 [2024-11-06 22:32:36,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:36,709 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 40 treesize of output 20 [2024-11-06 22:32:36,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:36,840 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 28 treesize of output 12 [2024-11-06 22:32:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:36,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:37,317 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 74 treesize of output 66 [2024-11-06 22:32:37,336 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-06 22:32:37,336 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 252 treesize of output 216 [2024-11-06 22:32:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 22:32:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686926618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:37,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 43 [2024-11-06 22:32:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943793155] [2024-11-06 22:32:37,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:37,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-06 22:32:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:37,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-06 22:32:37,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1588, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 22:32:37,498 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:32:40,056 INFO L93 Difference]: Finished difference Result 311 states and 412 transitions. [2024-11-06 22:32:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-06 22:32:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 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 37 [2024-11-06 22:32:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:32:40,058 INFO L225 Difference]: With dead ends: 311 [2024-11-06 22:32:40,058 INFO L226 Difference]: Without dead ends: 204 [2024-11-06 22:32:40,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=788, Invalid=5374, Unknown=0, NotChecked=0, Total=6162 [2024-11-06 22:32:40,061 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 22:32:40,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 408 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 22:32:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-06 22:32:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2024-11-06 22:32:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2348484848484849) internal successors, (163), 132 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2024-11-06 22:32:40,083 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 37 [2024-11-06 22:32:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:32:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2024-11-06 22:32:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:32:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2024-11-06 22:32:40,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:32:40,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:32:40,085 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:32:40,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 22:32:40,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:40,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:32:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:32:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash -45413167, now seen corresponding path program 1 times [2024-11-06 22:32:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:32:40,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156501368] [2024-11-06 22:32:40,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:32:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:32:41,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:32:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156501368] [2024-11-06 22:32:41,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156501368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:32:41,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789396635] [2024-11-06 22:32:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:32:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:32:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:32:41,846 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:32:41,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 22:32:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:32:41,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-06 22:32:41,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:32:42,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:42,133 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 27 treesize of output 18 [2024-11-06 22:32:42,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:42,175 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 1 case distinctions, treesize of input 27 treesize of output 25 [2024-11-06 22:32:42,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:42,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 28 [2024-11-06 22:32:42,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:42,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:32:42,457 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-11-06 22:32:42,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 34 [2024-11-06 22:32:42,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:32:42,561 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 26 treesize of output 10 [2024-11-06 22:32:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:32:42,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:32:51,727 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 96 treesize of output 82 [2024-11-06 22:32:51,747 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-11-06 22:32:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 294 treesize of output 214 [2024-11-06 22:32:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 25 refuted. 1 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 22:32:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789396635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 22:32:59,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 22:32:59,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 20] total 54 [2024-11-06 22:32:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830842748] [2024-11-06 22:32:59,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 22:32:59,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-06 22:32:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:32:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-06 22:32:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2501, Unknown=4, NotChecked=0, Total=2862 [2024-11-06 22:32:59,830 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 54 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:33:05,469 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-11-06 22:33:07,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-06 22:33:28,079 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-11-06 22:33:32,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse15 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse0 (< 2 |c_ULTIMATE.start_main_~j~0#1|)) (.cse6 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse15 4)) (.cse7 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse15)) (.cse8 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (- 4) .cse15)) (.cse1 (< |c_ULTIMATE.start_main_~j~0#1| 1)) (.cse3 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 8)) (.cse10 (+ .cse12 |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse9 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (or .cse0 .cse1 (forall ((v_ArrVal_193 Int)) (let ((.cse5 (store .cse9 .cse10 |c_ULTIMATE.start_main_~key~0#1|))) (or (let ((.cse2 (store (store .cse5 .cse6 (select .cse5 .cse7)) .cse7 v_ArrVal_193))) (< (select .cse2 .cse3) (+ (select .cse2 .cse4) 1))) (< (select .cse5 .cse8) v_ArrVal_193))))) (or .cse0 .cse1 (= |c_ULTIMATE.start_main_~j~0#1| 1)) (let ((.cse11 (store .cse9 (+ .cse12 4) |c_ULTIMATE.start_main_~key~0#1|))) (<= (select .cse11 4) (select .cse11 8))) (or .cse0 (forall ((v_ArrVal_193 Int)) (or (let ((.cse13 (store (store .cse9 .cse6 (select .cse9 .cse7)) .cse7 v_ArrVal_193))) (< (select .cse13 .cse3) (+ (select .cse13 .cse4) 1))) (< (select .cse9 .cse8) v_ArrVal_193))) .cse1) (forall ((|ULTIMATE.start_main_~key~0#1| Int)) (let ((.cse14 (store .cse9 .cse10 |ULTIMATE.start_main_~key~0#1|))) (< (select .cse14 .cse3) (+ (select .cse14 .cse4) 1)))) (<= (select .cse9 4) (select .cse9 8)) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0)))) is different from false [2024-11-06 22:33:36,167 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]