./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314'] 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-22.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:42:40,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:42:40,960 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:42:40,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:42:40,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:42:40,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:42:40,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:42:40,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:42:40,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:42:40,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:42:40,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:42:40,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:42:40,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:42:40,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:42:40,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:42:40,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:42:40,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:40,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:42:40,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:42:40,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:42:40,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:42:40,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:42:40,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:42:40,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:42:40,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:42:40,997 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 -> e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 [2024-11-07 10:42:41,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:42:41,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:42:41,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:42:41,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:42:41,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:42:41,277 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-22.i [2024-11-07 10:42:42,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:42:42,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:42:42,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-07 10:42:42,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e248b6ea/9d1e6843cffa4fc99ee3475102819ebb/FLAGfb4d0d5f4 [2024-11-07 10:42:42,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e248b6ea/9d1e6843cffa4fc99ee3475102819ebb [2024-11-07 10:42:42,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:42:42,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:42:42,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:42,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:42:42,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:42:42,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:42" (1/1) ... [2024-11-07 10:42:42,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3add927f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:42, skipping insertion in model container [2024-11-07 10:42:42,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:42" (1/1) ... [2024-11-07 10:42:42,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:42:42,936 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-22.i[916,929] [2024-11-07 10:42:42,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:43,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:42:43,011 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-22.i[916,929] [2024-11-07 10:42:43,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:42:43,073 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:42:43,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43 WrapperNode [2024-11-07 10:42:43,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:42:43,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:43,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:42:43,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:42:43,081 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:42:43" (1/1) ... [2024-11-07 10:42:43,094 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:42:43" (1/1) ... [2024-11-07 10:42:43,147 INFO L138 Inliner]: procedures = 30, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2024-11-07 10:42:43,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:42:43,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:42:43,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:42:43,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:42:43,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,180 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:42:43,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,229 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:42:43,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:42:43,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:42:43,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:42:43,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (1/1) ... [2024-11-07 10:42:43,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:42:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:42:43,270 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:42:43,274 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:42:43,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:42:43,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:42:43,297 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:42:43,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:42:43,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:42:43,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:42:43,384 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:42:43,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:42:43,895 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-07 10:42:43,895 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:42:43,909 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:42:43,910 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:42:43,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:43 BoogieIcfgContainer [2024-11-07 10:42:43,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:42:43,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:42:43,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:42:43,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:42:43,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:42" (1/3) ... [2024-11-07 10:42:43,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efd0187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:43, skipping insertion in model container [2024-11-07 10:42:43,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:43" (2/3) ... [2024-11-07 10:42:43,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efd0187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:43, skipping insertion in model container [2024-11-07 10:42:43,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:43" (3/3) ... [2024-11-07 10:42:43,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-07 10:42:43,933 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:42:43,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:42:43,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:42:43,992 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;@73ea07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:42:43,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:42:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:42:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:42:44,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:44,005 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:44,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1659460873, now seen corresponding path program 1 times [2024-11-07 10:42:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679597190] [2024-11-07 10:42:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679597190] [2024-11-07 10:42:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679597190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:44,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:42:44,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951639362] [2024-11-07 10:42:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:44,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:42:44,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:42:44,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:42:44,364 INFO L87 Difference]: Start difference. First operand has 105 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 94 states have internal predecessors, (136), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:42:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:44,388 INFO L93 Difference]: Finished difference Result 203 states and 311 transitions. [2024-11-07 10:42:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:42:44,389 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2024-11-07 10:42:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:44,394 INFO L225 Difference]: With dead ends: 203 [2024-11-07 10:42:44,394 INFO L226 Difference]: Without dead ends: 101 [2024-11-07 10:42:44,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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:42:44,398 INFO L432 NwaCegarLoop]: 146 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, 146 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:42:44,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:42:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-07 10:42:44,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-07 10:42:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:42:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2024-11-07 10:42:44,435 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 90 [2024-11-07 10:42:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:44,436 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2024-11-07 10:42:44,436 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:42:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2024-11-07 10:42:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:42:44,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:44,442 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:44,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:42:44,443 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:44,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash 328924025, now seen corresponding path program 1 times [2024-11-07 10:42:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904025235] [2024-11-07 10:42:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904025235] [2024-11-07 10:42:45,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904025235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:45,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:45,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:42:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075251242] [2024-11-07 10:42:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:42:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:45,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:42:45,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:42:45,969 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:47,094 INFO L93 Difference]: Finished difference Result 747 states and 1086 transitions. [2024-11-07 10:42:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 10:42:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-07 10:42:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:47,103 INFO L225 Difference]: With dead ends: 747 [2024-11-07 10:42:47,103 INFO L226 Difference]: Without dead ends: 649 [2024-11-07 10:42:47,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:42:47,106 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1045 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:47,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 891 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:42:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-07 10:42:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2024-11-07 10:42:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 430 states have (on average 1.427906976744186) internal successors, (614), 430 states have internal predecessors, (614), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 10:42:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 704 transitions. [2024-11-07 10:42:47,186 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 704 transitions. Word has length 90 [2024-11-07 10:42:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:47,186 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 704 transitions. [2024-11-07 10:42:47,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 704 transitions. [2024-11-07 10:42:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:42:47,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:47,193 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:47,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:42:47,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:47,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash 915730039, now seen corresponding path program 1 times [2024-11-07 10:42:47,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:47,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005848096] [2024-11-07 10:42:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005848096] [2024-11-07 10:42:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005848096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:48,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:42:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821009035] [2024-11-07 10:42:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:48,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:48,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:48,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:48,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:48,111 INFO L87 Difference]: Start difference. First operand 481 states and 704 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:49,084 INFO L93 Difference]: Finished difference Result 1335 states and 1946 transitions. [2024-11-07 10:42:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:42:49,084 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 90 [2024-11-07 10:42:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:49,092 INFO L225 Difference]: With dead ends: 1335 [2024-11-07 10:42:49,092 INFO L226 Difference]: Without dead ends: 857 [2024-11-07 10:42:49,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:42:49,098 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 340 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:49,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 621 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:42:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-07 10:42:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 662. [2024-11-07 10:42:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.4213197969543148) internal successors, (840), 591 states have internal predecessors, (840), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 10:42:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 966 transitions. [2024-11-07 10:42:49,156 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 966 transitions. Word has length 90 [2024-11-07 10:42:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:49,157 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 966 transitions. [2024-11-07 10:42:49,157 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 966 transitions. [2024-11-07 10:42:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 10:42:49,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:49,160 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:49,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:42:49,160 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:49,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:49,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1540153901, now seen corresponding path program 1 times [2024-11-07 10:42:49,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:49,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742184542] [2024-11-07 10:42:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742184542] [2024-11-07 10:42:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742184542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:49,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:42:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515173802] [2024-11-07 10:42:49,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:49,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:49,632 INFO L87 Difference]: Start difference. First operand 662 states and 966 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:49,975 INFO L93 Difference]: Finished difference Result 1890 states and 2754 transitions. [2024-11-07 10:42:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:42:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-11-07 10:42:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:49,984 INFO L225 Difference]: With dead ends: 1890 [2024-11-07 10:42:49,985 INFO L226 Difference]: Without dead ends: 1231 [2024-11-07 10:42:49,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:49,987 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 430 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:49,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 517 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:42:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-07 10:42:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 857. [2024-11-07 10:42:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 766 states have (on average 1.4203655352480418) internal successors, (1088), 766 states have internal predecessors, (1088), 81 states have call successors, (81), 9 states have call predecessors, (81), 9 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-07 10:42:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1250 transitions. [2024-11-07 10:42:50,049 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1250 transitions. Word has length 91 [2024-11-07 10:42:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:50,049 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1250 transitions. [2024-11-07 10:42:50,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1250 transitions. [2024-11-07 10:42:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 10:42:50,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:50,051 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:42:50,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1109130490, now seen corresponding path program 1 times [2024-11-07 10:42:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194046769] [2024-11-07 10:42:50,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:50,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:50,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:50,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194046769] [2024-11-07 10:42:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194046769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:50,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:50,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:42:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055137587] [2024-11-07 10:42:50,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:50,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:42:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:50,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:42:50,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:42:50,147 INFO L87 Difference]: Start difference. First operand 857 states and 1250 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:50,257 INFO L93 Difference]: Finished difference Result 1494 states and 2177 transitions. [2024-11-07 10:42:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:42:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-07 10:42:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:50,265 INFO L225 Difference]: With dead ends: 1494 [2024-11-07 10:42:50,265 INFO L226 Difference]: Without dead ends: 640 [2024-11-07 10:42:50,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:42:50,270 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:50,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:42:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-07 10:42:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 627. [2024-11-07 10:42:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 556 states have (on average 1.3992805755395683) internal successors, (778), 556 states have internal predecessors, (778), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 10:42:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 904 transitions. [2024-11-07 10:42:50,326 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 904 transitions. Word has length 92 [2024-11-07 10:42:50,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:50,326 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 904 transitions. [2024-11-07 10:42:50,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:50,326 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 904 transitions. [2024-11-07 10:42:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 10:42:50,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:50,329 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:42:50,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:50,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1007745668, now seen corresponding path program 1 times [2024-11-07 10:42:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842704250] [2024-11-07 10:42:50,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:42:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842704250] [2024-11-07 10:42:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842704250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:42:51,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45215775] [2024-11-07 10:42:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:42:51,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:42:51,197 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:42:51,199 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:42:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:51,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 10:42:51,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:42:51,475 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 55 treesize of output 54 [2024-11-07 10:42:51,769 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 116 treesize of output 94 [2024-11-07 10:42:51,994 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 13 treesize of output 11 [2024-11-07 10:42:52,040 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 23 treesize of output 24 [2024-11-07 10:42:52,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:52,152 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 40 treesize of output 27 [2024-11-07 10:42:52,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:42:52,175 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 40 treesize of output 27 [2024-11-07 10:42:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:42:52,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:42:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:52,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45215775] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:42:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:42:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 9] total 20 [2024-11-07 10:42:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582051800] [2024-11-07 10:42:52,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:52,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:42:52,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:42:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-11-07 10:42:52,798 INFO L87 Difference]: Start difference. First operand 627 states and 904 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:53,245 INFO L93 Difference]: Finished difference Result 1203 states and 1739 transitions. [2024-11-07 10:42:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:42:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-07 10:42:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:53,250 INFO L225 Difference]: With dead ends: 1203 [2024-11-07 10:42:53,250 INFO L226 Difference]: Without dead ends: 730 [2024-11-07 10:42:53,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:42:53,252 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 120 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:53,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 637 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:42:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-11-07 10:42:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2024-11-07 10:42:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 643 states have (on average 1.3996889580093312) internal successors, (900), 643 states have internal predecessors, (900), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 10:42:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1044 transitions. [2024-11-07 10:42:53,303 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1044 transitions. Word has length 95 [2024-11-07 10:42:53,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:53,304 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1044 transitions. [2024-11-07 10:42:53,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1044 transitions. [2024-11-07 10:42:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 10:42:53,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:53,305 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,325 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:42:53,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:42:53,508 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:53,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash -86241146, now seen corresponding path program 1 times [2024-11-07 10:42:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955034073] [2024-11-07 10:42:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955034073] [2024-11-07 10:42:54,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955034073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:54,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:54,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:42:54,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621495679] [2024-11-07 10:42:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:54,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:42:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:42:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:54,261 INFO L87 Difference]: Start difference. First operand 724 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:54,838 INFO L93 Difference]: Finished difference Result 1363 states and 1958 transitions. [2024-11-07 10:42:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:42:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-11-07 10:42:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:54,843 INFO L225 Difference]: With dead ends: 1363 [2024-11-07 10:42:54,843 INFO L226 Difference]: Without dead ends: 688 [2024-11-07 10:42:54,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:42:54,845 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 599 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:54,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 560 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:42:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-07 10:42:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 525. [2024-11-07 10:42:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 464 states have (on average 1.3922413793103448) internal successors, (646), 464 states have internal predecessors, (646), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:42:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 754 transitions. [2024-11-07 10:42:54,885 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 754 transitions. Word has length 96 [2024-11-07 10:42:54,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:54,885 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 754 transitions. [2024-11-07 10:42:54,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 754 transitions. [2024-11-07 10:42:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:42:54,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:54,887 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:54,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:42:54,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:54,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1520928257, now seen corresponding path program 1 times [2024-11-07 10:42:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:54,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327517808] [2024-11-07 10:42:54,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:55,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327517808] [2024-11-07 10:42:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327517808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:42:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761661943] [2024-11-07 10:42:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:55,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:42:55,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:42:55,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:42:55,817 INFO L87 Difference]: Start difference. First operand 525 states and 754 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:56,387 INFO L93 Difference]: Finished difference Result 1068 states and 1529 transitions. [2024-11-07 10:42:56,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:42:56,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-07 10:42:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:56,391 INFO L225 Difference]: With dead ends: 1068 [2024-11-07 10:42:56,392 INFO L226 Difference]: Without dead ends: 687 [2024-11-07 10:42:56,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:42:56,394 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 367 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:56,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 829 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:42:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-07 10:42:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 552. [2024-11-07 10:42:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 491 states have (on average 1.3890020366598779) internal successors, (682), 491 states have internal predecessors, (682), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:42:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 790 transitions. [2024-11-07 10:42:56,431 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 790 transitions. Word has length 97 [2024-11-07 10:42:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 790 transitions. [2024-11-07 10:42:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:56,433 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 790 transitions. [2024-11-07 10:42:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:42:56,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:56,436 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:56,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:42:56,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:56,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash -628268982, now seen corresponding path program 1 times [2024-11-07 10:42:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170862309] [2024-11-07 10:42:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:56,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:57,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:57,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170862309] [2024-11-07 10:42:57,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170862309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:57,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:57,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:42:57,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112042124] [2024-11-07 10:42:57,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:57,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:42:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:57,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:42:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:42:57,266 INFO L87 Difference]: Start difference. First operand 552 states and 790 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:57,879 INFO L93 Difference]: Finished difference Result 1072 states and 1531 transitions. [2024-11-07 10:42:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:42:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-07 10:42:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:57,884 INFO L225 Difference]: With dead ends: 1072 [2024-11-07 10:42:57,884 INFO L226 Difference]: Without dead ends: 683 [2024-11-07 10:42:57,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:42:57,886 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 411 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:57,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 833 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:42:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-11-07 10:42:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 544. [2024-11-07 10:42:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 483 states have (on average 1.3830227743271222) internal successors, (668), 483 states have internal predecessors, (668), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:42:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 776 transitions. [2024-11-07 10:42:57,923 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 776 transitions. Word has length 97 [2024-11-07 10:42:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:57,923 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 776 transitions. [2024-11-07 10:42:57,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 776 transitions. [2024-11-07 10:42:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:42:57,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:57,926 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:42:57,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1378931136, now seen corresponding path program 1 times [2024-11-07 10:42:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839838547] [2024-11-07 10:42:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:42:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:42:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:42:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:42:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:42:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:42:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:42:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:42:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:42:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:42:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:42:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:42:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839838547] [2024-11-07 10:42:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839838547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:42:58,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:42:58,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:42:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437153048] [2024-11-07 10:42:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:42:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:42:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:42:58,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:42:58,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:42:58,266 INFO L87 Difference]: Start difference. First operand 544 states and 776 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:42:58,863 INFO L93 Difference]: Finished difference Result 1395 states and 1990 transitions. [2024-11-07 10:42:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:42:58,864 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 97 [2024-11-07 10:42:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:42:58,869 INFO L225 Difference]: With dead ends: 1395 [2024-11-07 10:42:58,869 INFO L226 Difference]: Without dead ends: 900 [2024-11-07 10:42:58,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:42:58,872 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 231 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:42:58,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 541 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:42:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-07 10:42:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 559. [2024-11-07 10:42:58,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 498 states have (on average 1.3775100401606426) internal successors, (686), 498 states have internal predecessors, (686), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:42:58,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 794 transitions. [2024-11-07 10:42:58,906 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 794 transitions. Word has length 97 [2024-11-07 10:42:58,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:42:58,907 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 794 transitions. [2024-11-07 10:42:58,907 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:42:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 794 transitions. [2024-11-07 10:42:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:42:58,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:42:58,908 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:42:58,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:42:58,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:42:58,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1316891522, now seen corresponding path program 1 times [2024-11-07 10:42:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:42:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141564161] [2024-11-07 10:42:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:42:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:42:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141564161] [2024-11-07 10:43:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141564161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:00,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 10:43:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318113050] [2024-11-07 10:43:00,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 10:43:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 10:43:00,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:43:00,180 INFO L87 Difference]: Start difference. First operand 559 states and 794 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:02,359 INFO L93 Difference]: Finished difference Result 1382 states and 1966 transitions. [2024-11-07 10:43:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 10:43:02,360 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-07 10:43:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:02,368 INFO L225 Difference]: With dead ends: 1382 [2024-11-07 10:43:02,368 INFO L226 Difference]: Without dead ends: 1190 [2024-11-07 10:43:02,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:43:02,371 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 974 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:02,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 999 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 10:43:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-07 10:43:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 662. [2024-11-07 10:43:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.3824027072758038) internal successors, (817), 591 states have internal predecessors, (817), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 10:43:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 943 transitions. [2024-11-07 10:43:02,417 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 943 transitions. Word has length 97 [2024-11-07 10:43:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:02,417 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 943 transitions. [2024-11-07 10:43:02,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 943 transitions. [2024-11-07 10:43:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:43:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:02,419 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:43:02,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:02,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -730085508, now seen corresponding path program 1 times [2024-11-07 10:43:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114309266] [2024-11-07 10:43:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114309266] [2024-11-07 10:43:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114309266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:43:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655191885] [2024-11-07 10:43:02,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:02,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:43:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:43:02,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:43:02,972 INFO L87 Difference]: Start difference. First operand 662 states and 943 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:03,230 INFO L93 Difference]: Finished difference Result 1139 states and 1629 transitions. [2024-11-07 10:43:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:43:03,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-07 10:43:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:03,235 INFO L225 Difference]: With dead ends: 1139 [2024-11-07 10:43:03,235 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 10:43:03,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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:43:03,237 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:03,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 441 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:43:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 10:43:03,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 662. [2024-11-07 10:43:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 591 states have (on average 1.3756345177664975) internal successors, (813), 591 states have internal predecessors, (813), 63 states have call successors, (63), 7 states have call predecessors, (63), 7 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-07 10:43:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 939 transitions. [2024-11-07 10:43:03,277 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 939 transitions. Word has length 97 [2024-11-07 10:43:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:03,277 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 939 transitions. [2024-11-07 10:43:03,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 939 transitions. [2024-11-07 10:43:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 10:43:03,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:03,279 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:03,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:43:03,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:03,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash -511230790, now seen corresponding path program 1 times [2024-11-07 10:43:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:03,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524636063] [2024-11-07 10:43:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524636063] [2024-11-07 10:43:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524636063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:04,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:04,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:43:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083491295] [2024-11-07 10:43:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:04,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:43:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:04,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:43:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:43:04,068 INFO L87 Difference]: Start difference. First operand 662 states and 939 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:05,036 INFO L93 Difference]: Finished difference Result 1313 states and 1860 transitions. [2024-11-07 10:43:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:43:05,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-11-07 10:43:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:05,042 INFO L225 Difference]: With dead ends: 1313 [2024-11-07 10:43:05,042 INFO L226 Difference]: Without dead ends: 717 [2024-11-07 10:43:05,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:43:05,045 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 228 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:05,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 658 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 10:43:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-07 10:43:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 570. [2024-11-07 10:43:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 509 states have (on average 1.3693516699410608) internal successors, (697), 509 states have internal predecessors, (697), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 10:43:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 805 transitions. [2024-11-07 10:43:05,073 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 805 transitions. Word has length 97 [2024-11-07 10:43:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 805 transitions. [2024-11-07 10:43:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 805 transitions. [2024-11-07 10:43:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-07 10:43:05,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:05,075 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:43:05,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash -72641074, now seen corresponding path program 1 times [2024-11-07 10:43:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876258640] [2024-11-07 10:43:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876258640] [2024-11-07 10:43:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876258640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:43:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961065496] [2024-11-07 10:43:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:05,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:43:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:43:05,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:05,259 INFO L87 Difference]: Start difference. First operand 570 states and 805 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:05,280 INFO L93 Difference]: Finished difference Result 786 states and 1109 transitions. [2024-11-07 10:43:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:43:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 98 [2024-11-07 10:43:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:05,284 INFO L225 Difference]: With dead ends: 786 [2024-11-07 10:43:05,284 INFO L226 Difference]: Without dead ends: 278 [2024-11-07 10:43:05,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:05,286 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:05,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-07 10:43:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268. [2024-11-07 10:43:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 237 states have (on average 1.3291139240506329) internal successors, (315), 237 states have internal predecessors, (315), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:43:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 369 transitions. [2024-11-07 10:43:05,303 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 369 transitions. Word has length 98 [2024-11-07 10:43:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:05,303 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 369 transitions. [2024-11-07 10:43:05,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 369 transitions. [2024-11-07 10:43:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:05,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:05,306 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:43:05,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:05,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:05,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1291021946, now seen corresponding path program 1 times [2024-11-07 10:43:05,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:05,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357757369] [2024-11-07 10:43:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:43:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357757369] [2024-11-07 10:43:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357757369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:43:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133612369] [2024-11-07 10:43:05,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:05,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:43:05,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:43:05,903 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:43:05,905 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:43:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:06,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-07 10:43:06,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:06,324 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 55 treesize of output 54 [2024-11-07 10:43:06,519 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 119 treesize of output 97 [2024-11-07 10:43:06,708 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:43:07,046 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 36 treesize of output 31 [2024-11-07 10:43:07,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:07,156 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 49 treesize of output 34 [2024-11-07 10:43:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-07 10:43:07,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:07,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133612369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:07,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:43:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 25 [2024-11-07 10:43:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127878532] [2024-11-07 10:43:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:43:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:43:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:43:07,371 INFO L87 Difference]: Start difference. First operand 268 states and 369 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 10:43:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:10,982 INFO L93 Difference]: Finished difference Result 561 states and 771 transitions. [2024-11-07 10:43:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 10:43:10,983 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 99 [2024-11-07 10:43:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:10,985 INFO L225 Difference]: With dead ends: 561 [2024-11-07 10:43:10,985 INFO L226 Difference]: Without dead ends: 362 [2024-11-07 10:43:10,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=1626, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 10:43:10,988 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 433 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:10,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 634 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 10:43:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-07 10:43:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 278. [2024-11-07 10:43:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 245 states have (on average 1.3183673469387756) internal successors, (323), 245 states have internal predecessors, (323), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:43:11,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 377 transitions. [2024-11-07 10:43:11,013 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 377 transitions. Word has length 99 [2024-11-07 10:43:11,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:11,013 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 377 transitions. [2024-11-07 10:43:11,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-07 10:43:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 377 transitions. [2024-11-07 10:43:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:11,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:11,015 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:11,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 10:43:11,215 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,SelfDestructingSolverStorable14 [2024-11-07 10:43:11,216 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:11,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:11,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1509876664, now seen corresponding path program 1 times [2024-11-07 10:43:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932576261] [2024-11-07 10:43:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:43:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932576261] [2024-11-07 10:43:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932576261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:43:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581469420] [2024-11-07 10:43:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:11,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:43:11,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:43:11,931 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:43:11,933 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:43:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:12,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:43:12,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:12,240 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 31 treesize of output 15 [2024-11-07 10:43:12,263 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 31 treesize of output 15 [2024-11-07 10:43:12,285 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 31 treesize of output 15 [2024-11-07 10:43:12,308 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 31 treesize of output 15 [2024-11-07 10:43:12,343 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 31 treesize of output 15 [2024-11-07 10:43:12,352 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 27 treesize of output 15 [2024-11-07 10:43:12,370 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 21 treesize of output 9 [2024-11-07 10:43:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-07 10:43:12,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:43:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:43:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581469420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:43:12,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 10:43:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-07 10:43:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986026124] [2024-11-07 10:43:12,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 10:43:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:43:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:43:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-07 10:43:12,639 INFO L87 Difference]: Start difference. First operand 278 states and 377 transitions. Second operand has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-07 10:43:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:13,282 INFO L93 Difference]: Finished difference Result 577 states and 785 transitions. [2024-11-07 10:43:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 10:43:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) Word has length 99 [2024-11-07 10:43:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:13,284 INFO L225 Difference]: With dead ends: 577 [2024-11-07 10:43:13,284 INFO L226 Difference]: Without dead ends: 374 [2024-11-07 10:43:13,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=771, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:43:13,286 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 590 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:13,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 418 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:43:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-07 10:43:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 288. [2024-11-07 10:43:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 252 states have internal predecessors, (326), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:43:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 380 transitions. [2024-11-07 10:43:13,309 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 380 transitions. Word has length 99 [2024-11-07 10:43:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:13,309 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 380 transitions. [2024-11-07 10:43:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.0) internal successors, (126), 17 states have internal predecessors, (126), 8 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 5 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-07 10:43:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 380 transitions. [2024-11-07 10:43:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:13,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:13,310 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:13,330 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:43:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:43:13,512 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1684868203, now seen corresponding path program 1 times [2024-11-07 10:43:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082788621] [2024-11-07 10:43:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082788621] [2024-11-07 10:43:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082788621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:43:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135724652] [2024-11-07 10:43:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:43:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:14,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:43:14,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:43:14,007 INFO L87 Difference]: Start difference. First operand 288 states and 380 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:14,621 INFO L93 Difference]: Finished difference Result 621 states and 840 transitions. [2024-11-07 10:43:14,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:43:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-07 10:43:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:14,624 INFO L225 Difference]: With dead ends: 621 [2024-11-07 10:43:14,624 INFO L226 Difference]: Without dead ends: 519 [2024-11-07 10:43:14,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:43:14,625 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 517 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:14,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 610 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:43:14,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-07 10:43:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 386. [2024-11-07 10:43:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 339 states have (on average 1.3097345132743363) internal successors, (444), 339 states have internal predecessors, (444), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:43:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 516 transitions. [2024-11-07 10:43:14,658 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 516 transitions. Word has length 99 [2024-11-07 10:43:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:14,658 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 516 transitions. [2024-11-07 10:43:14,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 516 transitions. [2024-11-07 10:43:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:14,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:14,659 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:14,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:43:14,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:14,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash -405004525, now seen corresponding path program 1 times [2024-11-07 10:43:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142667910] [2024-11-07 10:43:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:15,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:15,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142667910] [2024-11-07 10:43:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142667910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:43:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007991343] [2024-11-07 10:43:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:43:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:43:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:43:15,283 INFO L87 Difference]: Start difference. First operand 386 states and 516 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:15,530 INFO L93 Difference]: Finished difference Result 766 states and 1040 transitions. [2024-11-07 10:43:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:43:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-07 10:43:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:15,533 INFO L225 Difference]: With dead ends: 766 [2024-11-07 10:43:15,533 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 10:43:15,533 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:43:15,534 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 61 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:15,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 507 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:43:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 10:43:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-07 10:43:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 363 states have (on average 1.3057851239669422) internal successors, (474), 363 states have internal predecessors, (474), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:43:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 546 transitions. [2024-11-07 10:43:15,563 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 546 transitions. Word has length 99 [2024-11-07 10:43:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:15,564 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 546 transitions. [2024-11-07 10:43:15,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 546 transitions. [2024-11-07 10:43:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:15,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:15,565 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:43:15,565 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:15,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 487654750, now seen corresponding path program 1 times [2024-11-07 10:43:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:15,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200244820] [2024-11-07 10:43:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200244820] [2024-11-07 10:43:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200244820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:16,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:43:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863648953] [2024-11-07 10:43:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:43:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:16,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:43:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:43:16,124 INFO L87 Difference]: Start difference. First operand 410 states and 546 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:16,334 INFO L93 Difference]: Finished difference Result 696 states and 939 transitions. [2024-11-07 10:43:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:43:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2024-11-07 10:43:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:16,338 INFO L225 Difference]: With dead ends: 696 [2024-11-07 10:43:16,338 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 10:43:16,339 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:43:16,339 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 124 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:16,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 435 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:43:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 10:43:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 410. [2024-11-07 10:43:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 363 states have (on average 1.300275482093664) internal successors, (472), 363 states have internal predecessors, (472), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:43:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 544 transitions. [2024-11-07 10:43:16,376 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 544 transitions. Word has length 99 [2024-11-07 10:43:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 544 transitions. [2024-11-07 10:43:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 544 transitions. [2024-11-07 10:43:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 10:43:16,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:16,378 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:43:16,378 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 745820188, now seen corresponding path program 1 times [2024-11-07 10:43:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305880716] [2024-11-07 10:43:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:43:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:43:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:43:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:43:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:43:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:43:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:43:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:43:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 10:43:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:16,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:43:16,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305880716] [2024-11-07 10:43:16,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305880716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:16,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:16,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:43:16,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479160374] [2024-11-07 10:43:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:43:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:43:16,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:43:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:43:16,505 INFO L87 Difference]: Start difference. First operand 410 states and 544 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:16,546 INFO L93 Difference]: Finished difference Result 637 states and 854 transitions. [2024-11-07 10:43:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:43:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2024-11-07 10:43:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:16,549 INFO L225 Difference]: With dead ends: 637 [2024-11-07 10:43:16,549 INFO L226 Difference]: Without dead ends: 413 [2024-11-07 10:43:16,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:43:16,552 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:16,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-07 10:43:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2024-11-07 10:43:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 360 states have (on average 1.2972222222222223) internal successors, (467), 360 states have internal predecessors, (467), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:43:16,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 539 transitions. [2024-11-07 10:43:16,580 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 539 transitions. Word has length 99 [2024-11-07 10:43:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 539 transitions. [2024-11-07 10:43:16,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 539 transitions. [2024-11-07 10:43:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 10:43:16,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:16,582 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 10:43:16,582 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -173005409, now seen corresponding path program 1 times [2024-11-07 10:43:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:43:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236050907] [2024-11-07 10:43:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:43:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:43:16,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:43:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:43:16,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:43:16,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:43:16,753 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:43:16,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 10:43:16,757 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:43:16,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:43:16,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:43:16 BoogieIcfgContainer [2024-11-07 10:43:16,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:43:16,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:43:16,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:43:16,830 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:43:16,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:43" (3/4) ... [2024-11-07 10:43:16,832 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:43:16,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:43:16,834 INFO L158 Benchmark]: Toolchain (without parser) took 34032.33ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 91.5MB in the beginning and 384.0MB in the end (delta: -292.5MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,834 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:43:16,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.33ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.12ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 72.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:43:16,835 INFO L158 Benchmark]: Boogie Preprocessor took 84.94ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,836 INFO L158 Benchmark]: RCFGBuilder took 677.31ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 84.0MB in the end (delta: -14.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,836 INFO L158 Benchmark]: TraceAbstraction took 32913.53ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 83.0MB in the beginning and 384.1MB in the end (delta: -301.1MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,836 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 578.8MB. Free memory was 384.1MB in the beginning and 384.0MB in the end (delta: 150.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:43:16,837 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.84ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.33ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.12ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 72.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.94ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 70.0MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 677.31ms. Allocated memory is still 117.4MB. Free memory was 69.9MB in the beginning and 84.0MB in the end (delta: -14.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32913.53ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 83.0MB in the beginning and 384.1MB in the end (delta: -301.1MB). Peak memory consumption was 159.1MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 578.8MB. Free memory was 384.1MB in the beginning and 384.0MB in the end (delta: 150.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of bitwiseAnd at line 67, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -5, 0, 256, 44772, 5.9, 7.6, 64.2, 128.75, 8, 3135928546 }; [L47] signed short int last_1_WrapperStruct00_var_1_1 = -5; [L48] unsigned long int last_1_WrapperStruct00_var_1_11 = 8; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L98] EXPR WrapperStruct00.var_1_1 [L98] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L99] EXPR WrapperStruct00.var_1_11 [L99] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L109] RET updateLastVariables() [L110] CALL updateVariables() [L81] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L84] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L85] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L87] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_8 [L88] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_8 [L88] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] EXPR (WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L89] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_9 [L90] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_9 [L90] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_10 [L92] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_10 [L92] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L93] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L94] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L110] RET updateVariables() [L111] CALL step() [L52] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_1; [L53] WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L53] COND TRUE WrapperStruct00.var_1_4 [L54] WrapperStruct00.var_1_5 = last_1_WrapperStruct00_var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L60] COND TRUE WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5 [L61] EXPR WrapperStruct00.var_1_5 [L61] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_5 + -16) [L67] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L67] EXPR WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L67] COND TRUE last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11) [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)) [L68] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] EXPR ((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L68] WrapperStruct00.var_1_11 = ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))) [L76] EXPR WrapperStruct00.var_1_1 [L76] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5, stepLocal_0=-5] [L76] COND TRUE WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5 [L77] EXPR WrapperStruct00.var_1_8 [L77] EXPR WrapperStruct00.var_1_9 [L77] EXPR WrapperStruct00.var_1_10 [L77] WrapperStruct00.var_1_7 = (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1) [L102] EXPR WrapperStruct00.var_1_1 [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR (WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1)) [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1) [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1) [L102] EXPR WrapperStruct00.var_1_1 [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1 [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_9 [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR (WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR (((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102] EXPR ((((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11)) ? (WrapperStruct00.var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L102-L103] return ((((WrapperStruct00.var_1_5 == WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_5 + -16))) : (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) : 1)) && (WrapperStruct00.var_1_4 ? (WrapperStruct00.var_1_5 == ((unsigned short int) last_1_WrapperStruct00_var_1_1)) : ((last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) ? (WrapperStruct00.var_1_5 == ((unsigned short int) ((((last_1_WrapperStruct00_var_1_11) > ((WrapperStruct00.var_1_6 - 8))) ? (last_1_WrapperStruct00_var_1_11) : ((WrapperStruct00.var_1_6 - 8)))))) : 1))) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_7 == ((float) (((10.25f + WrapperStruct00.var_1_8) + WrapperStruct00.var_1_9) + WrapperStruct00.var_1_10))) : 1)) && ((last_1_WrapperStruct00_var_1_11 >= (WrapperStruct00.var_1_5 & last_1_WrapperStruct00_var_1_11)) ? (WrapperStruct00.var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) < ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11))) ? (((((((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) < (WrapperStruct00.var_1_6)) ? (((((50u) < (last_1_WrapperStruct00_var_1_11)) ? (50u) : (last_1_WrapperStruct00_var_1_11)))) : (WrapperStruct00.var_1_6)))) : ((WrapperStruct00.var_1_12 - last_1_WrapperStruct00_var_1_11)))))) : ((5.7 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)) : (WrapperStruct00.var_1_11 == ((unsigned long int) last_1_WrapperStruct00_var_1_11)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=8, last_1_WrapperStruct00_var_1_1=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.8s, OverallIterations: 21, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6628 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6622 mSDsluCounter, 11336 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8615 mSDsCounter, 929 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9698 IncrementalHoareTripleChecker+Invalid, 10627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 929 mSolverCounterUnsat, 2721 mSDtfsCounter, 9698 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 925 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=857occurred in iteration=4, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 2837 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2312 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 11344 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1148 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 25 InterpolantComputations, 19 PerfectInterpolantSequences, 3516/3600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:43:16,866 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-22.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 e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:43:19,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:43:19,161 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:43:19,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:43:19,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:43:19,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:43:19,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:43:19,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:43:19,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:43:19,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:43:19,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:43:19,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:43:19,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:43:19,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:43:19,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:43:19,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:43:19,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:43:19,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:43:19,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:43:19,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:43:19,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:43:19,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:43:19,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:43:19,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:43:19,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:43:19,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:43:19,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:43:19,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:43:19,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:43:19,209 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 -> e82610752a88d395729d794c88c73268443026b48dc2e1bfb9e59d87e1051314 [2024-11-07 10:43:19,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:43:19,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:43:19,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:43:19,518 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:43:19,519 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:43:19,520 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-22.i [2024-11-07 10:43:20,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:43:21,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:43:21,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-22.i [2024-11-07 10:43:21,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e2809739/843fc33103e849e7a9d1ee458636b6b6/FLAG3b6eff352 [2024-11-07 10:43:21,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e2809739/843fc33103e849e7a9d1ee458636b6b6 [2024-11-07 10:43:21,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:43:21,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:43:21,438 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:43:21,438 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:43:21,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:43:21,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533ce757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21, skipping insertion in model container [2024-11-07 10:43:21,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:43:21,579 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-22.i[916,929] [2024-11-07 10:43:21,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:43:21,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:43:21,657 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-22.i[916,929] [2024-11-07 10:43:21,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:43:21,722 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:43:21,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21 WrapperNode [2024-11-07 10:43:21,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:43:21,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:43:21,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:43:21,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:43:21,733 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:43:21" (1/1) ... [2024-11-07 10:43:21,750 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:43:21" (1/1) ... [2024-11-07 10:43:21,800 INFO L138 Inliner]: procedures = 37, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 393 [2024-11-07 10:43:21,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:43:21,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:43:21,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:43:21,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:43:21,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,854 INFO L175 MemorySlicer]: Split 97 memory accesses to 2 slices as follows [2, 95]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2024-11-07 10:43:21,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,886 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:43:21,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:43:21,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:43:21,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:43:21,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (1/1) ... [2024-11-07 10:43:21,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:43:21,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:43:21,945 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:43:21,948 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:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:43:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:43:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:43:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:43:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:43:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:43:22,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:43:22,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:43:23,948 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-07 10:43:23,948 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:43:23,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:43:23,962 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:43:23,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:43:23 BoogieIcfgContainer [2024-11-07 10:43:23,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:43:23,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:43:23,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:43:23,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:43:23,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:43:21" (1/3) ... [2024-11-07 10:43:23,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269c0de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:43:23, skipping insertion in model container [2024-11-07 10:43:23,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:21" (2/3) ... [2024-11-07 10:43:23,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269c0de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:43:23, skipping insertion in model container [2024-11-07 10:43:23,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:43:23" (3/3) ... [2024-11-07 10:43:23,974 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-22.i [2024-11-07 10:43:23,986 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:43:23,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:43:24,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:43:24,047 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;@51a06476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:43:24,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:43:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:43:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:43:24,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:24,062 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:24,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1037497833, now seen corresponding path program 1 times [2024-11-07 10:43:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:24,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538002961] [2024-11-07 10:43:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:24,075 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:43:24,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:24,079 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:43:24,081 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:43:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:24,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:43:24,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 10:43:24,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:24,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:24,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538002961] [2024-11-07 10:43:24,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538002961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:24,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:43:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799970140] [2024-11-07 10:43:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:43:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:24,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:43:24,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:43:24,573 INFO L87 Difference]: Start difference. First operand has 99 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:24,600 INFO L93 Difference]: Finished difference Result 188 states and 286 transitions. [2024-11-07 10:43:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:43:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2024-11-07 10:43:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:24,609 INFO L225 Difference]: With dead ends: 188 [2024-11-07 10:43:24,609 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:43:24,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:43:24,615 INFO L432 NwaCegarLoop]: 129 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, 129 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:43:24,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:43:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 10:43:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:43:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-11-07 10:43:24,651 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 89 [2024-11-07 10:43:24,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:24,652 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-11-07 10:43:24,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-11-07 10:43:24,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 10:43:24,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:24,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,666 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:43:24,855 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:43:24,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:24,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:24,856 INFO L85 PathProgramCache]: Analyzing trace with hash -8583379, now seen corresponding path program 1 times [2024-11-07 10:43:24,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629082677] [2024-11-07 10:43:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:24,857 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:43:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:24,859 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:43:24,861 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:43:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:25,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:43:25,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-07 10:43:25,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:25,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629082677] [2024-11-07 10:43:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629082677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:43:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772031679] [2024-11-07 10:43:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:43:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:43:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:43:25,260 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:25,329 INFO L93 Difference]: Finished difference Result 183 states and 258 transitions. [2024-11-07 10:43:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:43:25,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2024-11-07 10:43:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:25,334 INFO L225 Difference]: With dead ends: 183 [2024-11-07 10:43:25,334 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 10:43:25,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 89 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:43:25,335 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 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:43:25,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 10:43:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 10:43:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 10:43:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2024-11-07 10:43:25,350 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 92 [2024-11-07 10:43:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:25,351 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2024-11-07 10:43:25,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 10:43:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2024-11-07 10:43:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 10:43:25,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:25,354 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:43:25,554 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:43:25,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -902069717, now seen corresponding path program 1 times [2024-11-07 10:43:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127842189] [2024-11-07 10:43:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:25,556 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:43:25,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:25,558 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:43:25,563 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:43:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:25,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 10:43:26,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:26,044 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 59 treesize of output 58 [2024-11-07 10:43:26,149 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 79 [2024-11-07 10:43:26,347 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 16 treesize of output 12 [2024-11-07 10:43:26,386 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 36 treesize of output 29 [2024-11-07 10:43:26,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:26,501 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 48 treesize of output 35 [2024-11-07 10:43:26,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:26,542 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 48 treesize of output 35 [2024-11-07 10:43:26,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:26,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 51 [2024-11-07 10:43:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:26,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:26,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127842189] [2024-11-07 10:43:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127842189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:43:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448514075] [2024-11-07 10:43:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:43:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:43:26,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:43:26,672 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:33,955 INFO L93 Difference]: Finished difference Result 552 states and 771 transitions. [2024-11-07 10:43:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 10:43:33,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 92 [2024-11-07 10:43:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:33,959 INFO L225 Difference]: With dead ends: 552 [2024-11-07 10:43:33,959 INFO L226 Difference]: Without dead ends: 461 [2024-11-07 10:43:33,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:43:33,961 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 552 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:33,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1000 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-07 10:43:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-07 10:43:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 313. [2024-11-07 10:43:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.3602941176470589) internal successors, (370), 272 states have internal predecessors, (370), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:43:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 442 transitions. [2024-11-07 10:43:33,999 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 442 transitions. Word has length 92 [2024-11-07 10:43:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:34,000 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 442 transitions. [2024-11-07 10:43:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 442 transitions. [2024-11-07 10:43:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 10:43:34,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:34,002 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,015 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:43:34,202 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:43:34,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:34,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash 278484247, now seen corresponding path program 1 times [2024-11-07 10:43:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:34,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275069318] [2024-11-07 10:43:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:34,204 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:43:34,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:34,207 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:43:34,209 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:43:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:34,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:43:34,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:34,566 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 21 treesize of output 9 [2024-11-07 10:43:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:34,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:34,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:34,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275069318] [2024-11-07 10:43:34,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275069318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:34,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:34,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:43:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050918902] [2024-11-07 10:43:34,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:34,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:43:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:43:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:34,593 INFO L87 Difference]: Start difference. First operand 313 states and 442 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:34,621 INFO L93 Difference]: Finished difference Result 493 states and 695 transitions. [2024-11-07 10:43:34,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:43:34,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-07 10:43:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:34,623 INFO L225 Difference]: With dead ends: 493 [2024-11-07 10:43:34,623 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 10:43:34,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:34,625 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:34,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 10:43:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-07 10:43:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.3367875647668395) internal successors, (258), 193 states have internal predecessors, (258), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:43:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-11-07 10:43:34,651 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 93 [2024-11-07 10:43:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:34,653 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-11-07 10:43:34,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:34,653 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-11-07 10:43:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 10:43:34,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:34,657 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:34,670 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:43:34,858 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:43:34,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:34,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:34,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1801465933, now seen corresponding path program 1 times [2024-11-07 10:43:34,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:34,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863589923] [2024-11-07 10:43:34,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:34,862 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:43:34,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:34,867 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:43:34,870 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:43:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:35,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 10:43:35,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:35,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:35,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863589923] [2024-11-07 10:43:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863589923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:43:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227629887] [2024-11-07 10:43:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:35,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:43:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:43:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:35,195 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:35,345 INFO L93 Difference]: Finished difference Result 415 states and 577 transitions. [2024-11-07 10:43:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:43:35,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 93 [2024-11-07 10:43:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:35,348 INFO L225 Difference]: With dead ends: 415 [2024-11-07 10:43:35,348 INFO L226 Difference]: Without dead ends: 237 [2024-11-07 10:43:35,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:35,349 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 17 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:35,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 239 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:43:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-07 10:43:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 152. [2024-11-07 10:43:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:43:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 209 transitions. [2024-11-07 10:43:35,359 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 209 transitions. Word has length 93 [2024-11-07 10:43:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 209 transitions. [2024-11-07 10:43:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 209 transitions. [2024-11-07 10:43:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:43:35,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:35,360 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,373 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 (6)] Forceful destruction successful, exit code 0 [2024-11-07 10:43:35,561 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:43:35,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -498818970, now seen corresponding path program 1 times [2024-11-07 10:43:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858698287] [2024-11-07 10:43:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:35,562 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:43:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:35,566 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:43:35,567 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:43:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:36,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 10:43:36,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:36,039 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 59 treesize of output 58 [2024-11-07 10:43:36,149 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 79 [2024-11-07 10:43:36,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-07 10:43:36,405 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 26 treesize of output 14 [2024-11-07 10:43:36,467 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 30 treesize of output 14 [2024-11-07 10:43:36,487 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 30 treesize of output 14 [2024-11-07 10:43:36,542 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 51 treesize of output 33 [2024-11-07 10:43:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:36,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:36,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:36,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858698287] [2024-11-07 10:43:36,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858698287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:36,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:36,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:43:36,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462655632] [2024-11-07 10:43:36,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:36,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:43:36,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:36,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:43:36,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:43:36,634 INFO L87 Difference]: Start difference. First operand 152 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:39,471 INFO L93 Difference]: Finished difference Result 324 states and 442 transitions. [2024-11-07 10:43:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:43:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-07 10:43:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:39,473 INFO L225 Difference]: With dead ends: 324 [2024-11-07 10:43:39,474 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 10:43:39,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:43:39,475 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 177 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:39,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 580 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 10:43:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 10:43:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 160. [2024-11-07 10:43:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 139 states have internal predecessors, (184), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:43:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-11-07 10:43:39,484 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 94 [2024-11-07 10:43:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:39,485 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-11-07 10:43:39,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-11-07 10:43:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 10:43:39,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:39,486 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,501 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:43:39,687 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:43:39,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:39,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:39,687 INFO L85 PathProgramCache]: Analyzing trace with hash 393840305, now seen corresponding path program 1 times [2024-11-07 10:43:39,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:39,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573510547] [2024-11-07 10:43:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:39,688 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:43:39,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:39,690 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:43:39,691 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:43:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:39,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:43:39,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:39,989 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 21 treesize of output 9 [2024-11-07 10:43:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:40,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:40,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573510547] [2024-11-07 10:43:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573510547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:40,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:43:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563149059] [2024-11-07 10:43:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:40,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:43:40,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:40,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:43:40,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:40,016 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:40,044 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2024-11-07 10:43:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:43:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-07 10:43:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:40,048 INFO L225 Difference]: With dead ends: 252 [2024-11-07 10:43:40,048 INFO L226 Difference]: Without dead ends: 154 [2024-11-07 10:43:40,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:43:40,050 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:40,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:43:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-07 10:43:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-07 10:43:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 133 states have (on average 1.300751879699248) internal successors, (173), 133 states have internal predecessors, (173), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:43:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2024-11-07 10:43:40,066 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 94 [2024-11-07 10:43:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:40,066 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2024-11-07 10:43:40,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2024-11-07 10:43:40,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 10:43:40,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:40,067 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:43:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:43:40,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1228323282, now seen corresponding path program 1 times [2024-11-07 10:43:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087126820] [2024-11-07 10:43:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:40,269 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:43:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:40,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:43:40,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:43:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:40,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:43:40,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:40,663 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 24 treesize of output 9 [2024-11-07 10:43:40,681 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:43:40,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:43:40,873 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 31 treesize of output 15 [2024-11-07 10:43:40,935 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 31 treesize of output 15 [2024-11-07 10:43:41,008 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 31 treesize of output 15 [2024-11-07 10:43:41,067 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 31 treesize of output 15 [2024-11-07 10:43:41,176 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 22 treesize of output 10 [2024-11-07 10:43:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 18 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-07 10:43:41,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:43:41,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2024-11-07 10:43:41,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087126820] [2024-11-07 10:43:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087126820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:43:41,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1003632795] [2024-11-07 10:43:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:41,606 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:43:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:43:41,608 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:43:41,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 10:43:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:42,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:43:42,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:42,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2024-11-07 10:43:42,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:42,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-11-07 10:43:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:43:43,353 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 33 treesize of output 17 [2024-11-07 10:43:43,552 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 33 treesize of output 17 [2024-11-07 10:43:43,719 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 33 treesize of output 17 [2024-11-07 10:43:43,904 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 33 treesize of output 17 [2024-11-07 10:43:44,110 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 26 treesize of output 14 [2024-11-07 10:43:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 62 proven. 18 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-07 10:43:44,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:43:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1003632795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:43:44,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:43:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2024-11-07 10:43:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926612355] [2024-11-07 10:43:44,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:43:44,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 10:43:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 10:43:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-07 10:43:44,329 INFO L87 Difference]: Start difference. First operand 154 states and 209 transitions. Second operand has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-07 10:43:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:50,391 INFO L93 Difference]: Finished difference Result 298 states and 397 transitions. [2024-11-07 10:43:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 10:43:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 95 [2024-11-07 10:43:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:50,393 INFO L225 Difference]: With dead ends: 298 [2024-11-07 10:43:50,393 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 10:43:50,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 324 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 10:43:50,394 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 163 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:50,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 599 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-07 10:43:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 10:43:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2024-11-07 10:43:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:43:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 217 transitions. [2024-11-07 10:43:50,407 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 217 transitions. Word has length 95 [2024-11-07 10:43:50,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:43:50,407 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 217 transitions. [2024-11-07 10:43:50,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.714285714285714) internal successors, (94), 14 states have internal predecessors, (94), 6 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-07 10:43:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 217 transitions. [2024-11-07 10:43:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 10:43:50,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:43:50,409 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:50,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:43:50,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-07 10:43:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:43:50,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:43:50,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:43:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1362336788, now seen corresponding path program 1 times [2024-11-07 10:43:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:43:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760650756] [2024-11-07 10:43:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:43:50,811 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:43:50,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:43:50,813 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:43:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:43:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:43:51,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 10:43:51,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:43:51,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:43:51,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-11-07 10:43:51,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:51,416 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 39 treesize of output 26 [2024-11-07 10:43:51,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:51,432 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 39 treesize of output 26 [2024-11-07 10:43:51,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:43:51,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 42 [2024-11-07 10:43:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-07 10:43:51,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:43:51,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:43:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760650756] [2024-11-07 10:43:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760650756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:43:51,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:43:51,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:43:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536157583] [2024-11-07 10:43:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:43:51,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:43:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:43:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:43:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:43:51,475 INFO L87 Difference]: Start difference. First operand 164 states and 217 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-07 10:43:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:43:52,661 INFO L93 Difference]: Finished difference Result 253 states and 338 transitions. [2024-11-07 10:43:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:43:52,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 95 [2024-11-07 10:43:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:43:52,663 INFO L225 Difference]: With dead ends: 253 [2024-11-07 10:43:52,663 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 10:43:52,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 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:43:52,664 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 98 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:43:52,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 430 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:43:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states.