./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.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', '211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc'] 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.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 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:29:02,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:29:02,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:29:02,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:29:02,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:29:02,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:29:02,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:29:02,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:29:02,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:29:02,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:29:02,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:29:02,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:29:02,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:29:02,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:29:02,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:29:02,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:29:02,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:29:02,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:29:02,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:29:02,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:29:02,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:29:02,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:29:02,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:29:02,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:29:02,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:29:02,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:29:02,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:29:02,177 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 -> 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc [2024-11-07 08:29:02,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:29:02,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:29:02,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:29:02,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:29:02,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:29:02,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-07 08:29:03,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:29:04,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:29:04,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-07 08:29:04,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d935b47cc/90b5d476b4c542229cce142596f3d04a/FLAG8c19667ec [2024-11-07 08:29:04,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d935b47cc/90b5d476b4c542229cce142596f3d04a [2024-11-07 08:29:04,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:29:04,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:29:04,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:29:04,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:29:04,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:29:04,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc5a444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04, skipping insertion in model container [2024-11-07 08:29:04,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:29:04,426 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2024-11-07 08:29:04,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:29:04,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:29:04,508 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2024-11-07 08:29:04,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:29:04,558 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:29:04,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04 WrapperNode [2024-11-07 08:29:04,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:29:04,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:29:04,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:29:04,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:29:04,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,612 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-07 08:29:04,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:29:04,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:29:04,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:29:04,618 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:29:04,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:29:04,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:29:04,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:29:04,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:29:04,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:29:04,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (1/1) ... [2024-11-07 08:29:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:29:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:04,710 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-07 08:29:04,719 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-07 08:29:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:29:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:29:04,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:29:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:29:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:29:04,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:29:04,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:29:04,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:29:05,058 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 08:29:05,059 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:29:05,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:29:05,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:29:05,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:05 BoogieIcfgContainer [2024-11-07 08:29:05,068 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:29:05,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:29:05,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:29:05,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:29:05,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:29:04" (1/3) ... [2024-11-07 08:29:05,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a042b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:29:05, skipping insertion in model container [2024-11-07 08:29:05,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:29:04" (2/3) ... [2024-11-07 08:29:05,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a042b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:29:05, skipping insertion in model container [2024-11-07 08:29:05,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:05" (3/3) ... [2024-11-07 08:29:05,078 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2024-11-07 08:29:05,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:29:05,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:29:05,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:29:05,169 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;@43ed3ad5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:29:05,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:29:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 08:29:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 08:29:05,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:05,184 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:05,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:05,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash 816987956, now seen corresponding path program 1 times [2024-11-07 08:29:05,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:05,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635971472] [2024-11-07 08:29:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635971472] [2024-11-07 08:29:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635971472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:05,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:05,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:29:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593479156] [2024-11-07 08:29:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:29:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:05,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:29:05,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:29:05,500 INFO L87 Difference]: Start difference. First operand has 48 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 08:29:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:05,521 INFO L93 Difference]: Finished difference Result 87 states and 135 transitions. [2024-11-07 08:29:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:29:05,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-07 08:29:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:05,529 INFO L225 Difference]: With dead ends: 87 [2024-11-07 08:29:05,529 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 08:29:05,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:29:05,535 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:05,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:29:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 08:29:05,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-07 08:29:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 08:29:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2024-11-07 08:29:05,570 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 58 [2024-11-07 08:29:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:05,570 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2024-11-07 08:29:05,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 08:29:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2024-11-07 08:29:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-07 08:29:05,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:05,573 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:05,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:29:05,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:05,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:05,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1731713732, now seen corresponding path program 1 times [2024-11-07 08:29:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856413891] [2024-11-07 08:29:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:06,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:06,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856413891] [2024-11-07 08:29:06,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856413891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:06,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:29:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095379690] [2024-11-07 08:29:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:06,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:29:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:06,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:29:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:29:06,366 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:06,632 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2024-11-07 08:29:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:29:06,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2024-11-07 08:29:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:06,637 INFO L225 Difference]: With dead ends: 141 [2024-11-07 08:29:06,637 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 08:29:06,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:29:06,638 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 84 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:06,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 185 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 08:29:06,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2024-11-07 08:29:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 08:29:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2024-11-07 08:29:06,662 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 58 [2024-11-07 08:29:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:06,663 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2024-11-07 08:29:06,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2024-11-07 08:29:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:29:06,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:06,666 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:29:06,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:06,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1626275922, now seen corresponding path program 1 times [2024-11-07 08:29:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897518629] [2024-11-07 08:29:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897518629] [2024-11-07 08:29:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897518629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:07,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 08:29:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450228354] [2024-11-07 08:29:07,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:07,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:29:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:29:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:29:07,155 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:07,452 INFO L93 Difference]: Finished difference Result 212 states and 281 transitions. [2024-11-07 08:29:07,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:29:07,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:29:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:07,455 INFO L225 Difference]: With dead ends: 212 [2024-11-07 08:29:07,455 INFO L226 Difference]: Without dead ends: 173 [2024-11-07 08:29:07,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:29:07,456 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 89 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:07,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 221 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-07 08:29:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2024-11-07 08:29:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.2717391304347827) internal successors, (117), 92 states have internal predecessors, (117), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:29:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2024-11-07 08:29:07,490 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 159 transitions. Word has length 59 [2024-11-07 08:29:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:07,491 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 159 transitions. [2024-11-07 08:29:07,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2024-11-07 08:29:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:29:07,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:07,492 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:07,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:29:07,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash 2081885360, now seen corresponding path program 1 times [2024-11-07 08:29:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460857090] [2024-11-07 08:29:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460857090] [2024-11-07 08:29:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460857090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:29:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076684785] [2024-11-07 08:29:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:07,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:29:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:29:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:29:07,572 INFO L87 Difference]: Start difference. First operand 117 states and 159 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:07,597 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2024-11-07 08:29:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:29:07,598 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), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:29:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:07,600 INFO L225 Difference]: With dead ends: 186 [2024-11-07 08:29:07,600 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 08:29:07,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-07 08:29:07,601 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:07,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 117 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:29:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 08:29:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2024-11-07 08:29:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 96 states have internal predecessors, (121), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:29:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2024-11-07 08:29:07,626 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 59 [2024-11-07 08:29:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:07,626 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2024-11-07 08:29:07,630 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), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2024-11-07 08:29:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-07 08:29:07,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:07,632 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:07,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:29:07,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:07,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1824120838, now seen corresponding path program 1 times [2024-11-07 08:29:07,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:07,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318724917] [2024-11-07 08:29:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:07,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318724917] [2024-11-07 08:29:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318724917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:29:07,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268326454] [2024-11-07 08:29:07,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:29:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:07,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:29:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:29:07,958 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:08,091 INFO L93 Difference]: Finished difference Result 275 states and 369 transitions. [2024-11-07 08:29:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:29:08,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-07 08:29:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:08,094 INFO L225 Difference]: With dead ends: 275 [2024-11-07 08:29:08,094 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 08:29:08,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:29:08,098 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:08,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 08:29:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2024-11-07 08:29:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:29:08,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-07 08:29:08,136 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 59 [2024-11-07 08:29:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:08,136 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-07 08:29:08,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-07 08:29:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 08:29:08,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:08,138 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:08,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:29:08,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1444451272, now seen corresponding path program 1 times [2024-11-07 08:29:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192395463] [2024-11-07 08:29:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192395463] [2024-11-07 08:29:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192395463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:09,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:09,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:29:09,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675392324] [2024-11-07 08:29:09,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:09,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:29:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:29:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:29:09,521 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:09,833 INFO L93 Difference]: Finished difference Result 339 states and 450 transitions. [2024-11-07 08:29:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:29:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-07 08:29:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:09,837 INFO L225 Difference]: With dead ends: 339 [2024-11-07 08:29:09,837 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 08:29:09,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:29:09,841 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 170 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:09,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 317 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 08:29:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 112. [2024-11-07 08:29:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 87 states have internal predecessors, (106), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 08:29:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2024-11-07 08:29:09,870 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 60 [2024-11-07 08:29:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:09,872 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2024-11-07 08:29:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2024-11-07 08:29:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-07 08:29:09,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:09,873 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:09,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:29:09,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:09,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:09,877 INFO L85 PathProgramCache]: Analyzing trace with hash 719275552, now seen corresponding path program 1 times [2024-11-07 08:29:09,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437445828] [2024-11-07 08:29:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:09,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:09,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437445828] [2024-11-07 08:29:09,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437445828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:09,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:09,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:29:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252139536] [2024-11-07 08:29:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:29:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:09,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:29:09,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:29:09,962 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:10,027 INFO L93 Difference]: Finished difference Result 278 states and 371 transitions. [2024-11-07 08:29:10,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:29:10,028 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), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-07 08:29:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:10,030 INFO L225 Difference]: With dead ends: 278 [2024-11-07 08:29:10,031 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 08:29:10,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-07 08:29:10,032 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:10,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:29:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 08:29:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2024-11-07 08:29:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 145 states have internal predecessors, (176), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 08:29:10,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 246 transitions. [2024-11-07 08:29:10,079 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 246 transitions. Word has length 60 [2024-11-07 08:29:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:10,080 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 246 transitions. [2024-11-07 08:29:10,080 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), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 246 transitions. [2024-11-07 08:29:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 08:29:10,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:10,081 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:29:10,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:10,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1142102934, now seen corresponding path program 1 times [2024-11-07 08:29:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336053956] [2024-11-07 08:29:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:10,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336053956] [2024-11-07 08:29:10,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336053956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:10,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:10,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 08:29:10,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668713509] [2024-11-07 08:29:10,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:10,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:29:10,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:29:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 08:29:10,889 INFO L87 Difference]: Start difference. First operand 186 states and 246 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:11,141 INFO L93 Difference]: Finished difference Result 340 states and 444 transitions. [2024-11-07 08:29:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:29:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-07 08:29:11,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:11,144 INFO L225 Difference]: With dead ends: 340 [2024-11-07 08:29:11,144 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 08:29:11,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:29:11,145 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 95 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:11,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 08:29:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2024-11-07 08:29:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.2222222222222223) internal successors, (198), 162 states have internal predecessors, (198), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 08:29:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 268 transitions. [2024-11-07 08:29:11,171 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 268 transitions. Word has length 61 [2024-11-07 08:29:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:11,172 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 268 transitions. [2024-11-07 08:29:11,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 268 transitions. [2024-11-07 08:29:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-07 08:29:11,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:11,173 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:11,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:29:11,174 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:11,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1400268372, now seen corresponding path program 1 times [2024-11-07 08:29:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652366307] [2024-11-07 08:29:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:11,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652366307] [2024-11-07 08:29:11,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652366307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:11,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:11,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:29:11,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291210143] [2024-11-07 08:29:11,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:11,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:29:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:11,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:29:11,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:29:11,251 INFO L87 Difference]: Start difference. First operand 203 states and 268 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:11,297 INFO L93 Difference]: Finished difference Result 342 states and 452 transitions. [2024-11-07 08:29:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:29:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-07 08:29:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:11,299 INFO L225 Difference]: With dead ends: 342 [2024-11-07 08:29:11,299 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 08:29:11,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-07 08:29:11,300 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:11,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:29:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 08:29:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2024-11-07 08:29:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 114 states have (on average 1.1754385964912282) internal successors, (134), 114 states have internal predecessors, (134), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:29:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2024-11-07 08:29:11,321 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 61 [2024-11-07 08:29:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2024-11-07 08:29:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2024-11-07 08:29:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-07 08:29:11,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:11,323 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:11,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:29:11,323 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:11,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1909669513, now seen corresponding path program 1 times [2024-11-07 08:29:11,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31723488] [2024-11-07 08:29:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:12,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31723488] [2024-11-07 08:29:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31723488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 08:29:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601581645] [2024-11-07 08:29:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:29:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:12,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:29:12,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-07 08:29:12,150 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:13,079 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2024-11-07 08:29:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:29:13,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2024-11-07 08:29:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:13,082 INFO L225 Difference]: With dead ends: 240 [2024-11-07 08:29:13,082 INFO L226 Difference]: Without dead ends: 238 [2024-11-07 08:29:13,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:29:13,083 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 232 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:13,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 454 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 08:29:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-07 08:29:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 163. [2024-11-07 08:29:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 130 states have internal predecessors, (152), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:29:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 208 transitions. [2024-11-07 08:29:13,106 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 208 transitions. Word has length 63 [2024-11-07 08:29:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 208 transitions. [2024-11-07 08:29:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 208 transitions. [2024-11-07 08:29:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 08:29:13,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:13,107 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 08:29:13,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1196751867, now seen corresponding path program 1 times [2024-11-07 08:29:13,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:13,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727898706] [2024-11-07 08:29:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 08:29:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727898706] [2024-11-07 08:29:13,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727898706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:13,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:13,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:29:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203742118] [2024-11-07 08:29:13,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:13,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:29:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:29:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:29:13,701 INFO L87 Difference]: Start difference. First operand 163 states and 208 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:13,982 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2024-11-07 08:29:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:29:13,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2024-11-07 08:29:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:13,984 INFO L225 Difference]: With dead ends: 172 [2024-11-07 08:29:13,984 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 08:29:13,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:29:13,985 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:13,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 408 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 08:29:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2024-11-07 08:29:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 130 states have (on average 1.1615384615384616) internal successors, (151), 130 states have internal predecessors, (151), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 08:29:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 207 transitions. [2024-11-07 08:29:14,001 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 207 transitions. Word has length 64 [2024-11-07 08:29:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 207 transitions. [2024-11-07 08:29:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 207 transitions. [2024-11-07 08:29:14,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 08:29:14,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:14,004 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 08:29:14,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:14,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2043906925, now seen corresponding path program 1 times [2024-11-07 08:29:14,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:14,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024311414] [2024-11-07 08:29:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:29:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:29:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:29:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:29:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:29:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:29:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:29:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024311414] [2024-11-07 08:29:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024311414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:15,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916100416] [2024-11-07 08:29:15,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:15,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:15,045 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-07 08:29:15,046 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-07 08:29:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:15,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 08:29:15,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 218 proven. 4 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-07 08:29:15,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:29:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916100416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:29:21,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:29:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 26 [2024-11-07 08:29:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305691216] [2024-11-07 08:29:21,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:29:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 08:29:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:21,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 08:29:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-07 08:29:21,662 INFO L87 Difference]: Start difference. First operand 163 states and 207 transitions. Second operand has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-07 08:29:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:30,547 INFO L93 Difference]: Finished difference Result 738 states and 918 transitions. [2024-11-07 08:29:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-07 08:29:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) Word has length 118 [2024-11-07 08:29:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:30,552 INFO L225 Difference]: With dead ends: 738 [2024-11-07 08:29:30,552 INFO L226 Difference]: Without dead ends: 635 [2024-11-07 08:29:30,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1998 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1336, Invalid=4066, Unknown=0, NotChecked=0, Total=5402 [2024-11-07 08:29:30,556 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 957 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:30,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1357 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 08:29:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-07 08:29:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 399. [2024-11-07 08:29:30,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 310 states have (on average 1.1580645161290322) internal successors, (359), 310 states have internal predecessors, (359), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-07 08:29:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 513 transitions. [2024-11-07 08:29:30,607 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 513 transitions. Word has length 118 [2024-11-07 08:29:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:30,608 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 513 transitions. [2024-11-07 08:29:30,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.846153846153846) internal successors, (126), 26 states have internal predecessors, (126), 5 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 5 states have call predecessors, (42), 5 states have call successors, (42) [2024-11-07 08:29:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 513 transitions. [2024-11-07 08:29:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 08:29:30,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:30,610 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:30,631 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-07 08:29:30,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 08:29:30,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:30,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1382792067, now seen corresponding path program 1 times [2024-11-07 08:29:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180422335] [2024-11-07 08:29:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:29:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:29:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:29:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:29:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:29:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:29:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:29:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:32,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180422335] [2024-11-07 08:29:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180422335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:32,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102806224] [2024-11-07 08:29:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:32,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:32,269 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-07 08:29:32,271 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-07 08:29:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:32,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 08:29:32,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 08:29:32,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:29:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102806224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:32,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:29:32,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-11-07 08:29:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116836218] [2024-11-07 08:29:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:32,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 08:29:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 08:29:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:29:32,952 INFO L87 Difference]: Start difference. First operand 399 states and 513 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:33,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:33,096 INFO L93 Difference]: Finished difference Result 728 states and 935 transitions. [2024-11-07 08:29:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:29:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2024-11-07 08:29:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:33,100 INFO L225 Difference]: With dead ends: 728 [2024-11-07 08:29:33,101 INFO L226 Difference]: Without dead ends: 481 [2024-11-07 08:29:33,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:29:33,102 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 49 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-07 08:29:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 390. [2024-11-07 08:29:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.1561461794019934) internal successors, (348), 301 states have internal predecessors, (348), 77 states have call successors, (77), 11 states have call predecessors, (77), 11 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-07 08:29:33,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2024-11-07 08:29:33,149 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 119 [2024-11-07 08:29:33,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:33,150 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2024-11-07 08:29:33,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2024-11-07 08:29:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 08:29:33,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:33,152 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:33,173 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-07 08:29:33,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:33,353 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:33,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:33,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1018602839, now seen corresponding path program 1 times [2024-11-07 08:29:33,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:33,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206617210] [2024-11-07 08:29:33,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:33,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:29:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:29:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:29:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:29:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:29:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:29:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:29:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 08:29:33,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206617210] [2024-11-07 08:29:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206617210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:33,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 08:29:33,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344264647] [2024-11-07 08:29:33,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:29:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:33,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:29:33,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 08:29:33,899 INFO L87 Difference]: Start difference. First operand 390 states and 502 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:34,063 INFO L93 Difference]: Finished difference Result 575 states and 733 transitions. [2024-11-07 08:29:34,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:29:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2024-11-07 08:29:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:34,068 INFO L225 Difference]: With dead ends: 575 [2024-11-07 08:29:34,069 INFO L226 Difference]: Without dead ends: 426 [2024-11-07 08:29:34,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:29:34,070 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:34,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 179 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-07 08:29:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 362. [2024-11-07 08:29:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 281 states have (on average 1.1423487544483986) internal successors, (321), 281 states have internal predecessors, (321), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 461 transitions. [2024-11-07 08:29:34,115 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 461 transitions. Word has length 120 [2024-11-07 08:29:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:34,116 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 461 transitions. [2024-11-07 08:29:34,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 461 transitions. [2024-11-07 08:29:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 08:29:34,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:34,117 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 08:29:34,118 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:34,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1192519635, now seen corresponding path program 1 times [2024-11-07 08:29:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258528120] [2024-11-07 08:29:34,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:29:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:29:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:29:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:29:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:29:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:29:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:29:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:36,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258528120] [2024-11-07 08:29:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258528120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:36,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097951763] [2024-11-07 08:29:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:36,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:36,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:36,077 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-07 08:29:36,078 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-07 08:29:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:36,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:29:36,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 08:29:36,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:29:36,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097951763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:36,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:29:36,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2024-11-07 08:29:36,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468503560] [2024-11-07 08:29:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 08:29:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 08:29:36,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-07 08:29:36,935 INFO L87 Difference]: Start difference. First operand 362 states and 461 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:37,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:37,090 INFO L93 Difference]: Finished difference Result 541 states and 683 transitions. [2024-11-07 08:29:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 08:29:37,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 121 [2024-11-07 08:29:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:37,094 INFO L225 Difference]: With dead ends: 541 [2024-11-07 08:29:37,094 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 08:29:37,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:29:37,097 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:37,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 166 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 08:29:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 357. [2024-11-07 08:29:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 276 states have (on average 1.1340579710144927) internal successors, (313), 276 states have internal predecessors, (313), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 453 transitions. [2024-11-07 08:29:37,138 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 453 transitions. Word has length 121 [2024-11-07 08:29:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:37,140 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 453 transitions. [2024-11-07 08:29:37,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 453 transitions. [2024-11-07 08:29:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 08:29:37,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:37,143 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:37,165 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-07 08:29:37,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:37,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:37,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1028671250, now seen corresponding path program 1 times [2024-11-07 08:29:37,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039946015] [2024-11-07 08:29:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:29:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:29:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:29:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:29:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:29:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:29:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:29:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:38,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:38,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039946015] [2024-11-07 08:29:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039946015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:38,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941902318] [2024-11-07 08:29:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:38,283 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-07 08:29:38,285 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-07 08:29:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:38,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 08:29:38,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-07 08:29:39,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:29:39,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941902318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:39,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:29:39,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2024-11-07 08:29:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806450877] [2024-11-07 08:29:39,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:39,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:29:39,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:39,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:29:39,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:29:39,827 INFO L87 Difference]: Start difference. First operand 357 states and 453 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:40,241 INFO L93 Difference]: Finished difference Result 532 states and 673 transitions. [2024-11-07 08:29:40,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 08:29:40,242 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-07 08:29:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:40,246 INFO L225 Difference]: With dead ends: 532 [2024-11-07 08:29:40,247 INFO L226 Difference]: Without dead ends: 530 [2024-11-07 08:29:40,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2024-11-07 08:29:40,249 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 106 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:40,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 432 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-07 08:29:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 399. [2024-11-07 08:29:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 318 states have (on average 1.1320754716981132) internal successors, (360), 318 states have internal predecessors, (360), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 500 transitions. [2024-11-07 08:29:40,294 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 500 transitions. Word has length 122 [2024-11-07 08:29:40,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:40,295 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 500 transitions. [2024-11-07 08:29:40,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 500 transitions. [2024-11-07 08:29:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 08:29:40,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:40,297 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:40,318 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-07 08:29:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 08:29:40,498 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:40,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -458937852, now seen corresponding path program 1 times [2024-11-07 08:29:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129503899] [2024-11-07 08:29:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:29:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:29:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:29:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:29:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:29:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:29:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:29:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 08:29:41,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129503899] [2024-11-07 08:29:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129503899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667902417] [2024-11-07 08:29:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:41,259 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-07 08:29:41,261 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-07 08:29:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:41,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 08:29:41,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-07 08:29:41,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:29:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-07 08:29:41,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667902417] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:29:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 20 [2024-11-07 08:29:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864404198] [2024-11-07 08:29:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:41,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 08:29:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:41,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 08:29:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-07 08:29:41,829 INFO L87 Difference]: Start difference. First operand 399 states and 500 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:42,151 INFO L93 Difference]: Finished difference Result 658 states and 817 transitions. [2024-11-07 08:29:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 08:29:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-07 08:29:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:42,156 INFO L225 Difference]: With dead ends: 658 [2024-11-07 08:29:42,156 INFO L226 Difference]: Without dead ends: 656 [2024-11-07 08:29:42,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:29:42,158 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:42,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 377 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:42,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-07 08:29:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 407. [2024-11-07 08:29:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.1319018404907975) internal successors, (369), 326 states have internal predecessors, (369), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 509 transitions. [2024-11-07 08:29:42,201 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 509 transitions. Word has length 122 [2024-11-07 08:29:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:42,202 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 509 transitions. [2024-11-07 08:29:42,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 509 transitions. [2024-11-07 08:29:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 08:29:42,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:42,205 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:42,227 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-07 08:29:42,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 08:29:42,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:42,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:42,410 INFO L85 PathProgramCache]: Analyzing trace with hash -851964862, now seen corresponding path program 1 times [2024-11-07 08:29:42,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:42,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008555991] [2024-11-07 08:29:42,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:42,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:29:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:29:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:29:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:29:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:29:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:29:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:29:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-07 08:29:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:42,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008555991] [2024-11-07 08:29:42,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008555991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:42,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:42,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:29:42,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315148089] [2024-11-07 08:29:42,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:42,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:29:42,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:29:42,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:29:42,497 INFO L87 Difference]: Start difference. First operand 407 states and 509 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:42,539 INFO L93 Difference]: Finished difference Result 544 states and 682 transitions. [2024-11-07 08:29:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:29:42,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2024-11-07 08:29:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:42,546 INFO L225 Difference]: With dead ends: 544 [2024-11-07 08:29:42,547 INFO L226 Difference]: Without dead ends: 395 [2024-11-07 08:29:42,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-07 08:29:42,548 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 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-07 08:29:42,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:29:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-07 08:29:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-07 08:29:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 314 states have (on average 1.1210191082802548) internal successors, (352), 314 states have internal predecessors, (352), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 492 transitions. [2024-11-07 08:29:42,589 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 492 transitions. Word has length 122 [2024-11-07 08:29:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 492 transitions. [2024-11-07 08:29:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 492 transitions. [2024-11-07 08:29:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 08:29:42,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:42,592 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 08:29:42,592 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:42,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1998321160, now seen corresponding path program 1 times [2024-11-07 08:29:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816205903] [2024-11-07 08:29:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:29:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:29:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:29:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:29:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:29:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:29:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:29:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 08:29:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816205903] [2024-11-07 08:29:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816205903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:44,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506402183] [2024-11-07 08:29:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:44,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:44,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:44,499 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-07 08:29:44,502 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-07 08:29:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:44,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 08:29:44,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-07 08:29:44,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:29:44,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506402183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:44,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:29:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 24 [2024-11-07 08:29:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184990133] [2024-11-07 08:29:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:44,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:29:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:29:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-07 08:29:44,905 INFO L87 Difference]: Start difference. First operand 395 states and 492 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:45,143 INFO L93 Difference]: Finished difference Result 650 states and 816 transitions. [2024-11-07 08:29:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:29:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-07 08:29:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:45,149 INFO L225 Difference]: With dead ends: 650 [2024-11-07 08:29:45,149 INFO L226 Difference]: Without dead ends: 648 [2024-11-07 08:29:45,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2024-11-07 08:29:45,151 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 81 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:45,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 467 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:29:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-07 08:29:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 392. [2024-11-07 08:29:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 311 states have (on average 1.1189710610932475) internal successors, (348), 311 states have internal predecessors, (348), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 08:29:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2024-11-07 08:29:45,207 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 123 [2024-11-07 08:29:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:45,222 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2024-11-07 08:29:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2024-11-07 08:29:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 08:29:45,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:45,224 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:45,246 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-07 08:29:45,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:45,425 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:45,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1297256582, now seen corresponding path program 1 times [2024-11-07 08:29:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542225119] [2024-11-07 08:29:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:45,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:29:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 08:29:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:29:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 08:29:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 08:29:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 08:29:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 08:29:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 08:29:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542225119] [2024-11-07 08:29:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542225119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:29:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250015945] [2024-11-07 08:29:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:29:46,710 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-07 08:29:46,712 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-07 08:29:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:46,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 08:29:46,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:29:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-07 08:29:48,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:29:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250015945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:48,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 08:29:48,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2024-11-07 08:29:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328697701] [2024-11-07 08:29:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:48,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 08:29:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:48,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 08:29:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:29:48,494 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:48,936 INFO L93 Difference]: Finished difference Result 559 states and 689 transitions. [2024-11-07 08:29:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 08:29:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2024-11-07 08:29:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:48,941 INFO L225 Difference]: With dead ends: 559 [2024-11-07 08:29:48,941 INFO L226 Difference]: Without dead ends: 557 [2024-11-07 08:29:48,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-07 08:29:48,942 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:48,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 665 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 08:29:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-07 08:29:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 336. [2024-11-07 08:29:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.1102661596958174) internal successors, (292), 263 states have internal predecessors, (292), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 08:29:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 418 transitions. [2024-11-07 08:29:48,991 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 418 transitions. Word has length 123 [2024-11-07 08:29:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:48,991 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 418 transitions. [2024-11-07 08:29:48,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 418 transitions. [2024-11-07 08:29:48,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 08:29:48,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:29:48,993 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:49,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 08:29:49,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:29:49,194 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:29:49,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:29:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1138777084, now seen corresponding path program 1 times [2024-11-07 08:29:49,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:29:49,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457315700] [2024-11-07 08:29:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:29:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:29:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:29:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:29:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:29:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:29:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:29:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 08:29:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 08:29:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 08:29:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:29:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 08:29:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:29:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:29:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:29:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:29:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:29:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-07 08:29:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:29:49,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457315700] [2024-11-07 08:29:49,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457315700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:29:49,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:29:49,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 08:29:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873592293] [2024-11-07 08:29:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:29:49,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 08:29:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:29:49,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 08:29:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:29:49,875 INFO L87 Difference]: Start difference. First operand 336 states and 418 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:29:50,486 INFO L93 Difference]: Finished difference Result 512 states and 645 transitions. [2024-11-07 08:29:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:29:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 124 [2024-11-07 08:29:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:29:50,488 INFO L225 Difference]: With dead ends: 512 [2024-11-07 08:29:50,488 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 08:29:50,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:29:50,492 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 150 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:29:50,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 419 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:29:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 08:29:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 08:29:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 08:29:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 08:29:50,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-11-07 08:29:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:29:50,494 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 08:29:50,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 08:29:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 08:29:50,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 08:29:50,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:29:50,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 08:29:50,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:29:50,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 08:30:03,250 WARN L286 SmtUtils]: Spent 11.57s on a formula simplification. DAG size of input: 325 DAG size of output: 111 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-07 08:30:06,284 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:30:06,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:30:06 BoogieIcfgContainer [2024-11-07 08:30:06,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:30:06,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:30:06,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:30:06,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:30:06,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:29:05" (3/4) ... [2024-11-07 08:30:06,310 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 08:30:06,320 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-07 08:30:06,324 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 08:30:06,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 08:30:06,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 08:30:06,325 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 08:30:06,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 08:30:06,417 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 08:30:06,417 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:30:06,419 INFO L158 Benchmark]: Toolchain (without parser) took 62161.68ms. Allocated memory was 100.7MB in the beginning and 847.2MB in the end (delta: 746.6MB). Free memory was 76.7MB in the beginning and 444.9MB in the end (delta: -368.1MB). Peak memory consumption was 377.8MB. Max. memory is 16.1GB. [2024-11-07 08:30:06,419 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:30:06,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.32ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:30:06,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.68ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:30:06,420 INFO L158 Benchmark]: Boogie Preprocessor took 52.25ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:30:06,420 INFO L158 Benchmark]: RCFGBuilder took 393.98ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 44.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:30:06,424 INFO L158 Benchmark]: TraceAbstraction took 61236.37ms. Allocated memory was 100.7MB in the beginning and 847.2MB in the end (delta: 746.6MB). Free memory was 44.4MB in the beginning and 453.1MB in the end (delta: -408.8MB). Peak memory consumption was 481.0MB. Max. memory is 16.1GB. [2024-11-07 08:30:06,424 INFO L158 Benchmark]: Witness Printer took 110.45ms. Allocated memory is still 847.2MB. Free memory was 453.1MB in the beginning and 444.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:30:06,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 83.9MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.32ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.68ms. Allocated memory is still 100.7MB. Free memory was 64.2MB in the beginning and 62.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.25ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 393.98ms. Allocated memory is still 100.7MB. Free memory was 59.5MB in the beginning and 44.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 61236.37ms. Allocated memory was 100.7MB in the beginning and 847.2MB in the end (delta: 746.6MB). Free memory was 44.4MB in the beginning and 453.1MB in the end (delta: -408.8MB). Peak memory consumption was 481.0MB. Max. memory is 16.1GB. * Witness Printer took 110.45ms. Allocated memory is still 847.2MB. Free memory was 453.1MB in the beginning and 444.9MB in the end (delta: 8.3MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.4s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2373 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2373 mSDsluCounter, 6567 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5175 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 1392 mSDtfsCounter, 3991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1829 GetRequests, 1536 SyntacticMatches, 4 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=17, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1767 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 2724 NumberOfCodeBlocks, 2724 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2934 ConstructedInterpolants, 0 QuantifiedInterpolants, 19204 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1873 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 8164/8382 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((var_1_11 != var_1_5) || (var_1_1 != 0)) || ((((long long) 65520 + var_1_11) % 65536) != 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_1 != 0) || (((var_1_11 != var_1_5) || ((((long long) 65520 + var_1_11) % 65536) != 0)) && ((last_1_var_1_11 != last_1_var_1_5) || ((((long long) 65520 + last_1_var_1_11) % 65536) != 0)))) Ensures: (((var_1_1 != 0) || (((var_1_11 != var_1_5) || ((((long long) 65520 + var_1_11) % 65536) != 0)) && ((last_1_var_1_11 != last_1_var_1_5) || ((((long long) 65520 + last_1_var_1_11) % 65536) != 0)))) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-07 08:30:06,466 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 Result: TRUE