./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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_variablewrapping_wrapper-s_file-97.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', 'e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d'] 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_variablewrapping_wrapper-s_file-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:51:31,140 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:51:31,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:51:31,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:51:31,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:51:31,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:51:31,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:51:31,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:51:31,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:51:31,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:51:31,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:51:31,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:51:31,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:51:31,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:51:31,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:51:31,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:51:31,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:51:31,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:51:31,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:51:31,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:51:31,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:51:31,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:51:31,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:51:31,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:51:31,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:51:31,270 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2024-11-07 10:51:31,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:51:31,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:51:31,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:51:31,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:51:31,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:51:31,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:51:32,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:51:33,120 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:51:33,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:51:33,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d0db3d9a/e6930c4b1e4c44178f2ec375ea4544ac/FLAGbc6bec1a4 [2024-11-07 10:51:33,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d0db3d9a/e6930c4b1e4c44178f2ec375ea4544ac [2024-11-07 10:51:33,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:51:33,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:51:33,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:51:33,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:51:33,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:51:33,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2c19da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33, skipping insertion in model container [2024-11-07 10:51:33,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:51:33,564 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_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-07 10:51:33,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:51:33,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:51:33,630 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_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-07 10:51:33,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:51:33,703 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:51:33,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33 WrapperNode [2024-11-07 10:51:33,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:51:33,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:51:33,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:51:33,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:51:33,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,782 INFO L138 Inliner]: procedures = 30, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-07 10:51:33,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:51:33,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:51:33,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:51:33,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:51:33,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,812 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:51:33,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:51:33,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:51:33,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:51:33,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:51:33,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (1/1) ... [2024-11-07 10:51:33,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:51:33,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:51:33,898 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 10:51:33,904 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 10:51:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:51:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:51:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:51:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:51:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:51:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:51:33,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:51:33,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:51:33,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:51:33,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:51:33,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:51:33,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:51:34,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:51:34,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:51:34,567 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 10:51:34,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:51:34,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:51:34,582 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:51:34,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:51:34 BoogieIcfgContainer [2024-11-07 10:51:34,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:51:34,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:51:34,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:51:34,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:51:34,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:51:33" (1/3) ... [2024-11-07 10:51:34,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a8e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:51:34, skipping insertion in model container [2024-11-07 10:51:34,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:33" (2/3) ... [2024-11-07 10:51:34,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2a8e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:51:34, skipping insertion in model container [2024-11-07 10:51:34,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:51:34" (3/3) ... [2024-11-07 10:51:34,595 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:51:34,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:51:34,610 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:51:34,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:51:34,673 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;@7e0e8a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:51:34,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:51:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:51:34,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:34,691 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:34,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:34,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:34,697 INFO L85 PathProgramCache]: Analyzing trace with hash 322779117, now seen corresponding path program 1 times [2024-11-07 10:51:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852315009] [2024-11-07 10:51:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:35,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:35,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852315009] [2024-11-07 10:51:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852315009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:51:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446411028] [2024-11-07 10:51:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:35,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:51:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:51:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:51:35,266 INFO L87 Difference]: Start difference. First operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:35,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:35,298 INFO L93 Difference]: Finished difference Result 209 states and 325 transitions. [2024-11-07 10:51:35,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:51:35,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-07 10:51:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:35,306 INFO L225 Difference]: With dead ends: 209 [2024-11-07 10:51:35,306 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 10:51:35,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 10:51:35,312 INFO L432 NwaCegarLoop]: 150 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, 150 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 10:51:35,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 10:51:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 10:51:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-07 10:51:35,361 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2024-11-07 10:51:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-07 10:51:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-07 10:51:35,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:51:35,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:35,365 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:35,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:51:35,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 468796107, now seen corresponding path program 1 times [2024-11-07 10:51:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126741508] [2024-11-07 10:51:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:35,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:35,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126741508] [2024-11-07 10:51:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126741508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:35,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374215552] [2024-11-07 10:51:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:35,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:35,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:35,939 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:36,001 INFO L93 Difference]: Finished difference Result 207 states and 300 transitions. [2024-11-07 10:51:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-07 10:51:36,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:36,004 INFO L225 Difference]: With dead ends: 207 [2024-11-07 10:51:36,004 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:51:36,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:36,005 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:36,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:51:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 10:51:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-07 10:51:36,015 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2024-11-07 10:51:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:36,016 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-07 10:51:36,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-07 10:51:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:36,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:36,018 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:51:36,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1684705181, now seen corresponding path program 1 times [2024-11-07 10:51:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269669451] [2024-11-07 10:51:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:36,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:36,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269669451] [2024-11-07 10:51:36,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269669451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:36,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:36,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361878504] [2024-11-07 10:51:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:36,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:36,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:36,376 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:36,425 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-11-07 10:51:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:36,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:36,428 INFO L225 Difference]: With dead ends: 212 [2024-11-07 10:51:36,428 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 10:51:36,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:36,429 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:36,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:36,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 10:51:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-07 10:51:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-07 10:51:36,449 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 136 [2024-11-07 10:51:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:36,449 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-07 10:51:36,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-07 10:51:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:36,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:36,454 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:36,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:51:36,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1930203745, now seen corresponding path program 1 times [2024-11-07 10:51:36,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:36,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110002750] [2024-11-07 10:51:36,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:36,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:36,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110002750] [2024-11-07 10:51:36,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110002750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:36,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:36,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32747373] [2024-11-07 10:51:36,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:36,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:36,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:36,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:36,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:36,747 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:36,782 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-11-07 10:51:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:36,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:36,786 INFO L225 Difference]: With dead ends: 216 [2024-11-07 10:51:36,786 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 10:51:36,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:36,788 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:36,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 10:51:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-07 10:51:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-07 10:51:36,798 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 136 [2024-11-07 10:51:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:36,799 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-07 10:51:36,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-07 10:51:36,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:36,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:36,801 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:36,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:51:36,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:36,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash -155196383, now seen corresponding path program 1 times [2024-11-07 10:51:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:36,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682508379] [2024-11-07 10:51:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682508379] [2024-11-07 10:51:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682508379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389739110] [2024-11-07 10:51:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:37,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:37,073 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:37,104 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2024-11-07 10:51:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:37,107 INFO L225 Difference]: With dead ends: 220 [2024-11-07 10:51:37,107 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:51:37,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:37,109 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:37,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:51:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 10:51:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-07 10:51:37,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 136 [2024-11-07 10:51:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:37,123 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-07 10:51:37,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-07 10:51:37,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:37,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:37,126 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:37,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:51:37,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:37,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash -153349341, now seen corresponding path program 1 times [2024-11-07 10:51:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299832993] [2024-11-07 10:51:37,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299832993] [2024-11-07 10:51:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299832993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:51:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49746430] [2024-11-07 10:51:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:37,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:51:37,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:37,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:51:37,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:51:37,709 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:38,027 INFO L93 Difference]: Finished difference Result 332 states and 470 transitions. [2024-11-07 10:51:38,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:51:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:38,029 INFO L225 Difference]: With dead ends: 332 [2024-11-07 10:51:38,029 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 10:51:38,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:51:38,030 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 130 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:38,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 519 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:51:38,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 10:51:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 123. [2024-11-07 10:51:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-07 10:51:38,051 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 136 [2024-11-07 10:51:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:38,051 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-07 10:51:38,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-07 10:51:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:38,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:38,053 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:51:38,053 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:38,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -287362847, now seen corresponding path program 1 times [2024-11-07 10:51:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024232583] [2024-11-07 10:51:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:38,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:38,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024232583] [2024-11-07 10:51:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024232583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:51:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974913807] [2024-11-07 10:51:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:51:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:51:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:38,708 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:39,454 INFO L93 Difference]: Finished difference Result 335 states and 472 transitions. [2024-11-07 10:51:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:51:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:39,458 INFO L225 Difference]: With dead ends: 335 [2024-11-07 10:51:39,458 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 10:51:39,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:51:39,460 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 237 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:39,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 389 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:51:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 10:51:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 125. [2024-11-07 10:51:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:51:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2024-11-07 10:51:39,480 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 136 [2024-11-07 10:51:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:39,481 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2024-11-07 10:51:39,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2024-11-07 10:51:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:39,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:39,484 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:51:39,484 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:39,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:39,484 INFO L85 PathProgramCache]: Analyzing trace with hash 638900394, now seen corresponding path program 1 times [2024-11-07 10:51:39,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569975530] [2024-11-07 10:51:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:51:40,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569975530] [2024-11-07 10:51:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569975530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:51:40,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653150104] [2024-11-07 10:51:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:40,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:51:40,905 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 10:51:40,907 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 10:51:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:41,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:51:41,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:41,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:51:41,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:51:41,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:51:41,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2024-11-07 10:51:41,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:41,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2024-11-07 10:51:41,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 113 [2024-11-07 10:51:41,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:41,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 113 treesize of output 151 [2024-11-07 10:51:41,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 86 [2024-11-07 10:51:42,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:42,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 181 treesize of output 67 [2024-11-07 10:51:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 10:51:42,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:51:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:51:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653150104] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:51:42,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:51:42,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 21 [2024-11-07 10:51:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897471001] [2024-11-07 10:51:42,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:51:42,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 10:51:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 10:51:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:51:42,510 INFO L87 Difference]: Start difference. First operand 125 states and 176 transitions. Second operand has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-07 10:51:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:45,256 INFO L93 Difference]: Finished difference Result 465 states and 643 transitions. [2024-11-07 10:51:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 10:51:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 136 [2024-11-07 10:51:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:45,259 INFO L225 Difference]: With dead ends: 465 [2024-11-07 10:51:45,259 INFO L226 Difference]: Without dead ends: 343 [2024-11-07 10:51:45,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 296 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=530, Invalid=2226, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 10:51:45,262 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 878 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:45,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1087 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:51:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-07 10:51:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 312. [2024-11-07 10:51:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 254 states have (on average 1.295275590551181) internal successors, (329), 257 states have internal predecessors, (329), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-07 10:51:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 429 transitions. [2024-11-07 10:51:45,289 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 429 transitions. Word has length 136 [2024-11-07 10:51:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:45,289 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 429 transitions. [2024-11-07 10:51:45,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.333333333333333) internal successors, (96), 21 states have internal predecessors, (96), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-07 10:51:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 429 transitions. [2024-11-07 10:51:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:45,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:45,291 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:45,311 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 10:51:45,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:45,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:45,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 278043843, now seen corresponding path program 1 times [2024-11-07 10:51:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646083046] [2024-11-07 10:51:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:51:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646083046] [2024-11-07 10:51:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646083046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:51:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515803445] [2024-11-07 10:51:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:46,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:51:46,466 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 10:51:46,469 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 10:51:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:46,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 10:51:46,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:46,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:51:46,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:51:46,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:46,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 53 [2024-11-07 10:51:46,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:46,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2024-11-07 10:51:46,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 124 [2024-11-07 10:51:46,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:46,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 182 [2024-11-07 10:51:47,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2024-11-07 10:51:47,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:47,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 211 treesize of output 73 [2024-11-07 10:51:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-11-07 10:51:47,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:51:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:51:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515803445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:51:47,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:51:47,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2024-11-07 10:51:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571389316] [2024-11-07 10:51:47,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:51:47,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 10:51:47,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:47,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 10:51:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:51:47,596 INFO L87 Difference]: Start difference. First operand 312 states and 429 transitions. Second operand has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 10:51:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:49,762 INFO L93 Difference]: Finished difference Result 838 states and 1134 transitions. [2024-11-07 10:51:49,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 10:51:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 136 [2024-11-07 10:51:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:49,769 INFO L225 Difference]: With dead ends: 838 [2024-11-07 10:51:49,770 INFO L226 Difference]: Without dead ends: 550 [2024-11-07 10:51:49,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 294 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=1245, Unknown=0, NotChecked=0, Total=1560 [2024-11-07 10:51:49,771 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 607 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:49,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1032 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:51:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-07 10:51:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 274. [2024-11-07 10:51:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 227 states have internal predecessors, (292), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 372 transitions. [2024-11-07 10:51:49,808 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 372 transitions. Word has length 136 [2024-11-07 10:51:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:49,808 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 372 transitions. [2024-11-07 10:51:49,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-07 10:51:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 372 transitions. [2024-11-07 10:51:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:51:49,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:49,810 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:49,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:51:50,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:50,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:50,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash 144030337, now seen corresponding path program 1 times [2024-11-07 10:51:50,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:50,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201380912] [2024-11-07 10:51:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:51:50,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201380912] [2024-11-07 10:51:50,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201380912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:51:50,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955349515] [2024-11-07 10:51:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:50,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:50,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:51:50,844 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 10:51:50,845 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 10:51:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:51,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:51:51,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:51,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 83 [2024-11-07 10:51:51,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:51,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-07 10:51:51,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-11-07 10:51:51,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:51,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 269 treesize of output 113 [2024-11-07 10:51:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:51,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955349515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:51:51,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-07 10:51:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775469551] [2024-11-07 10:51:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:51,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:51:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:51:51,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:51:51,498 INFO L87 Difference]: Start difference. First operand 274 states and 372 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:51,992 INFO L93 Difference]: Finished difference Result 569 states and 774 transitions. [2024-11-07 10:51:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:51:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:51:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:51,995 INFO L225 Difference]: With dead ends: 569 [2024-11-07 10:51:51,995 INFO L226 Difference]: Without dead ends: 350 [2024-11-07 10:51:51,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:51:51,997 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 75 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:51,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 802 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:51:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-07 10:51:52,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 281. [2024-11-07 10:51:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 232 states have (on average 1.293103448275862) internal successors, (300), 234 states have internal predecessors, (300), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 380 transitions. [2024-11-07 10:51:52,034 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 380 transitions. Word has length 136 [2024-11-07 10:51:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:52,034 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 380 transitions. [2024-11-07 10:51:52,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 380 transitions. [2024-11-07 10:51:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:51:52,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:52,036 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:51:52,056 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 10:51:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:51:52,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1439137510, now seen corresponding path program 1 times [2024-11-07 10:51:52,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:52,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693626391] [2024-11-07 10:51:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693626391] [2024-11-07 10:51:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693626391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:51:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622154792] [2024-11-07 10:51:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:51:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:51:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:52,485 INFO L87 Difference]: Start difference. First operand 281 states and 380 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:52,886 INFO L93 Difference]: Finished difference Result 739 states and 1004 transitions. [2024-11-07 10:51:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:51:52,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-07 10:51:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:52,890 INFO L225 Difference]: With dead ends: 739 [2024-11-07 10:51:52,892 INFO L226 Difference]: Without dead ends: 513 [2024-11-07 10:51:52,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:51:52,894 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 131 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:52,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 973 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:51:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-07 10:51:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 293. [2024-11-07 10:51:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2950819672131149) internal successors, (316), 246 states have internal predecessors, (316), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 396 transitions. [2024-11-07 10:51:52,932 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 396 transitions. Word has length 137 [2024-11-07 10:51:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:52,932 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 396 transitions. [2024-11-07 10:51:52,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 396 transitions. [2024-11-07 10:51:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 10:51:52,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:52,937 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1] [2024-11-07 10:51:52,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:51:52,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:52,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:52,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1036036344, now seen corresponding path program 1 times [2024-11-07 10:51:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:52,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827765493] [2024-11-07 10:51:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:53,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:53,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827765493] [2024-11-07 10:51:53,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827765493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:53,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:51:53,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773062565] [2024-11-07 10:51:53,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:51:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:51:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:53,843 INFO L87 Difference]: Start difference. First operand 293 states and 396 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:54,498 INFO L93 Difference]: Finished difference Result 693 states and 932 transitions. [2024-11-07 10:51:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:51:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-11-07 10:51:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:54,501 INFO L225 Difference]: With dead ends: 693 [2024-11-07 10:51:54,501 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 10:51:54,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:51:54,503 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 106 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:54,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 788 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:51:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 10:51:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 293. [2024-11-07 10:51:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2868852459016393) internal successors, (314), 246 states have internal predecessors, (314), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 394 transitions. [2024-11-07 10:51:54,538 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 394 transitions. Word has length 138 [2024-11-07 10:51:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 394 transitions. [2024-11-07 10:51:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 394 transitions. [2024-11-07 10:51:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 10:51:54,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:54,540 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1] [2024-11-07 10:51:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:51:54,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:54,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:54,541 INFO L85 PathProgramCache]: Analyzing trace with hash 822033323, now seen corresponding path program 1 times [2024-11-07 10:51:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174773324] [2024-11-07 10:51:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:55,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174773324] [2024-11-07 10:51:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174773324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:51:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677413007] [2024-11-07 10:51:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:55,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:51:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:55,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:51:55,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:51:55,292 INFO L87 Difference]: Start difference. First operand 293 states and 394 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:55,667 INFO L93 Difference]: Finished difference Result 683 states and 914 transitions. [2024-11-07 10:51:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:51:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-11-07 10:51:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:55,670 INFO L225 Difference]: With dead ends: 683 [2024-11-07 10:51:55,670 INFO L226 Difference]: Without dead ends: 445 [2024-11-07 10:51:55,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:55,672 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:55,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 481 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:51:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-07 10:51:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 293. [2024-11-07 10:51:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.278688524590164) internal successors, (312), 246 states have internal predecessors, (312), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2024-11-07 10:51:55,705 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 139 [2024-11-07 10:51:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:55,705 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2024-11-07 10:51:55,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:51:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2024-11-07 10:51:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 10:51:55,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:55,707 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1] [2024-11-07 10:51:55,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:51:55,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:55,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2030698450, now seen corresponding path program 1 times [2024-11-07 10:51:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482137848] [2024-11-07 10:51:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482137848] [2024-11-07 10:51:56,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482137848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:56,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:56,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:51:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320204177] [2024-11-07 10:51:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:51:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:51:56,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:51:56,276 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:56,505 INFO L93 Difference]: Finished difference Result 531 states and 712 transitions. [2024-11-07 10:51:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2024-11-07 10:51:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:56,508 INFO L225 Difference]: With dead ends: 531 [2024-11-07 10:51:56,508 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 10:51:56,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:51:56,509 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 185 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:56,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 171 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:51:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 10:51:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-07 10:51:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 246 states have internal predecessors, (309), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 389 transitions. [2024-11-07 10:51:56,552 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 389 transitions. Word has length 139 [2024-11-07 10:51:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 389 transitions. [2024-11-07 10:51:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 389 transitions. [2024-11-07 10:51:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:51:56,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:56,554 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:51:56,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:51:56,554 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:56,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash -11130563, now seen corresponding path program 1 times [2024-11-07 10:51:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964215781] [2024-11-07 10:51:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964215781] [2024-11-07 10:51:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964215781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:51:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263996402] [2024-11-07 10:51:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:51:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:51:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:51:58,758 INFO L87 Difference]: Start difference. First operand 293 states and 389 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:59,362 INFO L93 Difference]: Finished difference Result 644 states and 852 transitions. [2024-11-07 10:51:59,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:51:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-07 10:51:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:59,367 INFO L225 Difference]: With dead ends: 644 [2024-11-07 10:51:59,367 INFO L226 Difference]: Without dead ends: 406 [2024-11-07 10:51:59,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:51:59,369 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 55 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:59,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 967 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:51:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-07 10:51:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 307. [2024-11-07 10:51:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.2674418604651163) internal successors, (327), 260 states have internal predecessors, (327), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:51:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-07 10:51:59,409 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 140 [2024-11-07 10:51:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:59,409 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-07 10:51:59,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:51:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-07 10:51:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:51:59,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:59,411 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:51:59,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:51:59,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1599478465, now seen corresponding path program 1 times [2024-11-07 10:51:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:51:59,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332965721] [2024-11-07 10:51:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:51:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:51:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:51:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:51:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:51:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:51:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:51:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:51:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:51:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:51:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:51:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:51:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:51:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:51:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:51:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:51:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:51:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:51:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:51:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:51:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332965721] [2024-11-07 10:51:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332965721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:51:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247051024] [2024-11-07 10:51:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:59,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:51:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:51:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:51:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:59,741 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:00,215 INFO L93 Difference]: Finished difference Result 769 states and 1015 transitions. [2024-11-07 10:52:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:52:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:00,218 INFO L225 Difference]: With dead ends: 769 [2024-11-07 10:52:00,218 INFO L226 Difference]: Without dead ends: 517 [2024-11-07 10:52:00,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:52:00,221 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 122 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:00,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 501 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-07 10:52:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 340. [2024-11-07 10:52:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 293 states have internal predecessors, (368), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 448 transitions. [2024-11-07 10:52:00,258 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 448 transitions. Word has length 140 [2024-11-07 10:52:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:00,258 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 448 transitions. [2024-11-07 10:52:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 448 transitions. [2024-11-07 10:52:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:00,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:00,261 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:52:00,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 411571263, now seen corresponding path program 1 times [2024-11-07 10:52:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683881630] [2024-11-07 10:52:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:00,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683881630] [2024-11-07 10:52:00,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683881630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:00,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:00,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:00,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864719696] [2024-11-07 10:52:00,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:00,545 INFO L87 Difference]: Start difference. First operand 340 states and 448 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:00,978 INFO L93 Difference]: Finished difference Result 786 states and 1034 transitions. [2024-11-07 10:52:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:52:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:00,981 INFO L225 Difference]: With dead ends: 786 [2024-11-07 10:52:00,981 INFO L226 Difference]: Without dead ends: 501 [2024-11-07 10:52:00,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:52:00,983 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 124 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:00,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 546 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-07 10:52:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 332. [2024-11-07 10:52:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 283 states have (on average 1.265017667844523) internal successors, (358), 285 states have internal predecessors, (358), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 438 transitions. [2024-11-07 10:52:01,021 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 438 transitions. Word has length 140 [2024-11-07 10:52:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:01,022 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 438 transitions. [2024-11-07 10:52:01,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:01,022 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 438 transitions. [2024-11-07 10:52:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:01,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:01,024 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:52:01,024 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:01,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2108951555, now seen corresponding path program 1 times [2024-11-07 10:52:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659600492] [2024-11-07 10:52:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659600492] [2024-11-07 10:52:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659600492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:01,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:01,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:52:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27466166] [2024-11-07 10:52:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:01,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:52:01,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:01,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:52:01,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:52:01,427 INFO L87 Difference]: Start difference. First operand 332 states and 438 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:01,941 INFO L93 Difference]: Finished difference Result 768 states and 1012 transitions. [2024-11-07 10:52:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:52:01,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:01,945 INFO L225 Difference]: With dead ends: 768 [2024-11-07 10:52:01,945 INFO L226 Difference]: Without dead ends: 491 [2024-11-07 10:52:01,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:52:01,946 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 310 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:01,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 304 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-07 10:52:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 296. [2024-11-07 10:52:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 247 states have (on average 1.2307692307692308) internal successors, (304), 249 states have internal predecessors, (304), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 384 transitions. [2024-11-07 10:52:01,978 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 384 transitions. Word has length 140 [2024-11-07 10:52:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:01,978 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 384 transitions. [2024-11-07 10:52:01,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 384 transitions. [2024-11-07 10:52:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:01,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:01,980 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:01,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:52:01,980 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:01,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -97901827, now seen corresponding path program 1 times [2024-11-07 10:52:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:01,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038456982] [2024-11-07 10:52:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:02,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038456982] [2024-11-07 10:52:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038456982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:02,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:02,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226189296] [2024-11-07 10:52:02,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:02,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:02,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:02,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:02,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:02,352 INFO L87 Difference]: Start difference. First operand 296 states and 384 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:02,880 INFO L93 Difference]: Finished difference Result 680 states and 886 transitions. [2024-11-07 10:52:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:02,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:02,883 INFO L225 Difference]: With dead ends: 680 [2024-11-07 10:52:02,883 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 10:52:02,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:52:02,885 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 269 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:02,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 368 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:52:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 10:52:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 263. [2024-11-07 10:52:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.219626168224299) internal successors, (261), 216 states have internal predecessors, (261), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 341 transitions. [2024-11-07 10:52:02,919 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 341 transitions. Word has length 140 [2024-11-07 10:52:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:02,920 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 341 transitions. [2024-11-07 10:52:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 341 transitions. [2024-11-07 10:52:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:02,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:02,923 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:02,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:52:02,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash -146714543, now seen corresponding path program 1 times [2024-11-07 10:52:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743686282] [2024-11-07 10:52:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:52:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:03,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743686282] [2024-11-07 10:52:03,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743686282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:52:03,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334732505] [2024-11-07 10:52:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:03,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:52:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:52:03,486 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 10:52:03,488 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 10:52:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:03,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-07 10:52:03,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:03,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:52:03,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-07 10:52:04,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-07 10:52:04,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2024-11-07 10:52:04,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2024-11-07 10:52:04,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2024-11-07 10:52:04,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:04,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 28 [2024-11-07 10:52:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:04,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334732505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:04,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:52:04,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-07 10:52:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786767876] [2024-11-07 10:52:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:04,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:52:04,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:04,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:52:04,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:52:04,555 INFO L87 Difference]: Start difference. First operand 263 states and 341 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:04,949 INFO L93 Difference]: Finished difference Result 473 states and 611 transitions. [2024-11-07 10:52:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:04,952 INFO L225 Difference]: With dead ends: 473 [2024-11-07 10:52:04,953 INFO L226 Difference]: Without dead ends: 265 [2024-11-07 10:52:04,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:52:04,954 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 309 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:04,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 376 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:52:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-07 10:52:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-11-07 10:52:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.2149532710280373) internal successors, (260), 216 states have internal predecessors, (260), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 340 transitions. [2024-11-07 10:52:04,990 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 340 transitions. Word has length 140 [2024-11-07 10:52:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:04,990 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 340 transitions. [2024-11-07 10:52:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 340 transitions. [2024-11-07 10:52:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:04,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:04,992 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:05,012 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 10:52:05,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:52:05,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 398054226, now seen corresponding path program 1 times [2024-11-07 10:52:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036734280] [2024-11-07 10:52:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:05,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:05,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036734280] [2024-11-07 10:52:05,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036734280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:05,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:05,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96012948] [2024-11-07 10:52:05,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:05,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:05,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:05,551 INFO L87 Difference]: Start difference. First operand 263 states and 340 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:05,807 INFO L93 Difference]: Finished difference Result 271 states and 349 transitions. [2024-11-07 10:52:05,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:05,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-11-07 10:52:05,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:05,809 INFO L225 Difference]: With dead ends: 271 [2024-11-07 10:52:05,810 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 10:52:05,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:52:05,810 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:05,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 550 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:52:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 10:52:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-07 10:52:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 220 states have (on average 1.209090909090909) internal successors, (266), 222 states have internal predecessors, (266), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 346 transitions. [2024-11-07 10:52:05,841 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 346 transitions. Word has length 140 [2024-11-07 10:52:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 346 transitions. [2024-11-07 10:52:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 346 transitions. [2024-11-07 10:52:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:05,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:05,843 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:05,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 10:52:05,843 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:05,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash 399901268, now seen corresponding path program 1 times [2024-11-07 10:52:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:05,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901589860] [2024-11-07 10:52:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901589860] [2024-11-07 10:52:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901589860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:06,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239339487] [2024-11-07 10:52:06,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:06,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:06,510 INFO L87 Difference]: Start difference. First operand 269 states and 346 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:52:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:06,845 INFO L93 Difference]: Finished difference Result 641 states and 816 transitions. [2024-11-07 10:52:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:52:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2024-11-07 10:52:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:06,849 INFO L225 Difference]: With dead ends: 641 [2024-11-07 10:52:06,849 INFO L226 Difference]: Without dead ends: 427 [2024-11-07 10:52:06,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:52:06,851 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 151 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:06,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 397 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:52:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-07 10:52:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 422. [2024-11-07 10:52:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 353 states have (on average 1.2011331444759208) internal successors, (424), 357 states have internal predecessors, (424), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 10:52:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 536 transitions. [2024-11-07 10:52:06,897 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 536 transitions. Word has length 140 [2024-11-07 10:52:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 536 transitions. [2024-11-07 10:52:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:52:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 536 transitions. [2024-11-07 10:52:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 10:52:06,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:06,899 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1] [2024-11-07 10:52:06,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 10:52:06,899 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -186904746, now seen corresponding path program 1 times [2024-11-07 10:52:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092601190] [2024-11-07 10:52:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:52:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:52:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:52:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:52:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:52:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:52:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:52:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:52:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:52:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:52:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:52:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:52:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:52:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:52:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:52:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:52:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:52:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:52:07,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:52:07,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092601190] [2024-11-07 10:52:07,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092601190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:52:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314976000] [2024-11-07 10:52:07,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:07,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:52:07,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:52:07,483 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 10:52:07,485 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 10:52:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:07,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 10:52:07,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:07,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:52:07,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:52:07,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-07 10:52:07,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:07,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 53 [2024-11-07 10:52:07,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:07,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 31 [2024-11-07 10:52:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-07 10:52:07,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:52:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 10:52:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314976000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:52:08,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:52:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-11-07 10:52:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761057537] [2024-11-07 10:52:08,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:52:08,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:52:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:52:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:52:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:52:08,268 INFO L87 Difference]: Start difference. First operand 422 states and 536 transitions. Second operand has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-07 10:52:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:09,225 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2024-11-07 10:52:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:52:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 140 [2024-11-07 10:52:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:09,228 INFO L225 Difference]: With dead ends: 623 [2024-11-07 10:52:09,228 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 10:52:09,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 308 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:52:09,230 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 168 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:09,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 472 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:52:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 10:52:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2024-11-07 10:52:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 206 states have (on average 1.1893203883495145) internal successors, (245), 208 states have internal predecessors, (245), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 10:52:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 325 transitions. [2024-11-07 10:52:09,266 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 325 transitions. Word has length 140 [2024-11-07 10:52:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 325 transitions. [2024-11-07 10:52:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 7.888888888888889) internal successors, (71), 12 states have internal predecessors, (71), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-07 10:52:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 325 transitions. [2024-11-07 10:52:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 10:52:09,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:09,268 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-07 10:52:09,289 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 10:52:09,469 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,SelfDestructingSolverStorable22 [2024-11-07 10:52:09,470 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:09,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -164558316, now seen corresponding path program 1 times [2024-11-07 10:52:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:52:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826862166] [2024-11-07 10:52:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:52:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:52:09,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:52:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:52:09,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:52:09,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:52:09,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:52:09,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 10:52:09,702 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, 1, 1, 1] [2024-11-07 10:52:09,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:52:09,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:52:09 BoogieIcfgContainer [2024-11-07 10:52:09,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:52:09,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:52:09,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:52:09,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:52:09,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:51:34" (3/4) ... [2024-11-07 10:52:09,774 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:52:09,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:52:09,775 INFO L158 Benchmark]: Toolchain (without parser) took 36354.96ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 77.1MB in the beginning and 42.3MB in the end (delta: 34.8MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-11-07 10:52:09,775 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:52:09,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.50ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 61.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:52:09,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.50ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:52:09,778 INFO L158 Benchmark]: Boogie Preprocessor took 78.40ms. Allocated memory is still 100.7MB. Free memory was 57.7MB in the beginning and 54.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:52:09,778 INFO L158 Benchmark]: RCFGBuilder took 720.60ms. Allocated memory is still 100.7MB. Free memory was 54.7MB in the beginning and 63.2MB in the end (delta: -8.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-07 10:52:09,778 INFO L158 Benchmark]: TraceAbstraction took 35182.82ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 62.2MB in the beginning and 42.3MB in the end (delta: 19.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2024-11-07 10:52:09,778 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 22.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:52:09,779 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.50ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 61.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.50ms. Allocated memory is still 100.7MB. Free memory was 61.0MB in the beginning and 57.7MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.40ms. Allocated memory is still 100.7MB. Free memory was 57.7MB in the beginning and 54.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 720.60ms. Allocated memory is still 100.7MB. Free memory was 54.7MB in the beginning and 63.2MB in the end (delta: -8.4MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35182.82ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 62.2MB in the beginning and 42.3MB in the end (delta: 19.9MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 142.6MB. Free memory was 42.3MB in the beginning and 42.3MB in the end (delta: 22.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_19 [L60] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L61] EXPR WrapperStruct00.var_1_21 [L61] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L62] EXPR WrapperStruct00.var_1_12 [L62] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_12 [L63] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND FALSE !(127.5f > WrapperStruct00.var_1_20) [L66] EXPR WrapperStruct00.var_1_20 [L66] EXPR WrapperStruct00.var_1_20 [L66] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] WrapperStruct00.var_1_13 = ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15) [L68] EXPR WrapperStruct00.var_1_18 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)) [L77] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_10 [L78] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) [L85] WrapperStruct00.var_1_1 = 8 VAL [WrapperStruct00={4:0}, isInitial=1] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_11 [L120] EXPR WrapperStruct00.var_1_12 [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) [L120] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) [L120] EXPR WrapperStruct00.var_1_13 [L120] EXPR WrapperStruct00.var_1_15 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_21 [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 24, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4084 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4042 mSDsluCounter, 12600 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9374 mSDsCounter, 1090 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8708 IncrementalHoareTripleChecker+Invalid, 9798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1090 mSolverCounterUnsat, 3226 mSDtfsCounter, 8708 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2202 GetRequests, 1962 SyntacticMatches, 19 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=22, InterpolantAutomatonStates: 199, 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, 23 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 4000 NumberOfCodeBlocks, 4000 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4238 ConstructedInterpolants, 0 QuantifiedInterpolants, 13386 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2524 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 16684/16864 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:52:09,815 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:52:11,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:52:12,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:52:12,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:52:12,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:52:12,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:52:12,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:52:12,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:52:12,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:52:12,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:52:12,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:52:12,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:52:12,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:52:12,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:52:12,151 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:52:12,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:52:12,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:52:12,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:52:12,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:52:12,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:52:12,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:52:12,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:52:12,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:52:12,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:52:12,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:52:12,154 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2024-11-07 10:52:12,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:52:12,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:52:12,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:52:12,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:52:12,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:52:12,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:52:13,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:52:14,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:52:14,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:52:14,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d6696c93/7f700810fa57466ab9a5c72450621d69/FLAG742e1ec8e [2024-11-07 10:52:14,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7d6696c93/7f700810fa57466ab9a5c72450621d69 [2024-11-07 10:52:14,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:52:14,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:52:14,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:52:14,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:52:14,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:52:14,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6f313d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14, skipping insertion in model container [2024-11-07 10:52:14,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:52:14,222 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_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-07 10:52:14,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:52:14,314 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:52:14,326 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_variablewrapping_wrapper-s_file-97.i[916,929] [2024-11-07 10:52:14,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:52:14,397 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:52:14,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14 WrapperNode [2024-11-07 10:52:14,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:52:14,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:52:14,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:52:14,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:52:14,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,473 INFO L138 Inliner]: procedures = 34, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-07 10:52:14,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:52:14,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:52:14,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:52:14,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:52:14,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,526 INFO L175 MemorySlicer]: Split 117 memory accesses to 2 slices as follows [2, 115]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-07 10:52:14,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:52:14,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:52:14,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:52:14,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:52:14,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (1/1) ... [2024-11-07 10:52:14,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:52:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:52:14,621 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 10:52:14,624 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 10:52:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:52:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:52:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:52:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:52:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:52:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:52:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:52:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:52:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:52:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:52:14,755 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:52:14,757 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:52:15,312 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-11-07 10:52:15,313 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:52:15,325 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:52:15,327 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:52:15,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:52:15 BoogieIcfgContainer [2024-11-07 10:52:15,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:52:15,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:52:15,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:52:15,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:52:15,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:52:14" (1/3) ... [2024-11-07 10:52:15,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc18add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:52:15, skipping insertion in model container [2024-11-07 10:52:15,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:52:14" (2/3) ... [2024-11-07 10:52:15,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc18add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:52:15, skipping insertion in model container [2024-11-07 10:52:15,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:52:15" (3/3) ... [2024-11-07 10:52:15,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2024-11-07 10:52:15,368 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:52:15,369 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:52:15,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:52:15,427 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;@2ebe3d0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:52:15,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:52:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:52:15,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:15,441 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:15,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash 993834081, now seen corresponding path program 1 times [2024-11-07 10:52:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:15,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707964125] [2024-11-07 10:52:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:15,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:15,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 10:52:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:15,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:52:15,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-07 10:52:15,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:15,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:15,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707964125] [2024-11-07 10:52:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707964125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:52:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126532106] [2024-11-07 10:52:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:52:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:52:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:52:15,802 INFO L87 Difference]: Start difference. First operand has 100 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:52:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:15,828 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2024-11-07 10:52:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:52:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-07 10:52:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:15,836 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:52:15,837 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 10:52:15,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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 10:52:15,842 INFO L432 NwaCegarLoop]: 138 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, 138 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 10:52:15,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 10:52:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-07 10:52:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-11-07 10:52:15,886 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2024-11-07 10:52:15,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:15,886 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-11-07 10:52:15,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 10:52:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-11-07 10:52:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:52:15,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:15,891 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:15,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:52:16,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:16,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:16,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1139851071, now seen corresponding path program 1 times [2024-11-07 10:52:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:16,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558631500] [2024-11-07 10:52:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:16,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:16,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:16,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 10:52:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:16,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:52:16,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:16,450 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:16,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:16,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:16,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558631500] [2024-11-07 10:52:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558631500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:16,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:52:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094791591] [2024-11-07 10:52:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:16,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:52:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:52:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:16,455 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:16,497 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2024-11-07 10:52:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:52:16,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-07 10:52:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:16,500 INFO L225 Difference]: With dead ends: 191 [2024-11-07 10:52:16,503 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:52:16,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:16,504 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:16,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:52:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-07 10:52:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-07 10:52:16,524 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 134 [2024-11-07 10:52:16,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:16,525 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-07 10:52:16,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:16,525 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-07 10:52:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:16,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:16,527 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:16,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:52:16,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:16,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:16,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:16,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1830527183, now seen corresponding path program 1 times [2024-11-07 10:52:16,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098130675] [2024-11-07 10:52:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:16,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:16,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 10:52:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:16,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:52:16,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:17,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:17,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098130675] [2024-11-07 10:52:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098130675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:17,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:17,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:52:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882697587] [2024-11-07 10:52:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:17,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:52:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:52:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:52:17,040 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:17,654 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2024-11-07 10:52:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:52:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:52:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:17,657 INFO L225 Difference]: With dead ends: 274 [2024-11-07 10:52:17,657 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 10:52:17,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:17,658 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:52:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 10:52:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 100. [2024-11-07 10:52:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:17,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-07 10:52:17,680 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 136 [2024-11-07 10:52:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:17,681 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-07 10:52:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-07 10:52:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:17,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:17,686 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:17,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 10:52:17,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:17,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash -904263942, now seen corresponding path program 1 times [2024-11-07 10:52:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624186394] [2024-11-07 10:52:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:17,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:17,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:17,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:17,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:52:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:18,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:52:18,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:18,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:18,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:18,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624186394] [2024-11-07 10:52:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624186394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:18,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:52:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148655151] [2024-11-07 10:52:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:18,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:52:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:52:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:18,155 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:18,184 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2024-11-07 10:52:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:52:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:52:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:18,187 INFO L225 Difference]: With dead ends: 200 [2024-11-07 10:52:18,187 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 10:52:18,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:52:18,188 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:18,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 10:52:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-11-07 10:52:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-07 10:52:18,200 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 136 [2024-11-07 10:52:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:18,200 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-07 10:52:18,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-07 10:52:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:18,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:18,202 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:18,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:52:18,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:18,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:18,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -224205572, now seen corresponding path program 1 times [2024-11-07 10:52:18,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:18,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564025467] [2024-11-07 10:52:18,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:18,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:18,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:52:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:18,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:52:18,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:18,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:18,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564025467] [2024-11-07 10:52:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564025467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:18,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:18,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:52:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038145183] [2024-11-07 10:52:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:52:18,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:52:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:52:18,657 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:18,694 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2024-11-07 10:52:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:52:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:52:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:18,696 INFO L225 Difference]: With dead ends: 204 [2024-11-07 10:52:18,696 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 10:52:18,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:52:18,697 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:18,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 10:52:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-07 10:52:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-07 10:52:18,704 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 136 [2024-11-07 10:52:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:18,704 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-07 10:52:18,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-07 10:52:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:18,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:18,706 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:18,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:52:18,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:18,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1550801790, now seen corresponding path program 1 times [2024-11-07 10:52:18,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494023493] [2024-11-07 10:52:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:18,911 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:18,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:52:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:19,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:52:19,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:19,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:19,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494023493] [2024-11-07 10:52:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494023493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833534949] [2024-11-07 10:52:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:19,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:19,153 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:19,203 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2024-11-07 10:52:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:52:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 10:52:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:19,205 INFO L225 Difference]: With dead ends: 208 [2024-11-07 10:52:19,206 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 10:52:19,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:19,207 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:19,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:52:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 10:52:19,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-07 10:52:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 10:52:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-07 10:52:19,217 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 136 [2024-11-07 10:52:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:19,217 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-07 10:52:19,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-07 10:52:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:19,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:19,219 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:19,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:52:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:19,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:19,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1552648832, now seen corresponding path program 1 times [2024-11-07 10:52:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477817211] [2024-11-07 10:52:19,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:19,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:19,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:19,423 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:19,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 10:52:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:19,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 10:52:19,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:19,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:52:19,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:52:19,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-11-07 10:52:20,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:20,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 61 [2024-11-07 10:52:20,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:20,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 77 [2024-11-07 10:52:20,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:20,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 80 [2024-11-07 10:52:20,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:20,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 30 [2024-11-07 10:52:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-07 10:52:20,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:52:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 10:52:20,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477817211] [2024-11-07 10:52:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477817211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:52:20,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:52:20,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-07 10:52:20,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279051313] [2024-11-07 10:52:20,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:52:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 10:52:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 10:52:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:52:20,841 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-07 10:52:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:24,221 INFO L93 Difference]: Finished difference Result 358 states and 486 transitions. [2024-11-07 10:52:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-07 10:52:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) Word has length 136 [2024-11-07 10:52:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:24,225 INFO L225 Difference]: With dead ends: 358 [2024-11-07 10:52:24,225 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 10:52:24,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=1664, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 10:52:24,228 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 584 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:24,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 886 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 10:52:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 10:52:24,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 240. [2024-11-07 10:52:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 189 states have (on average 1.2645502645502646) internal successors, (239), 191 states have internal predecessors, (239), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 10:52:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2024-11-07 10:52:24,262 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 136 [2024-11-07 10:52:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:24,265 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2024-11-07 10:52:24,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-07 10:52:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2024-11-07 10:52:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:24,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:24,270 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:24,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:52:24,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:24,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:24,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1418635326, now seen corresponding path program 1 times [2024-11-07 10:52:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113240799] [2024-11-07 10:52:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:24,473 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:24,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:52:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:24,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 10:52:24,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:24,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:52:25,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-07 10:52:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-07 10:52:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2024-11-07 10:52:25,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:25,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 65 [2024-11-07 10:52:25,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:25,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 95 treesize of output 41 [2024-11-07 10:52:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 294 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-07 10:52:25,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:52:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 10:52:25,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:25,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113240799] [2024-11-07 10:52:25,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113240799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:52:25,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:52:25,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2024-11-07 10:52:25,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997009588] [2024-11-07 10:52:25,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:52:25,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 10:52:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 10:52:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:52:25,828 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-07 10:52:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:27,924 INFO L93 Difference]: Finished difference Result 484 states and 640 transitions. [2024-11-07 10:52:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 10:52:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2024-11-07 10:52:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:27,928 INFO L225 Difference]: With dead ends: 484 [2024-11-07 10:52:27,928 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 10:52:27,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 252 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:52:27,930 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 128 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:27,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 412 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 10:52:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 10:52:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 259. [2024-11-07 10:52:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 204 states have internal predecessors, (251), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 10:52:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 339 transitions. [2024-11-07 10:52:27,972 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 339 transitions. Word has length 136 [2024-11-07 10:52:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:27,973 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 339 transitions. [2024-11-07 10:52:27,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2024-11-07 10:52:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 339 transitions. [2024-11-07 10:52:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:52:27,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:27,974 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:27,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:52:28,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:28,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:28,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1913505383, now seen corresponding path program 1 times [2024-11-07 10:52:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216844013] [2024-11-07 10:52:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:28,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:28,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:28,178 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:28,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:52:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:28,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 10:52:28,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:28,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:52:28,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2024-11-07 10:52:28,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:28,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2024-11-07 10:52:29,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:29,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2024-11-07 10:52:29,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:29,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 82 [2024-11-07 10:52:29,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:29,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 89 [2024-11-07 10:52:29,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:29,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 92 [2024-11-07 10:52:29,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:29,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 33 [2024-11-07 10:52:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 318 proven. 30 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-07 10:52:29,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:52:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 10:52:29,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216844013] [2024-11-07 10:52:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216844013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:52:29,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:52:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2024-11-07 10:52:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742786230] [2024-11-07 10:52:29,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:52:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 10:52:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 10:52:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:52:29,988 INFO L87 Difference]: Start difference. First operand 259 states and 339 transitions. Second operand has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-07 10:52:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:33,908 INFO L93 Difference]: Finished difference Result 546 states and 702 transitions. [2024-11-07 10:52:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-07 10:52:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 136 [2024-11-07 10:52:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:33,913 INFO L225 Difference]: With dead ends: 546 [2024-11-07 10:52:33,913 INFO L226 Difference]: Without dead ends: 311 [2024-11-07 10:52:33,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=665, Invalid=2415, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 10:52:33,916 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 422 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:33,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 945 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 10:52:33,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-07 10:52:33,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 184. [2024-11-07 10:52:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 138 states have (on average 1.2028985507246377) internal successors, (166), 139 states have internal predecessors, (166), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:52:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 234 transitions. [2024-11-07 10:52:33,945 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 234 transitions. Word has length 136 [2024-11-07 10:52:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:33,946 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 234 transitions. [2024-11-07 10:52:33,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.190476190476191) internal successors, (88), 22 states have internal predecessors, (88), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-07 10:52:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 234 transitions. [2024-11-07 10:52:33,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:52:33,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:33,947 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:33,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 10:52:34,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:34,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:34,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:34,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1858789075, now seen corresponding path program 1 times [2024-11-07 10:52:34,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067460362] [2024-11-07 10:52:34,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:34,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:34,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:34,151 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:34,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:52:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:34,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:52:34,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:34,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:52:34,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-07 10:52:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 10:52:34,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:52:34,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067460362] [2024-11-07 10:52:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067460362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:52:34,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:52:34,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:52:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878415089] [2024-11-07 10:52:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:52:34,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:52:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:34,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:52:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:52:34,376 INFO L87 Difference]: Start difference. First operand 184 states and 234 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:52:34,767 INFO L93 Difference]: Finished difference Result 429 states and 550 transitions. [2024-11-07 10:52:34,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:52:34,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-11-07 10:52:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:52:34,769 INFO L225 Difference]: With dead ends: 429 [2024-11-07 10:52:34,770 INFO L226 Difference]: Without dead ends: 308 [2024-11-07 10:52:34,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:52:34,770 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:52:34,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 717 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:52:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-07 10:52:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 188. [2024-11-07 10:52:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 142 states have (on average 1.2112676056338028) internal successors, (172), 143 states have internal predecessors, (172), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:52:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 240 transitions. [2024-11-07 10:52:34,801 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 240 transitions. Word has length 137 [2024-11-07 10:52:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:52:34,802 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 240 transitions. [2024-11-07 10:52:34,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 10:52:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 240 transitions. [2024-11-07 10:52:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:52:34,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:52:34,803 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 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 10:52:34,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-07 10:52:35,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:35,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:52:35,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:52:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1509914980, now seen corresponding path program 1 times [2024-11-07 10:52:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:52:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315672686] [2024-11-07 10:52:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:52:35,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:52:35,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:52:35,007 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:52:35,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-07 10:52:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:52:35,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 10:52:35,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:52:35,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:52:35,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-11-07 10:52:35,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 33 [2024-11-07 10:52:35,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 44 [2024-11-07 10:52:35,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-11-07 10:52:35,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 60 [2024-11-07 10:52:35,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2024-11-07 10:52:35,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:52:35,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 28 [2024-11-07 10:52:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-07 10:52:35,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:52:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 10:52:36,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:52:36,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315672686] [2024-11-07 10:52:36,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315672686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:52:36,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:52:36,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-11-07 10:52:36,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544070359] [2024-11-07 10:52:36,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:52:36,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 10:52:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:52:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 10:52:36,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:52:36,176 INFO L87 Difference]: Start difference. First operand 188 states and 240 transitions. Second operand has 22 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22)