./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum20.i --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/reducercommutativity/rangesum20.i', '-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', '66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a'] 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/reducercommutativity/rangesum20.i -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 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:19:20,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:19:20,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:19:20,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:19:20,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:19:20,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:19:20,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:19:20,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:19:20,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:19:20,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:19:20,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:19:20,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:19:20,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:19:20,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:19:20,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:19:20,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:19:20,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:19:20,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:19:20,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:19:20,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:19:20,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:19:20,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:19:20,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:19:20,737 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 -> 66b03bf685aae9720ef4af0fb91907139a878375cd48373b4439b53b2302a22a [2024-11-06 18:19:21,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:19:21,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:19:21,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:19:21,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:19:21,233 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:19:21,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-06 18:19:22,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:19:22,650 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:19:22,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum20.i [2024-11-06 18:19:22,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/075dd2ce8/862bf0bba1ff4460bab66cf0645c9a28/FLAGcd99e63b6 [2024-11-06 18:19:22,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/075dd2ce8/862bf0bba1ff4460bab66cf0645c9a28 [2024-11-06 18:19:22,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:19:22,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:19:22,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:19:22,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:19:22,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:19:22,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40a2490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22, skipping insertion in model container [2024-11-06 18:19:22,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:19:23,092 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-06 18:19:23,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:19:23,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:19:23,117 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/reducercommutativity/rangesum20.i[1465,1478] [2024-11-06 18:19:23,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:19:23,128 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:19:23,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23 WrapperNode [2024-11-06 18:19:23,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:19:23,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:19:23,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:19:23,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:19:23,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,151 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-06 18:19:23,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:19:23,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:19:23,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:19:23,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:19:23,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,160 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,176 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-06 18:19:23,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:19:23,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:19:23,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:19:23,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:19:23,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (1/1) ... [2024-11-06 18:19:23,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:19:23,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:23,217 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 18:19:23,220 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 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 18:19:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:19:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:19:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 18:19:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 18:19:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-06 18:19:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-06 18:19:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 18:19:23,291 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:19:23,292 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:19:23,455 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-06 18:19:23,455 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:19:23,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:19:23,465 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 18:19:23,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:23 BoogieIcfgContainer [2024-11-06 18:19:23,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:19:23,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:19:23,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:19:23,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:19:23,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:19:22" (1/3) ... [2024-11-06 18:19:23,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756c77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:19:23, skipping insertion in model container [2024-11-06 18:19:23,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:23" (2/3) ... [2024-11-06 18:19:23,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6756c77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:19:23, skipping insertion in model container [2024-11-06 18:19:23,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:23" (3/3) ... [2024-11-06 18:19:23,474 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum20.i [2024-11-06 18:19:23,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:19:23,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:19:23,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:19:23,547 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;@1c999537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:19:23,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:19:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 18:19:23,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:23,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:23,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-06 18:19:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839618640] [2024-11-06 18:19:23,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 18:19:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 18:19:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:19:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839618640] [2024-11-06 18:19:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839618640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:23,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:19:23,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:19:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797004404] [2024-11-06 18:19:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:23,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:19:23,844 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:19:23,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:23,870 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-06 18:19:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-06 18:19:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:23,877 INFO L225 Difference]: With dead ends: 54 [2024-11-06 18:19:23,878 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 18:19:23,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:19:23,882 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:23,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 18:19:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-06 18:19:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-06 18:19:23,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-06 18:19:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-06 18:19:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:19:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-06 18:19:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 18:19:23,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:23,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:19:23,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:23,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:23,909 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-06 18:19:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770187895] [2024-11-06 18:19:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-06 18:19:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 18:19:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:24,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770187895] [2024-11-06 18:19:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770187895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402586161] [2024-11-06 18:19:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:24,025 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 18:19:24,026 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 18:19:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:19:24,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:19:24,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402586161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 18:19:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914447000] [2024-11-06 18:19:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:24,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:24,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:24,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:24,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:19:24,156 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:24,176 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-06 18:19:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:24,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-06 18:19:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:24,180 INFO L225 Difference]: With dead ends: 46 [2024-11-06 18:19:24,180 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 18:19:24,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:19:24,180 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:24,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 18:19:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-06 18:19:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-06 18:19:24,187 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-06 18:19:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:24,187 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-06 18:19:24,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-06 18:19:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:19:24,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:24,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:24,201 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 18:19:24,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:24,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-06 18:19:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247505809] [2024-11-06 18:19:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-06 18:19:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 18:19:24,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247505809] [2024-11-06 18:19:24,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247505809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:24,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653438801] [2024-11-06 18:19:24,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:24,548 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 18:19:24,549 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 18:19:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:19:24,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 18:19:24,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653438801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 18:19:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488518768] [2024-11-06 18:19:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:24,651 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:24,666 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-06 18:19:24,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:24,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-06 18:19:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:24,668 INFO L225 Difference]: With dead ends: 44 [2024-11-06 18:19:24,668 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 18:19:24,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:24,669 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:24,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 18:19:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-06 18:19:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-06 18:19:24,678 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-06 18:19:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:24,679 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-06 18:19:24,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-06 18:19:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:19:24,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:24,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:24,693 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 18:19:24,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:24,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:24,883 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-06 18:19:24,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:24,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310562436] [2024-11-06 18:19:24,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 18:19:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310562436] [2024-11-06 18:19:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310562436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025121020] [2024-11-06 18:19:24,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:25,001 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 18:19:25,002 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 18:19:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:19:25,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:19:25,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:25,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025121020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:25,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 18:19:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185651311] [2024-11-06 18:19:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:25,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:25,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:25,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:25,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:25,084 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:25,100 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-06 18:19:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-06 18:19:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:25,101 INFO L225 Difference]: With dead ends: 53 [2024-11-06 18:19:25,101 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 18:19:25,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:25,103 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:25,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:25,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 18:19:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-06 18:19:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-06 18:19:25,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-06 18:19:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:25,111 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-06 18:19:25,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-06 18:19:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:19:25,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:25,112 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:25,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 18:19:25,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-06 18:19:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786249288] [2024-11-06 18:19:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 18:19:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:25,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786249288] [2024-11-06 18:19:25,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786249288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:25,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273030333] [2024-11-06 18:19:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:25,421 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 18:19:25,422 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 18:19:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:19:25,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:19:25,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:19:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273030333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:25,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:25,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-06 18:19:25,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743074292] [2024-11-06 18:19:25,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:25,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:19:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:19:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:19:25,543 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-06 18:19:25,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:25,594 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-06 18:19:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:19:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-06 18:19:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:25,595 INFO L225 Difference]: With dead ends: 69 [2024-11-06 18:19:25,595 INFO L226 Difference]: Without dead ends: 42 [2024-11-06 18:19:25,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:19:25,595 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:25,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-06 18:19:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-06 18:19:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-06 18:19:25,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-11-06 18:19:25,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:25,599 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-06 18:19:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-06 18:19:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-06 18:19:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 18:19:25,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:25,600 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:25,613 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 18:19:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:25,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2024-11-06 18:19:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616490133] [2024-11-06 18:19:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 18:19:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:19:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-06 18:19:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-06 18:19:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616490133] [2024-11-06 18:19:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616490133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984380001] [2024-11-06 18:19:25,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:19:25,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:25,879 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 18:19:25,880 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 18:19:25,953 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:19:25,953 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:25,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:19:25,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-06 18:19:25,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-06 18:19:26,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984380001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:26,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:26,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-06 18:19:26,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861540363] [2024-11-06 18:19:26,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:26,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:19:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:19:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:19:26,069 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:26,126 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-11-06 18:19:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:19:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-06 18:19:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:26,129 INFO L225 Difference]: With dead ends: 86 [2024-11-06 18:19:26,130 INFO L226 Difference]: Without dead ends: 56 [2024-11-06 18:19:26,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:19:26,131 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:26,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-06 18:19:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-06 18:19:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-06 18:19:26,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2024-11-06 18:19:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:26,142 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-06 18:19:26,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-06 18:19:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 18:19:26,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:26,142 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:26,158 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 18:19:26,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:26,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2024-11-06 18:19:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855008094] [2024-11-06 18:19:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:19:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 18:19:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-06 18:19:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-06 18:19:26,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855008094] [2024-11-06 18:19:26,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855008094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042543287] [2024-11-06 18:19:26,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:26,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:26,466 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 18:19:26,467 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 18:19:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 18:19:26,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-06 18:19:26,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-06 18:19:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042543287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:26,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:26,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 24 [2024-11-06 18:19:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419893569] [2024-11-06 18:19:26,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:26,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-06 18:19:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-06 18:19:26,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:19:26,911 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 18:19:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:26,983 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2024-11-06 18:19:26,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 18:19:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-06 18:19:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:26,985 INFO L225 Difference]: With dead ends: 102 [2024-11-06 18:19:26,985 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 18:19:26,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:19:26,988 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:26,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:19:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 18:19:26,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-11-06 18:19:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 68 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-11-06 18:19:26,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 78 [2024-11-06 18:19:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:26,998 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-11-06 18:19:26,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 18:19:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-11-06 18:19:27,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 18:19:27,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:27,000 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 9, 9, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:27,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 18:19:27,201 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,SelfDestructingSolverStorable6 [2024-11-06 18:19:27,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1718843700, now seen corresponding path program 2 times [2024-11-06 18:19:27,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:27,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304633987] [2024-11-06 18:19:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:27,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-06 18:19:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-06 18:19:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-06 18:19:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304633987] [2024-11-06 18:19:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304633987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:27,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933205615] [2024-11-06 18:19:27,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:19:27,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:27,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:27,401 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 18:19:27,402 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 18:19:27,500 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:19:27,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:27,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:19:27,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-06 18:19:27,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-06 18:19:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933205615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:27,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-06 18:19:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257984536] [2024-11-06 18:19:27,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:19:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:19:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:19:27,575 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:19:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:27,613 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2024-11-06 18:19:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:19:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 18:19:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:27,614 INFO L225 Difference]: With dead ends: 113 [2024-11-06 18:19:27,614 INFO L226 Difference]: Without dead ends: 85 [2024-11-06 18:19:27,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:19:27,615 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:27,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-06 18:19:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-06 18:19:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0625) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-06 18:19:27,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 100 [2024-11-06 18:19:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-06 18:19:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:19:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-06 18:19:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 18:19:27,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:27,630 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 18, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:27,645 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 18:19:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:27,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1145442804, now seen corresponding path program 3 times [2024-11-06 18:19:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:27,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787050657] [2024-11-06 18:19:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-06 18:19:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-06 18:19:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 13 proven. 387 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2024-11-06 18:19:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787050657] [2024-11-06 18:19:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787050657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642066704] [2024-11-06 18:19:28,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 18:19:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:28,104 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 18:19:28,105 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 18:19:28,189 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-06 18:19:28,189 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:28,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:19:28,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-06 18:19:28,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2024-11-06 18:19:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642066704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:28,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:28,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2024-11-06 18:19:28,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158794401] [2024-11-06 18:19:28,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:28,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:19:28,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:28,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:19:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:28,292 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 18:19:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:28,339 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-11-06 18:19:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:19:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 136 [2024-11-06 18:19:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:28,341 INFO L225 Difference]: With dead ends: 143 [2024-11-06 18:19:28,341 INFO L226 Difference]: Without dead ends: 103 [2024-11-06 18:19:28,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:28,341 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:28,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 74 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-06 18:19:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-06 18:19:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2024-11-06 18:19:28,347 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 136 [2024-11-06 18:19:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:28,347 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2024-11-06 18:19:28,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 18:19:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2024-11-06 18:19:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-06 18:19:28,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:28,349 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 24, 20, 20, 15, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:28,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 18:19:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:28,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1379176084, now seen corresponding path program 4 times [2024-11-06 18:19:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196994626] [2024-11-06 18:19:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:28,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-06 18:19:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-06 18:19:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 121 proven. 1174 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-11-06 18:19:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196994626] [2024-11-06 18:19:28,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196994626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655446835] [2024-11-06 18:19:28,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 18:19:28,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:28,867 INFO L229 MonitoredProcess]: Starting monitored process 10 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 18:19:28,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 18:19:28,974 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 18:19:28,974 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:28,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:19:28,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 817 proven. 100 refuted. 0 times theorem prover too weak. 1842 trivial. 0 not checked. [2024-11-06 18:19:29,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 121 proven. 1174 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2024-11-06 18:19:29,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655446835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:29,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:29,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-06 18:19:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338348866] [2024-11-06 18:19:29,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:29,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 18:19:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 18:19:29,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:19:29,119 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:19:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:29,153 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2024-11-06 18:19:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:19:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-06 18:19:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:29,154 INFO L225 Difference]: With dead ends: 170 [2024-11-06 18:19:29,154 INFO L226 Difference]: Without dead ends: 112 [2024-11-06 18:19:29,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:19:29,155 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:29,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-06 18:19:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-06 18:19:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 107 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-11-06 18:19:29,167 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 190 [2024-11-06 18:19:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:29,167 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-11-06 18:19:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 18:19:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-11-06 18:19:29,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-06 18:19:29,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:29,168 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 33, 20, 20, 15, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:29,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-06 18:19:29,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:29,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:29,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:29,369 INFO L85 PathProgramCache]: Analyzing trace with hash 322135401, now seen corresponding path program 5 times [2024-11-06 18:19:29,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:29,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316380332] [2024-11-06 18:19:29,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:29,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-06 18:19:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-06 18:19:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3943 trivial. 0 not checked. [2024-11-06 18:19:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316380332] [2024-11-06 18:19:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316380332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370411665] [2024-11-06 18:19:29,534 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 18:19:29,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:29,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:29,536 INFO L229 MonitoredProcess]: Starting monitored process 11 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 18:19:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 18:19:29,632 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-06 18:19:29,632 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:29,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:19:29,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 1785 proven. 40 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2024-11-06 18:19:29,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3947 backedges. 181 proven. 602 refuted. 0 times theorem prover too weak. 3164 trivial. 0 not checked. [2024-11-06 18:19:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370411665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:29,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2024-11-06 18:19:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321236446] [2024-11-06 18:19:29,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:29,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:19:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:19:29,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:29,816 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:29,866 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2024-11-06 18:19:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:19:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 217 [2024-11-06 18:19:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:29,868 INFO L225 Difference]: With dead ends: 194 [2024-11-06 18:19:29,868 INFO L226 Difference]: Without dead ends: 127 [2024-11-06 18:19:29,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 426 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:29,870 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:29,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-06 18:19:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-06 18:19:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2024-11-06 18:19:29,883 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 217 [2024-11-06 18:19:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:29,883 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2024-11-06 18:19:29,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2024-11-06 18:19:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-06 18:19:29,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:29,886 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:29,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-06 18:19:30,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:30,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:30,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash -575874009, now seen corresponding path program 6 times [2024-11-06 18:19:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965206854] [2024-11-06 18:19:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:30,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:30,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 18:19:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-06 18:19:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965206854] [2024-11-06 18:19:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965206854] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419252860] [2024-11-06 18:19:30,364 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-06 18:19:30,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:30,366 INFO L229 MonitoredProcess]: Starting monitored process 12 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 18:19:30,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 18:19:30,497 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2024-11-06 18:19:30,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:30,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:19:30,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 2490 proven. 9 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-06 18:19:30,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5914 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419252860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:30,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:30,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-06 18:19:30,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530195513] [2024-11-06 18:19:30,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:19:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:30,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:19:30,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:19:30,568 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:30,595 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2024-11-06 18:19:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:19:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 255 [2024-11-06 18:19:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:30,597 INFO L225 Difference]: With dead ends: 207 [2024-11-06 18:19:30,597 INFO L226 Difference]: Without dead ends: 136 [2024-11-06 18:19:30,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:19:30,598 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:30,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-06 18:19:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-06 18:19:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.099236641221374) internal successors, (144), 131 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2024-11-06 18:19:30,607 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 255 [2024-11-06 18:19:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:30,608 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2024-11-06 18:19:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2024-11-06 18:19:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-06 18:19:30,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:30,613 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:30,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-06 18:19:30,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 18:19:30,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -545735139, now seen corresponding path program 7 times [2024-11-06 18:19:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484802494] [2024-11-06 18:19:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 18:19:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-06 18:19:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484802494] [2024-11-06 18:19:31,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484802494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946797953] [2024-11-06 18:19:31,142 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-06 18:19:31,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:31,144 INFO L229 MonitoredProcess]: Starting monitored process 13 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 18:19:31,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-06 18:19:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:31,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:19:31,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:31,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 2490 proven. 64 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-06 18:19:31,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5969 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:31,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946797953] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:31,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:31,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-06 18:19:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811705361] [2024-11-06 18:19:31,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-06 18:19:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-06 18:19:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:19:31,477 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:31,533 INFO L93 Difference]: Finished difference Result 227 states and 261 transitions. [2024-11-06 18:19:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-06 18:19:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 265 [2024-11-06 18:19:31,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:31,535 INFO L225 Difference]: With dead ends: 227 [2024-11-06 18:19:31,535 INFO L226 Difference]: Without dead ends: 156 [2024-11-06 18:19:31,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:19:31,536 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:31,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 148 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-06 18:19:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-06 18:19:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.086092715231788) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2024-11-06 18:19:31,541 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 265 [2024-11-06 18:19:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2024-11-06 18:19:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2024-11-06 18:19:31,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-06 18:19:31,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:31,544 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:31,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-06 18:19:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:31,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 762343305, now seen corresponding path program 8 times [2024-11-06 18:19:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862928042] [2024-11-06 18:19:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-06 18:19:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-06 18:19:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-06 18:19:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:32,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862928042] [2024-11-06 18:19:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862928042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884312305] [2024-11-06 18:19:32,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:19:32,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:32,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:32,324 INFO L229 MonitoredProcess]: Starting monitored process 14 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 18:19:32,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-06 18:19:32,516 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:19:32,517 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:32,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 18:19:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 2490 proven. 324 refuted. 0 times theorem prover too weak. 3415 trivial. 0 not checked. [2024-11-06 18:19:32,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6229 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 5905 trivial. 0 not checked. [2024-11-06 18:19:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884312305] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:32,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 22 [2024-11-06 18:19:32,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698391297] [2024-11-06 18:19:32,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-06 18:19:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:32,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-06 18:19:32,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-06 18:19:32,779 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:32,830 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2024-11-06 18:19:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-06 18:19:32,830 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 285 [2024-11-06 18:19:32,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:32,831 INFO L225 Difference]: With dead ends: 229 [2024-11-06 18:19:32,831 INFO L226 Difference]: Without dead ends: 158 [2024-11-06 18:19:32,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 556 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2024-11-06 18:19:32,832 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:32,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-06 18:19:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-06 18:19:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2024-11-06 18:19:32,837 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 285 [2024-11-06 18:19:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:32,837 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2024-11-06 18:19:32,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2024-11-06 18:19:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-06 18:19:32,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:32,841 INFO L215 NwaCegarLoop]: trace histogram [60, 60, 33, 27, 20, 20, 19, 19, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:32,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-06 18:19:33,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:33,042 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:33,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:33,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1541531655, now seen corresponding path program 9 times [2024-11-06 18:19:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:33,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834377763] [2024-11-06 18:19:33,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 18:19:33,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929802074] [2024-11-06 18:19:33,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 18:19:33,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:33,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:33,476 INFO L229 MonitoredProcess]: Starting monitored process 15 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 18:19:33,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-06 18:19:43,794 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2024-11-06 18:19:43,794 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 18:19:43,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:19:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:19:45,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 18:19:45,953 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:19:45,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:19:46,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-06 18:19:46,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 18:19:46,159 INFO L407 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1] [2024-11-06 18:19:46,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:19:46,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:19:46 BoogieIcfgContainer [2024-11-06 18:19:46,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:19:46,276 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:19:46,276 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:19:46,276 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:19:46,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:23" (3/4) ... [2024-11-06 18:19:46,278 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 18:19:46,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:19:46,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:19:46,377 INFO L158 Benchmark]: Toolchain (without parser) took 23402.81ms. Allocated memory was 109.1MB in the beginning and 285.2MB in the end (delta: 176.2MB). Free memory was 84.9MB in the beginning and 197.6MB in the end (delta: -112.7MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-06 18:19:46,377 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:19:46,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.85ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 73.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:46,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.09ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 72.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:19:46,378 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:46,378 INFO L158 Benchmark]: RCFGBuilder took 280.04ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 58.8MB in the end (delta: 11.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:19:46,378 INFO L158 Benchmark]: TraceAbstraction took 22808.05ms. Allocated memory was 109.1MB in the beginning and 285.2MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 208.2MB in the end (delta: -150.1MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-11-06 18:19:46,378 INFO L158 Benchmark]: Witness Printer took 99.15ms. Allocated memory is still 285.2MB. Free memory was 208.2MB in the beginning and 197.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:46,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.85ms. Allocated memory is still 109.1MB. Free memory was 84.7MB in the beginning and 73.6MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.09ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 72.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 109.1MB. Free memory was 72.2MB in the beginning and 70.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 280.04ms. Allocated memory is still 109.1MB. Free memory was 70.6MB in the beginning and 58.8MB in the end (delta: 11.8MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 22808.05ms. Allocated memory was 109.1MB in the beginning and 285.2MB in the end (delta: 176.2MB). Free memory was 58.2MB in the beginning and 208.2MB in the end (delta: -150.1MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * Witness Printer took 99.15ms. Allocated memory is still 285.2MB. Free memory was 208.2MB in the beginning and 197.6MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[20]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=11, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=12, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=13, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=14, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=15, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=16, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=17, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=18, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=19, x={4:0}] [L17] COND TRUE i < 20 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=20, x={4:0}] [L17] COND FALSE !(i < 20) VAL [x={4:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={4:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=21, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=8, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-6, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-24, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-19, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-1, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-1, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-1, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=0, x={4:0}] [L49] RET, EXPR rangesum(x) VAL [x={4:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=21, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=21, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=8, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=8, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-6, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-6, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-24, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-24, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-19, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-19, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-10, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-10, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-1, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-1, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-1, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=0, x={4:0}] [L52] RET, EXPR rangesum(x) VAL [ret=0, x={4:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=10, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=11, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=12, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=13, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=14, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=15, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=16, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=17, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=18, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND TRUE i<20 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=19, ret2=0, ret=0, temp=-15, x={4:0}] [L54] COND FALSE !(i<20 -1) VAL [ret2=0, ret=0, temp=-15, x={4:0}] [L57] x[20 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={4:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=0, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=1, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=2, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=3, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=4, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=5, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=6, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=7, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=8, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=9, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L29] COND FALSE !(i > 20/2) VAL [\old(x)={4:0}, cnt=0, i=10, ret=0, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=0, i=11, ret=0, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=1, i=11, ret=11, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=1, i=12, ret=11, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=1, i=12, ret=11, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=2, i=12, ret=-2, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=2, i=13, ret=-2, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=2, i=13, ret=-2, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=3, i=13, ret=-16, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=3, i=14, ret=-16, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=3, i=14, ret=-16, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=4, i=14, ret=-34, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=4, i=15, ret=-34, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=4, i=15, ret=-34, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=5, i=15, ret=-29, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=5, i=16, ret=-29, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=5, i=16, ret=-29, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=6, i=16, ret=-26, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=6, i=17, ret=-26, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=6, i=17, ret=-26, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=7, i=17, ret=-20, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=7, i=18, ret=-20, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=7, i=18, ret=-20, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=8, i=18, ret=-11, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=8, i=19, ret=-11, x={4:0}] [L28] COND TRUE i < 20 VAL [\old(x)={4:0}, cnt=8, i=19, ret=-11, x={4:0}] [L29] COND TRUE i > 20/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={4:0}, cnt=9, i=19, ret=-26, x={4:0}] [L28] i++ VAL [\old(x)={4:0}, cnt=9, i=20, ret=-26, x={4:0}] [L28] COND FALSE !(i < 20) VAL [\old(x)={4:0}, cnt=9, ret=-26, x={4:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={4:0}, \result=-2, x={4:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=0, ret=0, x={4:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={4:0}] [L61] reach_error() VAL [x={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 15, TraceHistogramMax: 60, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 378 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3529 GetRequests, 3351 SyntacticMatches, 32 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=14, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 11.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 4079 NumberOfCodeBlocks, 3543 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 5093 ConstructedInterpolants, 0 QuantifiedInterpolants, 6007 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3843 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 37 InterpolantComputations, 4 PerfectInterpolantSequences, 75623/80780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 18:19:46,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE