./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.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-87.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', '35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4'] 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-87.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 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:50:03,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:50:03,748 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:50:03,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:50:03,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:50:03,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:50:03,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:50:03,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:50:03,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:50:03,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:50:03,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:50:03,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:50:03,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:50:03,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:50:03,780 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:50:03,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:50:03,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:50:03,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:50:03,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:50:03,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:50:03,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:50:03,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:50:03,785 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 -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2024-11-07 10:50:04,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:50:04,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:50:04,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:50:04,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:50:04,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:50:04,069 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-87.i [2024-11-07 10:50:05,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:50:05,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:50:05,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-07 10:50:05,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea0870bf/185ae6a51d874bf9b3e344d8cff9d271/FLAG3af862fee [2024-11-07 10:50:05,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ea0870bf/185ae6a51d874bf9b3e344d8cff9d271 [2024-11-07 10:50:05,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:50:05,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:50:05,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:50:05,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:50:05,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:50:05,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:05,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd780de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05, skipping insertion in model container [2024-11-07 10:50:05,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:05,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:50:05,793 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-87.i[916,929] [2024-11-07 10:50:05,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:50:05,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:50:05,876 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-87.i[916,929] [2024-11-07 10:50:05,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:50:05,927 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:50:05,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05 WrapperNode [2024-11-07 10:50:05,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:50:05,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:50:05,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:50:05,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:50:05,938 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:50:05" (1/1) ... [2024-11-07 10:50:05,952 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:50:05" (1/1) ... [2024-11-07 10:50:06,004 INFO L138 Inliner]: procedures = 27, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-07 10:50:06,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:50:06,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:50:06,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:50:06,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:50:06,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,060 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-07 10:50:06,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:50:06,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:50:06,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:50:06,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:50:06,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (1/1) ... [2024-11-07 10:50:06,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:50:06,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:06,141 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:50:06,146 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:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:50:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:50:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:50:06,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:50:06,256 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:50:06,258 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:50:06,702 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-07 10:50:06,703 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:50:06,713 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:50:06,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:50:06,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:50:06 BoogieIcfgContainer [2024-11-07 10:50:06,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:50:06,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:50:06,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:50:06,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:50:06,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:50:05" (1/3) ... [2024-11-07 10:50:06,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef2eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:50:06, skipping insertion in model container [2024-11-07 10:50:06,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:50:05" (2/3) ... [2024-11-07 10:50:06,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ef2eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:50:06, skipping insertion in model container [2024-11-07 10:50:06,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:50:06" (3/3) ... [2024-11-07 10:50:06,724 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2024-11-07 10:50:06,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:50:06,738 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:50:06,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:50:06,798 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;@42b50f60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:50:06,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:50:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:50:06,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:06,818 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:06,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:06,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash -160032552, now seen corresponding path program 1 times [2024-11-07 10:50:06,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359454800] [2024-11-07 10:50:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:07,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359454800] [2024-11-07 10:50:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359454800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:07,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:50:07,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020801152] [2024-11-07 10:50:07,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:50:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:07,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:50:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:50:07,200 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:07,234 INFO L93 Difference]: Finished difference Result 167 states and 256 transitions. [2024-11-07 10:50:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:50:07,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-07 10:50:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:07,243 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:50:07,244 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 10:50:07,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:50:07,249 INFO L432 NwaCegarLoop]: 115 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, 115 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:50:07,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:50:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 10:50:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 10:50:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-07 10:50:07,292 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2024-11-07 10:50:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:07,293 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-07 10:50:07,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-07 10:50:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:50:07,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:07,296 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:50:07,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:07,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash -173670212, now seen corresponding path program 1 times [2024-11-07 10:50:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:07,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15782376] [2024-11-07 10:50:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15782376] [2024-11-07 10:50:07,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15782376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:07,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:07,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:50:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686044371] [2024-11-07 10:50:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:07,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:50:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:50:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:50:07,801 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:07,846 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2024-11-07 10:50:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:50:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-07 10:50:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:07,851 INFO L225 Difference]: With dead ends: 165 [2024-11-07 10:50:07,852 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 10:50:07,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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:50:07,853 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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:50:07,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:50:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 10:50:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-07 10:50:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:07,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-07 10:50:07,864 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2024-11-07 10:50:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:07,867 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-07 10:50:07,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-07 10:50:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:50:07,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:07,869 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:50:07,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:07,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:07,870 INFO L85 PathProgramCache]: Analyzing trace with hash -95122987, now seen corresponding path program 1 times [2024-11-07 10:50:07,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:07,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310812665] [2024-11-07 10:50:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:07,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310812665] [2024-11-07 10:50:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310812665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:50:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691201609] [2024-11-07 10:50:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:50:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:50:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:50:08,127 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:08,176 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2024-11-07 10:50:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:50:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:50:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:08,179 INFO L225 Difference]: With dead ends: 170 [2024-11-07 10:50:08,179 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 10:50:08,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:50:08,180 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 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:50:08,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:50:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 10:50:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-07 10:50:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:08,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-07 10:50:08,194 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-07 10:50:08,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:08,195 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-07 10:50:08,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-07 10:50:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:50:08,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:08,199 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:50:08,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash 584935383, now seen corresponding path program 1 times [2024-11-07 10:50:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622110737] [2024-11-07 10:50:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622110737] [2024-11-07 10:50:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622110737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:08,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:08,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:50:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299807569] [2024-11-07 10:50:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:50:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:50:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:50:08,417 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:08,460 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-07 10:50:08,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:50:08,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:50:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:08,462 INFO L225 Difference]: With dead ends: 174 [2024-11-07 10:50:08,462 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 10:50:08,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:50:08,466 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 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:50:08,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:50:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 10:50:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-07 10:50:08,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-07 10:50:08,476 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 113 [2024-11-07 10:50:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:08,478 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-07 10:50:08,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-07 10:50:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:50:08,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:08,480 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:50:08,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:08,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1935024551, now seen corresponding path program 1 times [2024-11-07 10:50:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526589697] [2024-11-07 10:50:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:08,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526589697] [2024-11-07 10:50:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526589697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:08,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:50:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386831700] [2024-11-07 10:50:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:08,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:50:08,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:08,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:50:08,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:50:08,687 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:08,720 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-07 10:50:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:50:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:50:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:08,722 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:50:08,724 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:50:08,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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:50:08,725 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 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:50:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:50:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:50:08,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-07 10:50:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:08,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-07 10:50:08,737 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 113 [2024-11-07 10:50:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:08,738 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-07 10:50:08,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-07 10:50:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:50:08,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:08,740 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:50:08,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1933177509, now seen corresponding path program 1 times [2024-11-07 10:50:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438105957] [2024-11-07 10:50:08,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:08,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438105957] [2024-11-07 10:50:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438105957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:50:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689156467] [2024-11-07 10:50:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:50:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:50:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:50:09,530 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:09,972 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2024-11-07 10:50:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-11-07 10:50:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:09,975 INFO L225 Difference]: With dead ends: 260 [2024-11-07 10:50:09,976 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 10:50:09,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:09,977 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 147 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:09,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 320 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:50:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 10:50:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2024-11-07 10:50:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:50:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-07 10:50:09,993 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 113 [2024-11-07 10:50:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:09,994 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-07 10:50:09,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-07 10:50:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:50:09,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:09,995 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:09,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:50:09,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -633094042, now seen corresponding path program 1 times [2024-11-07 10:50:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:09,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295234074] [2024-11-07 10:50:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295234074] [2024-11-07 10:50:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295234074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:10,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:10,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:50:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611370334] [2024-11-07 10:50:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:10,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:50:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:50:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:50:10,432 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:10,709 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2024-11-07 10:50:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:50:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:50:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:10,711 INFO L225 Difference]: With dead ends: 276 [2024-11-07 10:50:10,712 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 10:50:10,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 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:50:10,713 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 68 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:10,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 509 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:50:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 10:50:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2024-11-07 10:50:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 149 states have internal predecessors, (191), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:50:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2024-11-07 10:50:10,733 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 113 [2024-11-07 10:50:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:10,735 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2024-11-07 10:50:10,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2024-11-07 10:50:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 10:50:10,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:10,736 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:10,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:50:10,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:10,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash -776494331, now seen corresponding path program 1 times [2024-11-07 10:50:10,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:10,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215663290] [2024-11-07 10:50:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215663290] [2024-11-07 10:50:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215663290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051970694] [2024-11-07 10:50:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:11,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:11,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:11,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:11,847 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:12,300 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2024-11-07 10:50:12,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-07 10:50:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:12,304 INFO L225 Difference]: With dead ends: 355 [2024-11-07 10:50:12,304 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 10:50:12,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:12,305 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 56 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:12,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 553 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:50:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 10:50:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-07 10:50:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.2727272727272727) internal successors, (196), 156 states have internal predecessors, (196), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:50:12,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-11-07 10:50:12,328 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 114 [2024-11-07 10:50:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:12,329 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-11-07 10:50:12,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-11-07 10:50:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:12,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:12,330 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:12,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:50:12,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:12,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash 200671924, now seen corresponding path program 1 times [2024-11-07 10:50:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768123547] [2024-11-07 10:50:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768123547] [2024-11-07 10:50:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768123547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:50:13,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830410676] [2024-11-07 10:50:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:50:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:13,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:50:13,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:50:13,900 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:14,515 INFO L93 Difference]: Finished difference Result 429 states and 571 transitions. [2024-11-07 10:50:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:50:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-07 10:50:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:14,518 INFO L225 Difference]: With dead ends: 429 [2024-11-07 10:50:14,518 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 10:50:14,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:50:14,519 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:14,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 801 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:50:14,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 10:50:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 178. [2024-11-07 10:50:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 150 states have (on average 1.2666666666666666) internal successors, (190), 152 states have internal predecessors, (190), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:50:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2024-11-07 10:50:14,535 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 115 [2024-11-07 10:50:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:14,536 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2024-11-07 10:50:14,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2024-11-07 10:50:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:14,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:14,538 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:14,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:50:14,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1223887013, now seen corresponding path program 1 times [2024-11-07 10:50:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:14,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692675611] [2024-11-07 10:50:14,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:15,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:15,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692675611] [2024-11-07 10:50:15,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692675611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:15,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:15,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:50:15,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36479255] [2024-11-07 10:50:15,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:15,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:50:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:15,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:50:15,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:50:15,190 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:15,429 INFO L93 Difference]: Finished difference Result 348 states and 459 transitions. [2024-11-07 10:50:15,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:50:15,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-07 10:50:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:15,431 INFO L225 Difference]: With dead ends: 348 [2024-11-07 10:50:15,431 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 10:50:15,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:15,433 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 41 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:15,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 327 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:50:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 10:50:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-07 10:50:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 140 states have internal predecessors, (174), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 10:50:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2024-11-07 10:50:15,443 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 115 [2024-11-07 10:50:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:15,443 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2024-11-07 10:50:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2024-11-07 10:50:15,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:15,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:15,445 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:15,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:50:15,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:15,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:15,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1644013042, now seen corresponding path program 1 times [2024-11-07 10:50:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090906840] [2024-11-07 10:50:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:16,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090906840] [2024-11-07 10:50:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090906840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:50:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384327336] [2024-11-07 10:50:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:16,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:50:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:50:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:50:16,020 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:16,253 INFO L93 Difference]: Finished difference Result 204 states and 265 transitions. [2024-11-07 10:50:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:50:16,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-07 10:50:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:16,255 INFO L225 Difference]: With dead ends: 204 [2024-11-07 10:50:16,255 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 10:50:16,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 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:50:16,256 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:16,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 402 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:50:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 10:50:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2024-11-07 10:50:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.2160493827160495) internal successors, (197), 164 states have internal predecessors, (197), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:50:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 261 transitions. [2024-11-07 10:50:16,277 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 261 transitions. Word has length 115 [2024-11-07 10:50:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:16,278 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 261 transitions. [2024-11-07 10:50:16,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 261 transitions. [2024-11-07 10:50:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:16,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:16,280 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:16,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:50:16,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:16,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1645860084, now seen corresponding path program 1 times [2024-11-07 10:50:16,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:16,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215475593] [2024-11-07 10:50:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:16,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:17,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215475593] [2024-11-07 10:50:17,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215475593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:17,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:50:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850603993] [2024-11-07 10:50:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:17,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:50:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:17,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:50:17,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:17,027 INFO L87 Difference]: Start difference. First operand 201 states and 261 transitions. Second operand has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:17,580 INFO L93 Difference]: Finished difference Result 501 states and 642 transitions. [2024-11-07 10:50:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:50:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-11-07 10:50:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:17,584 INFO L225 Difference]: With dead ends: 501 [2024-11-07 10:50:17,584 INFO L226 Difference]: Without dead ends: 328 [2024-11-07 10:50:17,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:50:17,588 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:17,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 493 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:50:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-07 10:50:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2024-11-07 10:50:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 261 states have (on average 1.1877394636015326) internal successors, (310), 265 states have internal predecessors, (310), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 10:50:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 414 transitions. [2024-11-07 10:50:17,632 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 414 transitions. Word has length 115 [2024-11-07 10:50:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:17,633 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 414 transitions. [2024-11-07 10:50:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 414 transitions. [2024-11-07 10:50:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:17,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:17,635 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:17,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:50:17,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash -874099850, now seen corresponding path program 1 times [2024-11-07 10:50:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595227519] [2024-11-07 10:50:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:17,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595227519] [2024-11-07 10:50:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595227519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:50:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350174820] [2024-11-07 10:50:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:50:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:50:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:50:17,961 INFO L87 Difference]: Start difference. First operand 325 states and 414 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:18,153 INFO L93 Difference]: Finished difference Result 634 states and 800 transitions. [2024-11-07 10:50:18,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:50:18,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-07 10:50:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:18,157 INFO L225 Difference]: With dead ends: 634 [2024-11-07 10:50:18,158 INFO L226 Difference]: Without dead ends: 337 [2024-11-07 10:50:18,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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:50:18,162 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:18,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 194 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:50:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-07 10:50:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 245. [2024-11-07 10:50:18,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 198 states have (on average 1.1818181818181819) internal successors, (234), 200 states have internal predecessors, (234), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2024-11-07 10:50:18,203 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 115 [2024-11-07 10:50:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:18,204 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2024-11-07 10:50:18,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:18,204 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2024-11-07 10:50:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:50:18,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:18,207 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:18,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:50:18,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:18,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:18,208 INFO L85 PathProgramCache]: Analyzing trace with hash -194041480, now seen corresponding path program 1 times [2024-11-07 10:50:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:18,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96479807] [2024-11-07 10:50:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:18,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:18,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96479807] [2024-11-07 10:50:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96479807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:50:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687233995] [2024-11-07 10:50:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:50:18,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:50:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:50:18,417 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:18,641 INFO L93 Difference]: Finished difference Result 604 states and 746 transitions. [2024-11-07 10:50:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:50:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-07 10:50:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:18,644 INFO L225 Difference]: With dead ends: 604 [2024-11-07 10:50:18,644 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 10:50:18,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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:50:18,645 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 57 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:18,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 484 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:50:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 10:50:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 387. [2024-11-07 10:50:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 324 states have (on average 1.1697530864197532) internal successors, (379), 328 states have internal predecessors, (379), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 10:50:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 475 transitions. [2024-11-07 10:50:18,680 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 475 transitions. Word has length 115 [2024-11-07 10:50:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 475 transitions. [2024-11-07 10:50:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 475 transitions. [2024-11-07 10:50:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 10:50:18,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:18,682 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:18,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:50:18,682 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:18,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1310951966, now seen corresponding path program 1 times [2024-11-07 10:50:18,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:18,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293678063] [2024-11-07 10:50:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:18,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:50:18,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293678063] [2024-11-07 10:50:18,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293678063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:50:18,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079768719] [2024-11-07 10:50:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:18,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:18,952 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:50:18,955 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:50:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:19,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:50:19,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:19,295 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 23 treesize of output 11 [2024-11-07 10:50:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 10:50:19,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:50:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:50:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079768719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:50:19,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:50:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-07 10:50:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132808090] [2024-11-07 10:50:19,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:50:19,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:50:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:50:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:50:19,507 INFO L87 Difference]: Start difference. First operand 387 states and 475 transitions. Second operand has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:50:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:20,134 INFO L93 Difference]: Finished difference Result 589 states and 722 transitions. [2024-11-07 10:50:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:50:20,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2024-11-07 10:50:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:20,136 INFO L225 Difference]: With dead ends: 589 [2024-11-07 10:50:20,136 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 10:50:20,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:50:20,139 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 199 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:20,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 250 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:50:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 10:50:20,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2024-11-07 10:50:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.162162162162162) internal successors, (215), 187 states have internal predecessors, (215), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:50:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 279 transitions. [2024-11-07 10:50:20,167 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 279 transitions. Word has length 116 [2024-11-07 10:50:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:20,167 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 279 transitions. [2024-11-07 10:50:20,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.5) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-07 10:50:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 279 transitions. [2024-11-07 10:50:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:50:20,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:20,168 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,188 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:50:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 10:50:20,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -719202291, now seen corresponding path program 1 times [2024-11-07 10:50:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672919672] [2024-11-07 10:50:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:20,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:20,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672919672] [2024-11-07 10:50:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672919672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:20,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:20,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:20,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804324931] [2024-11-07 10:50:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:20,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:20,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:20,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:20,818 INFO L87 Difference]: Start difference. First operand 227 states and 279 transitions. Second operand has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:21,165 INFO L93 Difference]: Finished difference Result 418 states and 512 transitions. [2024-11-07 10:50:21,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:21,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2024-11-07 10:50:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:21,168 INFO L225 Difference]: With dead ends: 418 [2024-11-07 10:50:21,168 INFO L226 Difference]: Without dead ends: 227 [2024-11-07 10:50:21,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:50:21,169 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 94 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 153 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:50:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-07 10:50:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-07 10:50:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.1405405405405404) internal successors, (211), 187 states have internal predecessors, (211), 32 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:50:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 275 transitions. [2024-11-07 10:50:21,207 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 275 transitions. Word has length 117 [2024-11-07 10:50:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:21,208 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 275 transitions. [2024-11-07 10:50:21,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.0) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:50:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 275 transitions. [2024-11-07 10:50:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:50:21,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:21,209 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:21,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:50:21,210 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:21,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:21,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1127232922, now seen corresponding path program 1 times [2024-11-07 10:50:21,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:21,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692880441] [2024-11-07 10:50:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:21,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:21,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692880441] [2024-11-07 10:50:21,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692880441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:21,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:21,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579342917] [2024-11-07 10:50:21,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:21,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:21,938 INFO L87 Difference]: Start difference. First operand 227 states and 275 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:22,488 INFO L93 Difference]: Finished difference Result 423 states and 508 transitions. [2024-11-07 10:50:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-07 10:50:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:22,491 INFO L225 Difference]: With dead ends: 423 [2024-11-07 10:50:22,491 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 10:50:22,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:50:22,492 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:22,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 367 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:50:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 10:50:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2024-11-07 10:50:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 188 states have (on average 1.127659574468085) internal successors, (212), 190 states have internal predecessors, (212), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 10:50:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 276 transitions. [2024-11-07 10:50:22,527 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 276 transitions. Word has length 119 [2024-11-07 10:50:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:22,528 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 276 transitions. [2024-11-07 10:50:22,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:50:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2024-11-07 10:50:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:50:22,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:22,529 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:22,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:50:22,530 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:22,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1919891586, now seen corresponding path program 1 times [2024-11-07 10:50:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:22,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740837567] [2024-11-07 10:50:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63638719] [2024-11-07 10:50:22,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:22,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:22,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:22,606 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:50:22,608 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:50:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:22,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-07 10:50:22,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:22,924 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 46 treesize of output 45 [2024-11-07 10:50:22,968 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 61 treesize of output 53 [2024-11-07 10:50:23,032 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:50:23,074 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:50:23,116 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:50:23,160 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:50:23,207 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:50:23,253 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:50:23,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2024-11-07 10:50:23,321 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:50:23,333 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 15 treesize of output 15 [2024-11-07 10:50:23,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:23,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 59 [2024-11-07 10:50:23,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:23,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 28 [2024-11-07 10:50:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:23,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:50:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740837567] [2024-11-07 10:50:23,656 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:23,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63638719] [2024-11-07 10:50:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63638719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:23,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:23,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:50:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651852481] [2024-11-07 10:50:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:50:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:50:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:50:23,659 INFO L87 Difference]: Start difference. First operand 231 states and 276 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:24,343 INFO L93 Difference]: Finished difference Result 646 states and 758 transitions. [2024-11-07 10:50:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:50:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-11-07 10:50:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:24,349 INFO L225 Difference]: With dead ends: 646 [2024-11-07 10:50:24,349 INFO L226 Difference]: Without dead ends: 451 [2024-11-07 10:50:24,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:50:24,351 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 140 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:24,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 338 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:50:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-07 10:50:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 275. [2024-11-07 10:50:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 228 states have (on average 1.118421052631579) internal successors, (255), 229 states have internal predecessors, (255), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:50:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 323 transitions. [2024-11-07 10:50:24,388 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 323 transitions. Word has length 120 [2024-11-07 10:50:24,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:24,389 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 323 transitions. [2024-11-07 10:50:24,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 323 transitions. [2024-11-07 10:50:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 10:50:24,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:24,392 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,413 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:50:24,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 10:50:24,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:24,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash 293814618, now seen corresponding path program 1 times [2024-11-07 10:50:24,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:24,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320281174] [2024-11-07 10:50:24,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:24,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:24,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:24,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320281174] [2024-11-07 10:50:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320281174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822327939] [2024-11-07 10:50:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:24,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:24,845 INFO L87 Difference]: Start difference. First operand 275 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:25,201 INFO L93 Difference]: Finished difference Result 650 states and 768 transitions. [2024-11-07 10:50:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:25,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2024-11-07 10:50:25,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:25,204 INFO L225 Difference]: With dead ends: 650 [2024-11-07 10:50:25,205 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 10:50:25,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:50:25,206 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 89 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:25,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 774 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:50:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 10:50:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 296. [2024-11-07 10:50:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 249 states have (on average 1.1244979919678715) internal successors, (280), 250 states have internal predecessors, (280), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:50:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 348 transitions. [2024-11-07 10:50:25,237 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 348 transitions. Word has length 120 [2024-11-07 10:50:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:25,237 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 348 transitions. [2024-11-07 10:50:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 348 transitions. [2024-11-07 10:50:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:50:25,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:25,239 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:50:25,239 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:25,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 710658479, now seen corresponding path program 1 times [2024-11-07 10:50:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738042291] [2024-11-07 10:50:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566653847] [2024-11-07 10:50:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:25,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:25,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:25,323 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:50:25,325 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:50:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:25,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 10:50:25,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:25,679 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 70 treesize of output 69 [2024-11-07 10:50:25,943 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 91 treesize of output 83 [2024-11-07 10:50:26,021 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 19 treesize of output 1 [2024-11-07 10:50:26,046 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 19 treesize of output 1 [2024-11-07 10:50:26,063 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 19 treesize of output 1 [2024-11-07 10:50:26,080 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 19 treesize of output 1 [2024-11-07 10:50:26,100 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 19 treesize of output 1 [2024-11-07 10:50:26,121 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 19 treesize of output 1 [2024-11-07 10:50:26,150 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 41 treesize of output 1 [2024-11-07 10:50:26,157 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:50:26,163 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 19 treesize of output 19 [2024-11-07 10:50:26,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:26,328 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 60 treesize of output 53 [2024-11-07 10:50:26,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:26,503 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 59 treesize of output 23 [2024-11-07 10:50:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:26,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:50:26,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738042291] [2024-11-07 10:50:26,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:26,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566653847] [2024-11-07 10:50:26,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566653847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:26,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:26,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788748549] [2024-11-07 10:50:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:26,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:50:26,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:26,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:50:26,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:26,600 INFO L87 Difference]: Start difference. First operand 296 states and 348 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:28,986 INFO L93 Difference]: Finished difference Result 699 states and 820 transitions. [2024-11-07 10:50:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:50:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-07 10:50:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:28,989 INFO L225 Difference]: With dead ends: 699 [2024-11-07 10:50:28,989 INFO L226 Difference]: Without dead ends: 483 [2024-11-07 10:50:28,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:50:28,991 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 135 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:28,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 387 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 10:50:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-07 10:50:29,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 307. [2024-11-07 10:50:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 260 states have (on average 1.1192307692307693) internal successors, (291), 261 states have internal predecessors, (291), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 10:50:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 359 transitions. [2024-11-07 10:50:29,018 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 359 transitions. Word has length 121 [2024-11-07 10:50:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:29,018 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 359 transitions. [2024-11-07 10:50:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 359 transitions. [2024-11-07 10:50:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:50:29,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:29,020 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,030 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:50:29,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:29,225 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:29,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2088738115, now seen corresponding path program 1 times [2024-11-07 10:50:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034598315] [2024-11-07 10:50:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034598315] [2024-11-07 10:50:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034598315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:50:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266237890] [2024-11-07 10:50:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:50:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:50:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:50:29,973 INFO L87 Difference]: Start difference. First operand 307 states and 359 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:30,430 INFO L93 Difference]: Finished difference Result 538 states and 630 transitions. [2024-11-07 10:50:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:50:30,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-07 10:50:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:30,434 INFO L225 Difference]: With dead ends: 538 [2024-11-07 10:50:30,434 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 10:50:30,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:50:30,435 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:30,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 837 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:50:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 10:50:30,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2024-11-07 10:50:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 269 states have (on average 1.1152416356877324) internal successors, (300), 270 states have internal predecessors, (300), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 372 transitions. [2024-11-07 10:50:30,477 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 372 transitions. Word has length 122 [2024-11-07 10:50:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 372 transitions. [2024-11-07 10:50:30,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 372 transitions. [2024-11-07 10:50:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:50:30,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:30,480 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 10:50:30,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1501932101, now seen corresponding path program 1 times [2024-11-07 10:50:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649340798] [2024-11-07 10:50:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165338306] [2024-11-07 10:50:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:30,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:30,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:30,564 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:50:30,566 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:50:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:30,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 10:50:30,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:30,873 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 19 treesize of output 1 [2024-11-07 10:50:30,881 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 19 treesize of output 1 [2024-11-07 10:50:30,886 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 19 treesize of output 1 [2024-11-07 10:50:30,896 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 41 treesize of output 19 [2024-11-07 10:50:30,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:30,914 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 31 treesize of output 22 [2024-11-07 10:50:30,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:30,927 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 35 treesize of output 40 [2024-11-07 10:50:30,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:30,979 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 89 treesize of output 65 [2024-11-07 10:50:35,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:35,694 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 134 treesize of output 38 [2024-11-07 10:50:35,715 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:35,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:50:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649340798] [2024-11-07 10:50:35,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165338306] [2024-11-07 10:50:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165338306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:35,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:35,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:35,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457226143] [2024-11-07 10:50:35,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:35,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:35,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:35,719 INFO L87 Difference]: Start difference. First operand 319 states and 372 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:37,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-07 10:50:41,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-07 10:50:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:41,898 INFO L93 Difference]: Finished difference Result 661 states and 771 transitions. [2024-11-07 10:50:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-07 10:50:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:41,907 INFO L225 Difference]: With dead ends: 661 [2024-11-07 10:50:41,907 INFO L226 Difference]: Without dead ends: 433 [2024-11-07 10:50:41,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:41,909 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:41,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 481 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-07 10:50:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-07 10:50:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 324. [2024-11-07 10:50:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 274 states have (on average 1.1167883211678833) internal successors, (306), 275 states have internal predecessors, (306), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:41,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 378 transitions. [2024-11-07 10:50:41,940 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 378 transitions. Word has length 122 [2024-11-07 10:50:41,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:41,941 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 378 transitions. [2024-11-07 10:50:41,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 378 transitions. [2024-11-07 10:50:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:50:41,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:41,944 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,963 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:50:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-07 10:50:42,148 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2065680571, now seen corresponding path program 1 times [2024-11-07 10:50:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208388207] [2024-11-07 10:50:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581723653] [2024-11-07 10:50:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:42,220 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:50:42,222 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:50:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:42,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 10:50:42,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:42,546 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 19 treesize of output 1 [2024-11-07 10:50:42,549 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 19 treesize of output 1 [2024-11-07 10:50:42,553 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 19 treesize of output 1 [2024-11-07 10:50:42,558 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 41 treesize of output 19 [2024-11-07 10:50:42,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:42,572 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 31 treesize of output 22 [2024-11-07 10:50:42,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:42,582 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 35 treesize of output 40 [2024-11-07 10:50:42,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:42,634 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 81 treesize of output 74 [2024-11-07 10:50:42,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:42,791 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 104 treesize of output 32 [2024-11-07 10:50:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:42,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:50:42,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:42,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208388207] [2024-11-07 10:50:42,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:42,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581723653] [2024-11-07 10:50:42,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581723653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:42,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233728214] [2024-11-07 10:50:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:42,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:42,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:42,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:42,812 INFO L87 Difference]: Start difference. First operand 324 states and 378 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:43,661 INFO L93 Difference]: Finished difference Result 721 states and 839 transitions. [2024-11-07 10:50:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:43,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-07 10:50:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:43,665 INFO L225 Difference]: With dead ends: 721 [2024-11-07 10:50:43,665 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 10:50:43,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:43,667 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 218 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:43,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 355 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:50:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 10:50:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 336. [2024-11-07 10:50:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 286 states have (on average 1.1153846153846154) internal successors, (319), 287 states have internal predecessors, (319), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 391 transitions. [2024-11-07 10:50:43,704 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 391 transitions. Word has length 122 [2024-11-07 10:50:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:43,704 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 391 transitions. [2024-11-07 10:50:43,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 391 transitions. [2024-11-07 10:50:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:50:43,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:43,706 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,726 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:50:43,910 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:50:43,911 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:43,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:43,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1642480711, now seen corresponding path program 1 times [2024-11-07 10:50:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:43,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332451128] [2024-11-07 10:50:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:43,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:50:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332451128] [2024-11-07 10:50:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332451128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:50:44,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929543039] [2024-11-07 10:50:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:50:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:50:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:50:44,141 INFO L87 Difference]: Start difference. First operand 336 states and 391 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:44,379 INFO L93 Difference]: Finished difference Result 587 states and 684 transitions. [2024-11-07 10:50:44,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:50:44,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2024-11-07 10:50:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:44,382 INFO L225 Difference]: With dead ends: 587 [2024-11-07 10:50:44,382 INFO L226 Difference]: Without dead ends: 342 [2024-11-07 10:50:44,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:50:44,383 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 54 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:44,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 588 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:50:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-07 10:50:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 337. [2024-11-07 10:50:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 287 states have (on average 1.1149825783972125) internal successors, (320), 288 states have internal predecessors, (320), 36 states have call successors, (36), 13 states have call predecessors, (36), 13 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 392 transitions. [2024-11-07 10:50:44,414 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 392 transitions. Word has length 122 [2024-11-07 10:50:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:44,414 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 392 transitions. [2024-11-07 10:50:44,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 392 transitions. [2024-11-07 10:50:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 10:50:44,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:44,416 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 10:50:44,416 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1448611834, now seen corresponding path program 1 times [2024-11-07 10:50:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843169150] [2024-11-07 10:50:44,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:50:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:50:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:50:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:50:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:50:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:50:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:50:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:50:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:50:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:50:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:50:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:50:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:50:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:50:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:50:45,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:45,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843169150] [2024-11-07 10:50:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843169150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:50:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265343286] [2024-11-07 10:50:45,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:45,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:45,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:45,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:50:45,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 10:50:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:45,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 10:50:45,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:45,300 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:50:45,398 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 25 treesize of output 13 [2024-11-07 10:50:45,451 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 25 treesize of output 13 [2024-11-07 10:50:45,502 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 25 treesize of output 13 [2024-11-07 10:50:45,556 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 25 treesize of output 13 [2024-11-07 10:50:45,615 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 25 treesize of output 13 [2024-11-07 10:50:45,668 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 39 treesize of output 13 [2024-11-07 10:50:45,685 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 25 treesize of output 13 [2024-11-07 10:50:45,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2024-11-07 10:50:45,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:45,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 48 [2024-11-07 10:50:45,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:45,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 19 [2024-11-07 10:50:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 139 proven. 30 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-07 10:50:45,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:50:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-07 10:50:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265343286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:50:46,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:50:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2024-11-07 10:50:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593446983] [2024-11-07 10:50:46,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:50:46,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 10:50:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:46,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 10:50:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:50:46,129 INFO L87 Difference]: Start difference. First operand 337 states and 392 transitions. Second operand has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-07 10:50:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:47,138 INFO L93 Difference]: Finished difference Result 577 states and 657 transitions. [2024-11-07 10:50:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 10:50:47,143 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) Word has length 123 [2024-11-07 10:50:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:47,147 INFO L225 Difference]: With dead ends: 577 [2024-11-07 10:50:47,147 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 10:50:47,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 10:50:47,148 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 164 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:47,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 331 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:50:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 10:50:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2024-11-07 10:50:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 231 states have (on average 1.051948051948052) internal successors, (243), 232 states have internal predecessors, (243), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2024-11-07 10:50:47,185 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 123 [2024-11-07 10:50:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:47,185 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2024-11-07 10:50:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 22 states have internal predecessors, (137), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 5 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-07 10:50:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2024-11-07 10:50:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-07 10:50:47,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:47,188 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:50:47,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 10:50:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-07 10:50:47,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:47,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash 29267610, now seen corresponding path program 1 times [2024-11-07 10:50:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515595820] [2024-11-07 10:50:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:47,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107647222] [2024-11-07 10:50:47,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:47,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:50:47,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 10:50:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:48,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 10:50:48,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:48,171 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 9 treesize of output 3 [2024-11-07 10:50:48,175 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 19 treesize of output 1 [2024-11-07 10:50:48,178 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 19 treesize of output 1 [2024-11-07 10:50:48,182 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 19 treesize of output 1 [2024-11-07 10:50:48,185 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 19 treesize of output 1 [2024-11-07 10:50:48,188 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 19 treesize of output 1 [2024-11-07 10:50:48,193 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 41 treesize of output 1 [2024-11-07 10:50:48,196 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:50:48,199 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 19 treesize of output 19 [2024-11-07 10:50:48,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:48,250 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 66 treesize of output 69 [2024-11-07 10:50:48,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:48,421 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 86 treesize of output 26 [2024-11-07 10:50:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2024-11-07 10:50:48,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:50:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515595820] [2024-11-07 10:50:48,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107647222] [2024-11-07 10:50:48,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107647222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:50:48,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:50:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:50:48,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495304168] [2024-11-07 10:50:48,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:48,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:50:48,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:50:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:50:48,482 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:49,457 INFO L93 Difference]: Finished difference Result 477 states and 523 transitions. [2024-11-07 10:50:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:50:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2024-11-07 10:50:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:49,459 INFO L225 Difference]: With dead ends: 477 [2024-11-07 10:50:49,459 INFO L226 Difference]: Without dead ends: 290 [2024-11-07 10:50:49,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:50:49,461 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:49,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 433 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:50:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-07 10:50:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 253. [2024-11-07 10:50:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.0353535353535352) internal successors, (205), 199 states have internal predecessors, (205), 36 states have call successors, (36), 18 states have call predecessors, (36), 18 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:50:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 277 transitions. [2024-11-07 10:50:49,496 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 277 transitions. Word has length 236 [2024-11-07 10:50:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:49,497 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 277 transitions. [2024-11-07 10:50:49,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 277 transitions. [2024-11-07 10:50:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 10:50:49,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:50:49,501 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:50:49,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:50:49,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:49,702 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:50:49,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:50:49,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1005051411, now seen corresponding path program 1 times [2024-11-07 10:50:49,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:50:49,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441418421] [2024-11-07 10:50:49,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:49,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:50:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:50:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [569045725] [2024-11-07 10:50:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:50:49,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:50:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:50:49,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:50:49,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 10:50:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:50:50,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-07 10:50:50,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:50:50,417 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 19 treesize of output 1 [2024-11-07 10:50:50,423 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 19 treesize of output 1 [2024-11-07 10:50:50,425 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 19 treesize of output 1 [2024-11-07 10:50:50,427 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 19 treesize of output 1 [2024-11-07 10:50:50,431 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 41 treesize of output 1 [2024-11-07 10:50:50,433 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:50:50,435 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 19 treesize of output 19 [2024-11-07 10:50:50,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:50,480 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 35 treesize of output 40 [2024-11-07 10:50:50,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:50,599 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 40 treesize of output 10 [2024-11-07 10:50:50,604 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 19 treesize of output 1 [2024-11-07 10:50:50,607 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 19 treesize of output 1 [2024-11-07 10:50:50,613 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 19 treesize of output 1 [2024-11-07 10:50:50,619 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 19 treesize of output 1 [2024-11-07 10:50:50,622 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 19 treesize of output 1 [2024-11-07 10:50:50,626 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 19 treesize of output 1 [2024-11-07 10:50:50,629 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 41 treesize of output 1 [2024-11-07 10:50:50,631 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:50:50,634 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 19 treesize of output 19 [2024-11-07 10:50:50,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:50,665 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 58 treesize of output 51 [2024-11-07 10:50:50,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:50:50,758 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 57 treesize of output 21 [2024-11-07 10:50:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2024-11-07 10:50:50,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:50:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2024-11-07 10:50:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:50:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441418421] [2024-11-07 10:50:51,216 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 10:50:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569045725] [2024-11-07 10:50:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569045725] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:50:51,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:50:51,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-07 10:50:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297692222] [2024-11-07 10:50:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:50:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:50:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:50:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:50:51,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:50:51,218 INFO L87 Difference]: Start difference. First operand 253 states and 277 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:50:52,111 INFO L93 Difference]: Finished difference Result 428 states and 465 transitions. [2024-11-07 10:50:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:50:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2024-11-07 10:50:52,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:50:52,113 INFO L225 Difference]: With dead ends: 428 [2024-11-07 10:50:52,113 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 10:50:52,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:50:52,115 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:50:52,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 234 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:50:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 10:50:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 10:50:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 10:50:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 10:50:52,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2024-11-07 10:50:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:50:52,118 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 10:50:52,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:50:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 10:50:52,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 10:50:52,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:50:52,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 10:50:52,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-07 10:50:52,327 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, 1, 1, 1] [2024-11-07 10:50:52,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 10:51:02,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:51:02,368 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:102) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:105) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-07 10:51:02,376 INFO L158 Benchmark]: Toolchain (without parser) took 56734.71ms. Allocated memory was 117.4MB in the beginning and 486.5MB in the end (delta: 369.1MB). Free memory was 91.9MB in the beginning and 290.2MB in the end (delta: -198.3MB). Peak memory consumption was 291.5MB. Max. memory is 16.1GB. [2024-11-07 10:51:02,378 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:51:02,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.53ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 76.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:51:02,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.83ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:51:02,378 INFO L158 Benchmark]: Boogie Preprocessor took 93.03ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 69.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:51:02,378 INFO L158 Benchmark]: RCFGBuilder took 612.55ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 89.2MB in the end (delta: -19.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-11-07 10:51:02,379 INFO L158 Benchmark]: TraceAbstraction took 55659.46ms. Allocated memory was 117.4MB in the beginning and 486.5MB in the end (delta: 369.1MB). Free memory was 88.8MB in the beginning and 290.2MB in the end (delta: -201.5MB). Peak memory consumption was 286.5MB. Max. memory is 16.1GB. [2024-11-07 10:51:02,379 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.80ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.53ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 76.3MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.83ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 93.03ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 69.9MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 612.55ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 89.2MB in the end (delta: -19.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55659.46ms. Allocated memory was 117.4MB in the beginning and 486.5MB in the end (delta: 369.1MB). Free memory was 88.8MB in the beginning and 290.2MB in the end (delta: -201.5MB). Peak memory consumption was 286.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 27, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2228 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2207 mSDsluCounter, 11033 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8276 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8319 IncrementalHoareTripleChecker+Invalid, 8771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 2757 mSDtfsCounter, 8319 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2537 GetRequests, 2316 SyntacticMatches, 5 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=14, InterpolantAutomatonStates: 197, 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, 27 MinimizatonAttempts, 1098 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 4585 NumberOfCodeBlocks, 4585 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4071 ConstructedInterpolants, 0 QuantifiedInterpolants, 17225 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3612 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 32 InterpolantComputations, 25 PerfectInterpolantSequences, 15174/15269 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-07 10:51:02,538 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-87.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 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:51:04,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:51:04,773 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:51:04,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:51:04,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:51:04,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:51:04,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:51:04,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:51:04,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:51:04,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:51:04,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:51:04,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:51:04,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:51:04,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:51:04,810 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:51:04,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:51:04,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:51:04,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:51:04,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:51:04,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:51:04,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:51:04,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:51:04,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:51:04,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:51:04,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:51:04,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:51:04,815 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 -> 35d5d98b2de2e0b78fe3c9610b248d897f0c998920a2ad434c7b6ace2f6d7db4 [2024-11-07 10:51:05,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:51:05,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:51:05,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:51:05,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:51:05,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:51:05,101 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-87.i [2024-11-07 10:51:06,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:51:06,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:51:06,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-87.i [2024-11-07 10:51:06,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecf800cb4/005f754d449d49c49f5d06e5bd8441da/FLAG9d458a39a [2024-11-07 10:51:06,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecf800cb4/005f754d449d49c49f5d06e5bd8441da [2024-11-07 10:51:06,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:51:06,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:51:06,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:51:06,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:51:06,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:51:06,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:51:06" (1/1) ... [2024-11-07 10:51:06,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cea261f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:06, skipping insertion in model container [2024-11-07 10:51:06,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:51:06" (1/1) ... [2024-11-07 10:51:06,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:51:06,950 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-87.i[916,929] [2024-11-07 10:51:07,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:51:07,026 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:51:07,038 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-87.i[916,929] [2024-11-07 10:51:07,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:51:07,133 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:51:07,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:07 WrapperNode [2024-11-07 10:51:07,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:51:07,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:51:07,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:51:07,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:51:07,144 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:07" (1/1) ... [2024-11-07 10:51:07,167 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:07" (1/1) ... [2024-11-07 10:51:07,209 INFO L138 Inliner]: procedures = 31, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-11-07 10:51:07,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:51:07,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:51:07,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:51:07,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:51:07,221 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:07" (1/1) ... [2024-11-07 10:51:07,222 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:07" (1/1) ... [2024-11-07 10:51:07,227 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:07" (1/1) ... [2024-11-07 10:51:07,245 INFO L175 MemorySlicer]: Split 120 memory accesses to 2 slices as follows [2, 118]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-07 10:51:07,246 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:07" (1/1) ... [2024-11-07 10:51:07,246 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:07" (1/1) ... [2024-11-07 10:51:07,269 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:07" (1/1) ... [2024-11-07 10:51:07,273 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:07" (1/1) ... [2024-11-07 10:51:07,275 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:07" (1/1) ... [2024-11-07 10:51:07,278 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:07" (1/1) ... [2024-11-07 10:51:07,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:51:07,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:51:07,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:51:07,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:51:07,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:07" (1/1) ... [2024-11-07 10:51:07,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:51:07,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:51:07,312 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:07,315 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:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:51:07,334 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:51:07,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:51:07,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:51:07,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:51:07,446 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:51:07,448 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:51:07,973 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-07 10:51:07,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:51:07,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:51:07,988 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:51:07,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:51:07 BoogieIcfgContainer [2024-11-07 10:51:07,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:51:07,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:51:07,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:51:07,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:51:07,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:51:06" (1/3) ... [2024-11-07 10:51:07,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48985d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:51:07, skipping insertion in model container [2024-11-07 10:51:07,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:51:07" (2/3) ... [2024-11-07 10:51:07,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48985d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:51:07, skipping insertion in model container [2024-11-07 10:51:07,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:51:07" (3/3) ... [2024-11-07 10:51:07,999 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-87.i [2024-11-07 10:51:08,013 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:51:08,013 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:51:08,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:51:08,075 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;@787fccb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:51:08,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:51:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:51:08,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:08,089 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:08,096 INFO L85 PathProgramCache]: Analyzing trace with hash 464292550, now seen corresponding path program 1 times [2024-11-07 10:51:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118507250] [2024-11-07 10:51:08,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:08,108 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:51:08,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:08,113 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:51:08,114 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:51:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:08,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:51:08,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-07 10:51:08,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:08,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118507250] [2024-11-07 10:51:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118507250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:08,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:08,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:51:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115694486] [2024-11-07 10:51:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:51:08,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:08,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:51:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:51:08,444 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:51:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:08,472 INFO L93 Difference]: Finished difference Result 167 states and 256 transitions. [2024-11-07 10:51:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:51:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-07 10:51:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:08,479 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:51:08,480 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 10:51:08,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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:08,488 INFO L432 NwaCegarLoop]: 115 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, 115 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:08,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 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:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 10:51:08,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-07 10:51:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2024-11-07 10:51:08,530 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2024-11-07 10:51:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:08,531 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2024-11-07 10:51:08,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-07 10:51:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2024-11-07 10:51:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 10:51:08,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:08,534 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,539 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:51:08,734 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:51:08,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 450654890, now seen corresponding path program 1 times [2024-11-07 10:51:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537410129] [2024-11-07 10:51:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:08,736 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:51:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:08,740 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:51:08,741 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:51:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:08,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:51:08,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:51:09,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:09,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537410129] [2024-11-07 10:51:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537410129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:09,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:09,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437351615] [2024-11-07 10:51:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:09,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:09,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:09,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:09,031 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:09,093 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2024-11-07 10:51:09,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-11-07 10:51:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:09,096 INFO L225 Difference]: With dead ends: 165 [2024-11-07 10:51:09,096 INFO L226 Difference]: Without dead ends: 85 [2024-11-07 10:51:09,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 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:09,097 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 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:09,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 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:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-07 10:51:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-07 10:51:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2024-11-07 10:51:09,116 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2024-11-07 10:51:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:09,118 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2024-11-07 10:51:09,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2024-11-07 10:51:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:51:09,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:09,121 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,129 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:51:09,322 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:51:09,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -114037682, now seen corresponding path program 1 times [2024-11-07 10:51:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:09,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060450464] [2024-11-07 10:51:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:09,324 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:51:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:09,327 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:51:09,328 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:51:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:09,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:51:09,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:51:09,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:09,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060450464] [2024-11-07 10:51:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060450464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:51:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986488584] [2024-11-07 10:51:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:51:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:09,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:51:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:51:09,536 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:09,582 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2024-11-07 10:51:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:51:09,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:51:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:09,585 INFO L225 Difference]: With dead ends: 170 [2024-11-07 10:51:09,587 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 10:51:09,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 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:09,588 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 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:09,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 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:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 10:51:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-07 10:51:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-07 10:51:09,606 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 113 [2024-11-07 10:51:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:09,606 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-07 10:51:09,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-07 10:51:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:51:09,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:09,611 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,617 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:51:09,811 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:51:09,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:09,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash 566020688, now seen corresponding path program 1 times [2024-11-07 10:51:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691629208] [2024-11-07 10:51:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:09,813 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:51:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:09,815 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:51:09,816 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:51:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:09,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:51:09,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:51:10,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:10,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691629208] [2024-11-07 10:51:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691629208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:10,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:51:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505237487] [2024-11-07 10:51:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:51:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:51:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:51:10,027 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:10,073 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2024-11-07 10:51:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:51:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:51:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:10,075 INFO L225 Difference]: With dead ends: 174 [2024-11-07 10:51:10,075 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 10:51:10,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:51:10,076 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 425 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:51:10,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 425 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 10:51:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2024-11-07 10:51:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2024-11-07 10:51:10,088 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 113 [2024-11-07 10:51:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:10,088 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2024-11-07 10:51:10,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2024-11-07 10:51:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:51:10,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:10,093 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,100 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:51:10,293 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:51:10,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1953939246, now seen corresponding path program 1 times [2024-11-07 10:51:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645756244] [2024-11-07 10:51:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:10,295 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:51:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:10,297 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:51:10,298 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:51:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:10,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:51:10,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 10:51:10,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:10,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:10,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645756244] [2024-11-07 10:51:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645756244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:10,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:10,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:51:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658590014] [2024-11-07 10:51:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:10,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:51:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:10,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:51:10,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:51:10,490 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:10,550 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2024-11-07 10:51:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:51:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-11-07 10:51:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:10,552 INFO L225 Difference]: With dead ends: 178 [2024-11-07 10:51:10,552 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:51:10,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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:51:10,553 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 525 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:51:10,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 525 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:51:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:51:10,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-07 10:51:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:51:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-07 10:51:10,563 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 113 [2024-11-07 10:51:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:10,564 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-07 10:51:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-07 10:51:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-07 10:51:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:51:10,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:10,566 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,574 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:51:10,770 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:51:10,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1952092204, now seen corresponding path program 1 times [2024-11-07 10:51:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763206661] [2024-11-07 10:51:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:10,772 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:51:10,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:10,776 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:51:10,778 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:51:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:10,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 10:51:10,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:11,199 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 35 treesize of output 17 [2024-11-07 10:51:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 10:51:11,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:11,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:11,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763206661] [2024-11-07 10:51:11,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763206661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:11,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:11,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:51:11,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947984860] [2024-11-07 10:51:11,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:11,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:51:11,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:11,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:51:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:51:11,257 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:51:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:51:12,722 INFO L93 Difference]: Finished difference Result 217 states and 291 transitions. [2024-11-07 10:51:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 10:51:12,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-11-07 10:51:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:51:12,724 INFO L225 Difference]: With dead ends: 217 [2024-11-07 10:51:12,724 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 10:51:12,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:51:12,726 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:51:12,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 400 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 10:51:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 10:51:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2024-11-07 10:51:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.202127659574468) internal successors, (113), 95 states have internal predecessors, (113), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 10:51:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2024-11-07 10:51:12,737 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 113 [2024-11-07 10:51:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:51:12,738 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2024-11-07 10:51:12,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-07 10:51:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2024-11-07 10:51:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:51:12,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:51:12,739 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,746 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:51:12,940 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:51:12,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:51:12,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:51:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 958874285, now seen corresponding path program 1 times [2024-11-07 10:51:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:51:12,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029276484] [2024-11-07 10:51:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:51:12,941 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:51:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:51:12,943 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:51:12,944 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:51:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:51:13,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:51:13,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:51:13,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:13,299 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 70 treesize of output 71 [2024-11-07 10:51:13,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:13,460 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 89 treesize of output 80 [2024-11-07 10:51:13,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:13,556 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 93 treesize of output 80 [2024-11-07 10:51:13,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:13,630 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 95 treesize of output 100 [2024-11-07 10:51:13,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:51:13,756 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 101 treesize of output 35 [2024-11-07 10:51:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 10:51:13,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:51:13,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:51:13,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029276484] [2024-11-07 10:51:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029276484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:51:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:51:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:51:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539057435] [2024-11-07 10:51:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:51:13,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:51:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:51:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:51:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:51:13,804 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 13 states, 11 states have (on average 4.909090909090909) internal successors, (54), 12 states have internal predecessors, (54), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)