./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --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/bitvector/soft_float_1-2a.c.cil.c', '-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', 'c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91'] 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/bitvector/soft_float_1-2a.c.cil.c -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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:49:55,903 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:49:55,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:49:55,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:49:55,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:49:56,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:49:56,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:49:56,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:49:56,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:49:56,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:49:56,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:49:56,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:49:56,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:49:56,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:49:56,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:49:56,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:49:56,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:49:56,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:49:56,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:49:56,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:49:56,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:49:56,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:49:56,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:49:56,010 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-06 18:49:56,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:49:56,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:49:56,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:49:56,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:49:56,251 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:49:56,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-06 18:49:57,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:49:57,581 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:49:57,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-06 18:49:57,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07c29e0bd/4ddc80cf29b346bab65538edf21af909/FLAGccf8e99c0 [2024-11-06 18:49:57,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07c29e0bd/4ddc80cf29b346bab65538edf21af909 [2024-11-06 18:49:57,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:49:57,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:49:57,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:49:57,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:49:57,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:49:57,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:49:57" (1/1) ... [2024-11-06 18:49:57,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af67b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:57, skipping insertion in model container [2024-11-06 18:49:57,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:49:57" (1/1) ... [2024-11-06 18:49:57,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:49:58,055 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-06 18:49:58,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:49:58,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:49:58,103 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-06 18:49:58,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:49:58,134 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:49:58,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58 WrapperNode [2024-11-06 18:49:58,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:49:58,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:49:58,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:49:58,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:49:58,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,174 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-11-06 18:49:58,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:49:58,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:49:58,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:49:58,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:49:58,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 18:49:58,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:49:58,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:49:58,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:49:58,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:49:58,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (1/1) ... [2024-11-06 18:49:58,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:49:58,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:49:58,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 18:49:58,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 18:49:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:49:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:49:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:49:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:49:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:49:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:49:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:49:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:49:58,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:49:58,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:49:58,623 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-06 18:49:58,624 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:49:58,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:49:58,635 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:49:58,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:49:58 BoogieIcfgContainer [2024-11-06 18:49:58,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:49:58,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:49:58,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:49:58,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:49:58,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:49:57" (1/3) ... [2024-11-06 18:49:58,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d745ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:49:58, skipping insertion in model container [2024-11-06 18:49:58,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:49:58" (2/3) ... [2024-11-06 18:49:58,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d745ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:49:58, skipping insertion in model container [2024-11-06 18:49:58,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:49:58" (3/3) ... [2024-11-06 18:49:58,644 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-06 18:49:58,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:49:58,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:49:58,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:49:58,695 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;@126dbcfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:49:58,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:49:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 87 states have internal predecessors, (133), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:49:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:49:58,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:58,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:49:58,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:58,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 881257019, now seen corresponding path program 1 times [2024-11-06 18:49:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157778529] [2024-11-06 18:49:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:49:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157778529] [2024-11-06 18:49:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157778529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:49:59,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:49:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115352953] [2024-11-06 18:49:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:49:59,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:49:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:49:59,126 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 87 states have internal predecessors, (133), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:49:59,269 INFO L93 Difference]: Finished difference Result 225 states and 365 transitions. [2024-11-06 18:49:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:49:59,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:49:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:49:59,279 INFO L225 Difference]: With dead ends: 225 [2024-11-06 18:49:59,280 INFO L226 Difference]: Without dead ends: 126 [2024-11-06 18:49:59,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:49:59,286 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:49:59,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 748 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:49:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-06 18:49:59,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-06 18:49:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 113 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-06 18:49:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-06 18:49:59,322 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 36 [2024-11-06 18:49:59,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:49:59,322 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-06 18:49:59,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-06 18:49:59,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 18:49:59,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:59,324 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:49:59,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:49:59,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 361185340, now seen corresponding path program 1 times [2024-11-06 18:49:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881976183] [2024-11-06 18:49:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:49:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881976183] [2024-11-06 18:49:59,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881976183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:49:59,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:49:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106957476] [2024-11-06 18:49:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:49:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:49:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,387 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:49:59,404 INFO L93 Difference]: Finished difference Result 212 states and 316 transitions. [2024-11-06 18:49:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:49:59,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-06 18:49:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:49:59,406 INFO L225 Difference]: With dead ends: 212 [2024-11-06 18:49:59,406 INFO L226 Difference]: Without dead ends: 170 [2024-11-06 18:49:59,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,406 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 41 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:49:59,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:49:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-06 18:49:59,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-06 18:49:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.4350649350649352) internal successors, (221), 157 states have internal predecessors, (221), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-06 18:49:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 247 transitions. [2024-11-06 18:49:59,421 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 247 transitions. Word has length 37 [2024-11-06 18:49:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:49:59,421 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 247 transitions. [2024-11-06 18:49:59,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2024-11-06 18:49:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 18:49:59,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:59,426 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:49:59,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:49:59,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:59,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 501597929, now seen corresponding path program 1 times [2024-11-06 18:49:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:59,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487746447] [2024-11-06 18:49:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:49:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487746447] [2024-11-06 18:49:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487746447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:49:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:49:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081768662] [2024-11-06 18:49:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:49:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:49:59,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,472 INFO L87 Difference]: Start difference. First operand 170 states and 247 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:49:59,490 INFO L93 Difference]: Finished difference Result 308 states and 449 transitions. [2024-11-06 18:49:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:49:59,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-06 18:49:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:49:59,493 INFO L225 Difference]: With dead ends: 308 [2024-11-06 18:49:59,494 INFO L226 Difference]: Without dead ends: 250 [2024-11-06 18:49:59,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,495 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:49:59,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 265 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:49:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-06 18:49:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2024-11-06 18:49:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 220 states have internal predecessors, (303), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-06 18:49:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2024-11-06 18:49:59,515 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 39 [2024-11-06 18:49:59,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:49:59,516 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2024-11-06 18:49:59,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,516 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2024-11-06 18:49:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:49:59,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:59,518 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:49:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:49:59,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:59,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash -361221418, now seen corresponding path program 1 times [2024-11-06 18:49:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871205] [2024-11-06 18:49:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:49:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871205] [2024-11-06 18:49:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:49:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:49:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270314858] [2024-11-06 18:49:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:49:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:49:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:49:59,602 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:49:59,635 INFO L93 Difference]: Finished difference Result 370 states and 530 transitions. [2024-11-06 18:49:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:49:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:49:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:49:59,636 INFO L225 Difference]: With dead ends: 370 [2024-11-06 18:49:59,637 INFO L226 Difference]: Without dead ends: 326 [2024-11-06 18:49:59,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-06 18:49:59,637 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 53 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:49:59,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 494 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:49:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-06 18:49:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2024-11-06 18:49:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 274 states have (on average 1.4014598540145986) internal successors, (384), 280 states have internal predecessors, (384), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-06 18:49:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 429 transitions. [2024-11-06 18:49:59,652 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 429 transitions. Word has length 40 [2024-11-06 18:49:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:49:59,652 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 429 transitions. [2024-11-06 18:49:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 429 transitions. [2024-11-06 18:49:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:49:59,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:59,654 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:49:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:49:59,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:59,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1382289772, now seen corresponding path program 1 times [2024-11-06 18:49:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611245400] [2024-11-06 18:49:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:49:59,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611245400] [2024-11-06 18:49:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611245400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:49:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:49:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320303223] [2024-11-06 18:49:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:49:59,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:49:59,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,695 INFO L87 Difference]: Start difference. First operand 300 states and 429 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:49:59,708 INFO L93 Difference]: Finished difference Result 309 states and 439 transitions. [2024-11-06 18:49:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:49:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:49:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:49:59,710 INFO L225 Difference]: With dead ends: 309 [2024-11-06 18:49:59,711 INFO L226 Difference]: Without dead ends: 302 [2024-11-06 18:49:59,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:49:59,712 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:49:59,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:49:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-06 18:49:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-06 18:49:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.3985507246376812) internal successors, (386), 282 states have internal predecessors, (386), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-06 18:49:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 431 transitions. [2024-11-06 18:49:59,729 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 431 transitions. Word has length 40 [2024-11-06 18:49:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:49:59,729 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 431 transitions. [2024-11-06 18:49:59,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:49:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 431 transitions. [2024-11-06 18:49:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:49:59,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:49:59,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-06 18:49:59,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:49:59,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:49:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:49:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -116110102, now seen corresponding path program 1 times [2024-11-06 18:49:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:49:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554452251] [2024-11-06 18:49:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:49:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:49:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:49:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:49:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:49:59,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:49:59,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554452251] [2024-11-06 18:49:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554452251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:49:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352548531] [2024-11-06 18:49:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:49:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:49:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:49:59,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:49:59,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 18:49:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:49:59,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 18:49:59,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:49:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:49:59,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:49:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352548531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:49:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:49:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-06 18:49:59,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300812157] [2024-11-06 18:49:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:49:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:49:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:49:59,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:49:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:49:59,985 INFO L87 Difference]: Start difference. First operand 302 states and 431 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:00,054 INFO L93 Difference]: Finished difference Result 525 states and 758 transitions. [2024-11-06 18:50:00,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-06 18:50:00,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:00,056 INFO L225 Difference]: With dead ends: 525 [2024-11-06 18:50:00,057 INFO L226 Difference]: Without dead ends: 444 [2024-11-06 18:50:00,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:50:00,057 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:00,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 805 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-06 18:50:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-06 18:50:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 406 states have (on average 1.4064039408866995) internal successors, (571), 414 states have internal predecessors, (571), 32 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (36), 32 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-06 18:50:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 639 transitions. [2024-11-06 18:50:00,072 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 639 transitions. Word has length 40 [2024-11-06 18:50:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:00,072 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 639 transitions. [2024-11-06 18:50:00,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 639 transitions. [2024-11-06 18:50:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 18:50:00,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:00,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:00,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 18:50:00,275 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-06 18:50:00,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash 472870362, now seen corresponding path program 1 times [2024-11-06 18:50:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806060060] [2024-11-06 18:50:00,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806060060] [2024-11-06 18:50:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806060060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659233560] [2024-11-06 18:50:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:00,345 INFO L87 Difference]: Start difference. First operand 443 states and 639 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:00,366 INFO L93 Difference]: Finished difference Result 744 states and 1082 transitions. [2024-11-06 18:50:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-06 18:50:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:00,368 INFO L225 Difference]: With dead ends: 744 [2024-11-06 18:50:00,368 INFO L226 Difference]: Without dead ends: 658 [2024-11-06 18:50:00,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-06 18:50:00,369 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 54 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:00,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 512 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-06 18:50:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 563. [2024-11-06 18:50:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 522 states have (on average 1.396551724137931) internal successors, (729), 528 states have internal predecessors, (729), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-06 18:50:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 805 transitions. [2024-11-06 18:50:00,393 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 805 transitions. Word has length 41 [2024-11-06 18:50:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:00,393 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 805 transitions. [2024-11-06 18:50:00,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 805 transitions. [2024-11-06 18:50:00,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:00,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:00,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:00,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:50:00,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2023784718, now seen corresponding path program 1 times [2024-11-06 18:50:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852795766] [2024-11-06 18:50:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:00,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:00,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852795766] [2024-11-06 18:50:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852795766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:00,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:00,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:00,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272689259] [2024-11-06 18:50:00,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:00,471 INFO L87 Difference]: Start difference. First operand 563 states and 805 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:00,494 INFO L93 Difference]: Finished difference Result 576 states and 820 transitions. [2024-11-06 18:50:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:00,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-06 18:50:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:00,497 INFO L225 Difference]: With dead ends: 576 [2024-11-06 18:50:00,497 INFO L226 Difference]: Without dead ends: 569 [2024-11-06 18:50:00,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-06 18:50:00,498 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:00,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-06 18:50:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-06 18:50:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 525 states have (on average 1.3942857142857144) internal successors, (732), 531 states have internal predecessors, (732), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-06 18:50:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 808 transitions. [2024-11-06 18:50:00,519 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 808 transitions. Word has length 42 [2024-11-06 18:50:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:00,520 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 808 transitions. [2024-11-06 18:50:00,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 808 transitions. [2024-11-06 18:50:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:00,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:00,522 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:50:00,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:00,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -496175216, now seen corresponding path program 1 times [2024-11-06 18:50:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427957733] [2024-11-06 18:50:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:00,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:00,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:00,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427957733] [2024-11-06 18:50:00,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427957733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786141776] [2024-11-06 18:50:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:00,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:00,571 INFO L87 Difference]: Start difference. First operand 566 states and 808 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:00,603 INFO L93 Difference]: Finished difference Result 573 states and 814 transitions. [2024-11-06 18:50:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:00,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-06 18:50:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:00,606 INFO L225 Difference]: With dead ends: 573 [2024-11-06 18:50:00,606 INFO L226 Difference]: Without dead ends: 566 [2024-11-06 18:50:00,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:00,606 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 3 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:00,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 527 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-06 18:50:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 560. [2024-11-06 18:50:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 519 states have (on average 1.3911368015414258) internal successors, (722), 525 states have internal predecessors, (722), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-06 18:50:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 798 transitions. [2024-11-06 18:50:00,625 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 798 transitions. Word has length 42 [2024-11-06 18:50:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:00,625 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 798 transitions. [2024-11-06 18:50:00,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 798 transitions. [2024-11-06 18:50:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:50:00,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:00,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:50:00,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:00,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1034121732, now seen corresponding path program 1 times [2024-11-06 18:50:00,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:00,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637786685] [2024-11-06 18:50:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:00,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637786685] [2024-11-06 18:50:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637786685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304354091] [2024-11-06 18:50:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:00,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:00,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:00,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 18:50:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:00,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:00,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:00,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304354091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:00,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:00,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-06 18:50:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577622547] [2024-11-06 18:50:00,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:50:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:00,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:50:00,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:00,993 INFO L87 Difference]: Start difference. First operand 560 states and 798 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 18:50:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:01,085 INFO L93 Difference]: Finished difference Result 957 states and 1362 transitions. [2024-11-06 18:50:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 42 [2024-11-06 18:50:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:01,087 INFO L225 Difference]: With dead ends: 957 [2024-11-06 18:50:01,088 INFO L226 Difference]: Without dead ends: 611 [2024-11-06 18:50:01,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:01,089 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 14 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:01,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1142 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:01,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-06 18:50:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2024-11-06 18:50:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 545 states have (on average 1.3761467889908257) internal successors, (750), 545 states have internal predecessors, (750), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-06 18:50:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 838 transitions. [2024-11-06 18:50:01,108 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 838 transitions. Word has length 42 [2024-11-06 18:50:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:01,109 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 838 transitions. [2024-11-06 18:50:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 18:50:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 838 transitions. [2024-11-06 18:50:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:01,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:01,111 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:01,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:01,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:01,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 373273288, now seen corresponding path program 1 times [2024-11-06 18:50:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499075861] [2024-11-06 18:50:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:01,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:01,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499075861] [2024-11-06 18:50:01,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499075861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:01,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310445051] [2024-11-06 18:50:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:01,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:01,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 18:50:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:01,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:01,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:01,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310445051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:01,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-06 18:50:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622380591] [2024-11-06 18:50:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:01,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:01,618 INFO L87 Difference]: Start difference. First operand 589 states and 838 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:01,737 INFO L93 Difference]: Finished difference Result 777 states and 1108 transitions. [2024-11-06 18:50:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:01,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:01,740 INFO L225 Difference]: With dead ends: 777 [2024-11-06 18:50:01,740 INFO L226 Difference]: Without dead ends: 629 [2024-11-06 18:50:01,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:01,740 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 81 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:01,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 990 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-06 18:50:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 619. [2024-11-06 18:50:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 575 states have (on average 1.3652173913043477) internal successors, (785), 575 states have internal predecessors, (785), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-06 18:50:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 873 transitions. [2024-11-06 18:50:01,753 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 873 transitions. Word has length 44 [2024-11-06 18:50:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 873 transitions. [2024-11-06 18:50:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 873 transitions. [2024-11-06 18:50:01,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:01,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:01,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:01,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 18:50:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:01,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 766300298, now seen corresponding path program 1 times [2024-11-06 18:50:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379335239] [2024-11-06 18:50:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:02,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379335239] [2024-11-06 18:50:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379335239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542117277] [2024-11-06 18:50:02,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:02,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:02,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:02,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 18:50:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-06 18:50:02,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:02,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:02,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542117277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:02,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:02,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-06 18:50:02,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692422751] [2024-11-06 18:50:02,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:02,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:02,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:02,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:02,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:02,288 INFO L87 Difference]: Start difference. First operand 619 states and 873 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:02,419 INFO L93 Difference]: Finished difference Result 1247 states and 1762 transitions. [2024-11-06 18:50:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:02,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-06 18:50:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:02,422 INFO L225 Difference]: With dead ends: 1247 [2024-11-06 18:50:02,422 INFO L226 Difference]: Without dead ends: 761 [2024-11-06 18:50:02,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:02,423 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 29 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:02,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1287 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-06 18:50:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 753. [2024-11-06 18:50:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 704 states have (on average 1.3409090909090908) internal successors, (944), 703 states have internal predecessors, (944), 44 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (56), 53 states have call predecessors, (56), 42 states have call successors, (56) [2024-11-06 18:50:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1044 transitions. [2024-11-06 18:50:02,437 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1044 transitions. Word has length 44 [2024-11-06 18:50:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1044 transitions. [2024-11-06 18:50:02,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1044 transitions. [2024-11-06 18:50:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 18:50:02,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:02,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:02,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 18:50:02,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-06 18:50:02,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:02,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:02,643 INFO L85 PathProgramCache]: Analyzing trace with hash 699252211, now seen corresponding path program 1 times [2024-11-06 18:50:02,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:02,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492762132] [2024-11-06 18:50:02,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:02,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:02,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492762132] [2024-11-06 18:50:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492762132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974224811] [2024-11-06 18:50:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:02,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:02,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:02,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:02,682 INFO L87 Difference]: Start difference. First operand 753 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:02,700 INFO L93 Difference]: Finished difference Result 798 states and 1103 transitions. [2024-11-06 18:50:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-06 18:50:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:02,703 INFO L225 Difference]: With dead ends: 798 [2024-11-06 18:50:02,703 INFO L226 Difference]: Without dead ends: 707 [2024-11-06 18:50:02,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-06 18:50:02,703 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 39 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:02,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-06 18:50:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 567. [2024-11-06 18:50:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 532 states have (on average 1.3101503759398496) internal successors, (697), 527 states have internal predecessors, (697), 30 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (42), 39 states have call predecessors, (42), 28 states have call successors, (42) [2024-11-06 18:50:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 769 transitions. [2024-11-06 18:50:02,715 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 769 transitions. Word has length 47 [2024-11-06 18:50:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:02,715 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 769 transitions. [2024-11-06 18:50:02,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 769 transitions. [2024-11-06 18:50:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:02,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:02,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:02,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:50:02,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:02,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 448174805, now seen corresponding path program 1 times [2024-11-06 18:50:02,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:02,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360483049] [2024-11-06 18:50:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360483049] [2024-11-06 18:50:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360483049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986394488] [2024-11-06 18:50:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:02,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 18:50:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:02,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:50:02,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:02,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:03,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986394488] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:03,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:03,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-06 18:50:03,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520110571] [2024-11-06 18:50:03,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:03,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:03,046 INFO L87 Difference]: Start difference. First operand 567 states and 769 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:03,150 INFO L93 Difference]: Finished difference Result 903 states and 1234 transitions. [2024-11-06 18:50:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:03,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:03,153 INFO L225 Difference]: With dead ends: 903 [2024-11-06 18:50:03,153 INFO L226 Difference]: Without dead ends: 863 [2024-11-06 18:50:03,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:03,153 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:03,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 562 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-06 18:50:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2024-11-06 18:50:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 690 states have (on average 1.291304347826087) internal successors, (891), 687 states have internal predecessors, (891), 42 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (54), 51 states have call predecessors, (54), 40 states have call successors, (54) [2024-11-06 18:50:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 987 transitions. [2024-11-06 18:50:03,181 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 987 transitions. Word has length 48 [2024-11-06 18:50:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 987 transitions. [2024-11-06 18:50:03,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 987 transitions. [2024-11-06 18:50:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:03,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:03,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:03,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:03,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-06 18:50:03,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:03,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:03,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1149239383, now seen corresponding path program 1 times [2024-11-06 18:50:03,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:03,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819418873] [2024-11-06 18:50:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819418873] [2024-11-06 18:50:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819418873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005700838] [2024-11-06 18:50:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:03,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:03,420 INFO L87 Difference]: Start difference. First operand 737 states and 987 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:03,434 INFO L93 Difference]: Finished difference Result 756 states and 1008 transitions. [2024-11-06 18:50:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:03,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:03,437 INFO L225 Difference]: With dead ends: 756 [2024-11-06 18:50:03,437 INFO L226 Difference]: Without dead ends: 690 [2024-11-06 18:50:03,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-06 18:50:03,438 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 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.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:03,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-06 18:50:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-06 18:50:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 643 states have (on average 1.2986003110419906) internal successors, (835), 642 states have internal predecessors, (835), 42 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (52), 49 states have call predecessors, (52), 40 states have call successors, (52) [2024-11-06 18:50:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 929 transitions. [2024-11-06 18:50:03,452 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 929 transitions. Word has length 48 [2024-11-06 18:50:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 929 transitions. [2024-11-06 18:50:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 929 transitions. [2024-11-06 18:50:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:03,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:03,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:03,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 18:50:03,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:03,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1292475715, now seen corresponding path program 1 times [2024-11-06 18:50:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855251593] [2024-11-06 18:50:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855251593] [2024-11-06 18:50:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855251593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112682296] [2024-11-06 18:50:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:03,579 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:03,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 18:50:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:03,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:50:03,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:03,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112682296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-06 18:50:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439640919] [2024-11-06 18:50:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:50:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:50:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:50:03,692 INFO L87 Difference]: Start difference. First operand 690 states and 929 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:03,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:03,865 INFO L93 Difference]: Finished difference Result 1378 states and 1866 transitions. [2024-11-06 18:50:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:03,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-06 18:50:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:03,869 INFO L225 Difference]: With dead ends: 1378 [2024-11-06 18:50:03,869 INFO L226 Difference]: Without dead ends: 1086 [2024-11-06 18:50:03,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:03,870 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 164 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:03,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1079 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:03,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-06 18:50:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 901. [2024-11-06 18:50:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 840 states have (on average 1.3142857142857143) internal successors, (1104), 835 states have internal predecessors, (1104), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (70), 67 states have call predecessors, (70), 54 states have call successors, (70) [2024-11-06 18:50:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1230 transitions. [2024-11-06 18:50:03,893 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1230 transitions. Word has length 48 [2024-11-06 18:50:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:03,893 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1230 transitions. [2024-11-06 18:50:03,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1230 transitions. [2024-11-06 18:50:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:03,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:03,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:03,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 18:50:04,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 18:50:04,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:04,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:04,096 INFO L85 PathProgramCache]: Analyzing trace with hash -489154550, now seen corresponding path program 1 times [2024-11-06 18:50:04,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:04,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906701309] [2024-11-06 18:50:04,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:04,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:50:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906701309] [2024-11-06 18:50:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906701309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:04,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458724290] [2024-11-06 18:50:04,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:04,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:04,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:04,429 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:04,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 18:50:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:04,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:50:04,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:04,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:04,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458724290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:04,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2024-11-06 18:50:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51609913] [2024-11-06 18:50:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:50:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:50:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-06 18:50:04,631 INFO L87 Difference]: Start difference. First operand 901 states and 1230 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:04,816 INFO L93 Difference]: Finished difference Result 1041 states and 1416 transitions. [2024-11-06 18:50:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:50:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:04,820 INFO L225 Difference]: With dead ends: 1041 [2024-11-06 18:50:04,820 INFO L226 Difference]: Without dead ends: 1004 [2024-11-06 18:50:04,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-06 18:50:04,822 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 137 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:04,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1137 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-06 18:50:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 933. [2024-11-06 18:50:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 868 states have (on average 1.304147465437788) internal successors, (1132), 865 states have internal predecessors, (1132), 60 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (73), 70 states have call predecessors, (73), 57 states have call successors, (73) [2024-11-06 18:50:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1265 transitions. [2024-11-06 18:50:04,847 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1265 transitions. Word has length 50 [2024-11-06 18:50:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:04,847 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1265 transitions. [2024-11-06 18:50:04,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1265 transitions. [2024-11-06 18:50:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:04,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:04,849 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:04,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 18:50:05,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:05,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1511722484, now seen corresponding path program 1 times [2024-11-06 18:50:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784459647] [2024-11-06 18:50:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:05,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784459647] [2024-11-06 18:50:05,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784459647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:05,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:05,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826691828] [2024-11-06 18:50:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:05,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:05,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:05,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:05,109 INFO L87 Difference]: Start difference. First operand 933 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:05,198 INFO L93 Difference]: Finished difference Result 1088 states and 1464 transitions. [2024-11-06 18:50:05,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:05,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:05,202 INFO L225 Difference]: With dead ends: 1088 [2024-11-06 18:50:05,202 INFO L226 Difference]: Without dead ends: 1052 [2024-11-06 18:50:05,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-06 18:50:05,203 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 47 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:05,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 561 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-06 18:50:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2024-11-06 18:50:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 934 states have (on average 1.3115631691648821) internal successors, (1225), 933 states have internal predecessors, (1225), 66 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-06 18:50:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1370 transitions. [2024-11-06 18:50:05,244 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1370 transitions. Word has length 50 [2024-11-06 18:50:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:05,244 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1370 transitions. [2024-11-06 18:50:05,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1370 transitions. [2024-11-06 18:50:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:05,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:05,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 18:50:05,247 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:05,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash -660224712, now seen corresponding path program 1 times [2024-11-06 18:50:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:05,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777154801] [2024-11-06 18:50:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:05,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:05,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:05,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777154801] [2024-11-06 18:50:05,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777154801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:05,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793665643] [2024-11-06 18:50:05,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:05,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:05,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:05,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 18:50:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:05,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-06 18:50:05,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:05,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:05,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793665643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:05,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:05,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-06 18:50:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864624006] [2024-11-06 18:50:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:05,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 18:50:05,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 18:50:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:50:05,562 INFO L87 Difference]: Start difference. First operand 1005 states and 1370 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:05,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:05,811 INFO L93 Difference]: Finished difference Result 1134 states and 1524 transitions. [2024-11-06 18:50:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:50:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-06 18:50:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:05,815 INFO L225 Difference]: With dead ends: 1134 [2024-11-06 18:50:05,815 INFO L226 Difference]: Without dead ends: 1132 [2024-11-06 18:50:05,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:05,816 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 176 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:05,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1633 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-06 18:50:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1009. [2024-11-06 18:50:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 937 states have (on average 1.310565635005336) internal successors, (1228), 936 states have internal predecessors, (1228), 66 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-06 18:50:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1373 transitions. [2024-11-06 18:50:05,838 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1373 transitions. Word has length 50 [2024-11-06 18:50:05,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:05,838 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1373 transitions. [2024-11-06 18:50:05,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1373 transitions. [2024-11-06 18:50:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-06 18:50:05,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:05,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:05,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 18:50:06,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:06,045 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1817684770, now seen corresponding path program 1 times [2024-11-06 18:50:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:06,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868092555] [2024-11-06 18:50:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 18:50:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868092555] [2024-11-06 18:50:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868092555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060778735] [2024-11-06 18:50:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:06,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:06,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:06,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 18:50:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:06,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:06,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060778735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:06,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-06 18:50:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281144545] [2024-11-06 18:50:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:06,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:06,131 INFO L87 Difference]: Start difference. First operand 1009 states and 1373 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:06,186 INFO L93 Difference]: Finished difference Result 2012 states and 2741 transitions. [2024-11-06 18:50:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:06,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-06 18:50:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:06,191 INFO L225 Difference]: With dead ends: 2012 [2024-11-06 18:50:06,191 INFO L226 Difference]: Without dead ends: 1014 [2024-11-06 18:50:06,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:06,193 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:06,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-06 18:50:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-06 18:50:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 940 states have (on average 1.3106382978723403) internal successors, (1232), 939 states have internal predecessors, (1232), 66 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-06 18:50:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1377 transitions. [2024-11-06 18:50:06,223 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1377 transitions. Word has length 51 [2024-11-06 18:50:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1377 transitions. [2024-11-06 18:50:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1377 transitions. [2024-11-06 18:50:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:06,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:06,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:06,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-06 18:50:06,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:06,429 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:06,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1867068998, now seen corresponding path program 1 times [2024-11-06 18:50:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217849500] [2024-11-06 18:50:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217849500] [2024-11-06 18:50:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217849500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:06,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274659742] [2024-11-06 18:50:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:06,467 INFO L87 Difference]: Start difference. First operand 1012 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:06,488 INFO L93 Difference]: Finished difference Result 1021 states and 1385 transitions. [2024-11-06 18:50:06,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:06,492 INFO L225 Difference]: With dead ends: 1021 [2024-11-06 18:50:06,492 INFO L226 Difference]: Without dead ends: 975 [2024-11-06 18:50:06,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-06 18:50:06,493 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 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.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:06,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-06 18:50:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 954. [2024-11-06 18:50:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 886 states have (on average 1.3103837471783295) internal successors, (1161), 885 states have internal predecessors, (1161), 62 states have call successors, (62), 3 states have call predecessors, (62), 5 states have return successors, (73), 69 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-06 18:50:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1296 transitions. [2024-11-06 18:50:06,521 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1296 transitions. Word has length 52 [2024-11-06 18:50:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1296 transitions. [2024-11-06 18:50:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1296 transitions. [2024-11-06 18:50:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:06,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:06,522 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:06,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 18:50:06,522 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash 506633684, now seen corresponding path program 1 times [2024-11-06 18:50:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:06,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585307853] [2024-11-06 18:50:06,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:50:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:06,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585307853] [2024-11-06 18:50:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585307853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:06,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522683430] [2024-11-06 18:50:06,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:06,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:06,555 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:06,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 18:50:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:06,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:50:06,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:06,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522683430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:06,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:06,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-06 18:50:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997776084] [2024-11-06 18:50:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:06,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:06,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:06,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:06,616 INFO L87 Difference]: Start difference. First operand 954 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:06,649 INFO L93 Difference]: Finished difference Result 1905 states and 2595 transitions. [2024-11-06 18:50:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-06 18:50:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:06,653 INFO L225 Difference]: With dead ends: 1905 [2024-11-06 18:50:06,653 INFO L226 Difference]: Without dead ends: 960 [2024-11-06 18:50:06,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:06,655 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 244 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-06 18:50:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 956. [2024-11-06 18:50:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 888 states have (on average 1.3096846846846846) internal successors, (1163), 887 states have internal predecessors, (1163), 62 states have call successors, (62), 3 states have call predecessors, (62), 5 states have return successors, (73), 69 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-06 18:50:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1298 transitions. [2024-11-06 18:50:06,676 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1298 transitions. Word has length 52 [2024-11-06 18:50:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:06,676 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1298 transitions. [2024-11-06 18:50:06,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1298 transitions. [2024-11-06 18:50:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:06,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:06,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:06,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-06 18:50:06,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:06,879 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1448267630, now seen corresponding path program 1 times [2024-11-06 18:50:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:06,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716880393] [2024-11-06 18:50:06,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:06,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716880393] [2024-11-06 18:50:07,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716880393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235203814] [2024-11-06 18:50:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:07,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:07,009 INFO L87 Difference]: Start difference. First operand 956 states and 1298 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,173 INFO L93 Difference]: Finished difference Result 1307 states and 1791 transitions. [2024-11-06 18:50:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,177 INFO L225 Difference]: With dead ends: 1307 [2024-11-06 18:50:07,177 INFO L226 Difference]: Without dead ends: 1250 [2024-11-06 18:50:07,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:07,178 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 643 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-06 18:50:07,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 990. [2024-11-06 18:50:07,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 917 states have (on average 1.321701199563795) internal successors, (1212), 918 states have internal predecessors, (1212), 67 states have call successors, (67), 3 states have call predecessors, (67), 5 states have return successors, (74), 72 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-06 18:50:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1353 transitions. [2024-11-06 18:50:07,201 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1353 transitions. Word has length 52 [2024-11-06 18:50:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,201 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1353 transitions. [2024-11-06 18:50:07,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1353 transitions. [2024-11-06 18:50:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 18:50:07,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:07,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 18:50:07,203 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,203 INFO L85 PathProgramCache]: Analyzing trace with hash 74689151, now seen corresponding path program 1 times [2024-11-06 18:50:07,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574495688] [2024-11-06 18:50:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574495688] [2024-11-06 18:50:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574495688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:07,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:07,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 18:50:07,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39738503] [2024-11-06 18:50:07,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:50:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:50:07,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:50:07,467 INFO L87 Difference]: Start difference. First operand 990 states and 1353 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:07,671 INFO L93 Difference]: Finished difference Result 1082 states and 1476 transitions. [2024-11-06 18:50:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 18:50:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-06 18:50:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:07,674 INFO L225 Difference]: With dead ends: 1082 [2024-11-06 18:50:07,675 INFO L226 Difference]: Without dead ends: 1080 [2024-11-06 18:50:07,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:07,675 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 121 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:07,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1644 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-06 18:50:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 994. [2024-11-06 18:50:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 920 states have (on average 1.3206521739130435) internal successors, (1215), 921 states have internal predecessors, (1215), 67 states have call successors, (67), 4 states have call predecessors, (67), 6 states have return successors, (74), 72 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-06 18:50:07,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1356 transitions. [2024-11-06 18:50:07,698 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1356 transitions. Word has length 53 [2024-11-06 18:50:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:07,698 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1356 transitions. [2024-11-06 18:50:07,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1356 transitions. [2024-11-06 18:50:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 18:50:07,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:07,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:07,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-06 18:50:07,701 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:07,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash -714903607, now seen corresponding path program 1 times [2024-11-06 18:50:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345111646] [2024-11-06 18:50:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:07,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345111646] [2024-11-06 18:50:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345111646] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:07,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400828078] [2024-11-06 18:50:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:07,827 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:07,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 18:50:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:07,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:07,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:07,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400828078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:07,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:07,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-06 18:50:07,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473124673] [2024-11-06 18:50:07,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:07,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:50:07,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:07,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:50:07,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:07,987 INFO L87 Difference]: Start difference. First operand 994 states and 1356 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,172 INFO L93 Difference]: Finished difference Result 1436 states and 1963 transitions. [2024-11-06 18:50:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:50:08,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-06 18:50:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,176 INFO L225 Difference]: With dead ends: 1436 [2024-11-06 18:50:08,176 INFO L226 Difference]: Without dead ends: 1114 [2024-11-06 18:50:08,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:08,177 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 137 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1260 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-06 18:50:08,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 950. [2024-11-06 18:50:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 879 states have (on average 1.3060295790671217) internal successors, (1148), 880 states have internal predecessors, (1148), 64 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (71), 69 states have call predecessors, (71), 61 states have call successors, (71) [2024-11-06 18:50:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1283 transitions. [2024-11-06 18:50:08,213 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1283 transitions. Word has length 53 [2024-11-06 18:50:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:08,213 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1283 transitions. [2024-11-06 18:50:08,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:50:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1283 transitions. [2024-11-06 18:50:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 18:50:08,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:08,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:08,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-06 18:50:08,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-06 18:50:08,416 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:08,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1875153810, now seen corresponding path program 1 times [2024-11-06 18:50:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388179846] [2024-11-06 18:50:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:08,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388179846] [2024-11-06 18:50:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388179846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:08,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706746000] [2024-11-06 18:50:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:08,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:08,565 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:08,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-06 18:50:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:08,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 18:50:08,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:08,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706746000] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:08,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:08,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-06 18:50:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729015436] [2024-11-06 18:50:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:08,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:08,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:08,765 INFO L87 Difference]: Start difference. First operand 950 states and 1283 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:08,888 INFO L93 Difference]: Finished difference Result 1056 states and 1408 transitions. [2024-11-06 18:50:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:08,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-06 18:50:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:08,892 INFO L225 Difference]: With dead ends: 1056 [2024-11-06 18:50:08,892 INFO L226 Difference]: Without dead ends: 1001 [2024-11-06 18:50:08,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-06 18:50:08,892 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:08,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 500 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-06 18:50:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 928. [2024-11-06 18:50:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 857 states have (on average 1.2777129521586932) internal successors, (1095), 861 states have internal predecessors, (1095), 64 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (71), 65 states have call predecessors, (71), 61 states have call successors, (71) [2024-11-06 18:50:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1230 transitions. [2024-11-06 18:50:08,914 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1230 transitions. Word has length 54 [2024-11-06 18:50:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1230 transitions. [2024-11-06 18:50:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1230 transitions. [2024-11-06 18:50:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:08,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:08,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:08,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:09,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:09,118 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -385973222, now seen corresponding path program 1 times [2024-11-06 18:50:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703330493] [2024-11-06 18:50:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:50:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:50:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703330493] [2024-11-06 18:50:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703330493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17344194] [2024-11-06 18:50:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:09,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:09,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:09,483 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:09,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-06 18:50:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:09,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:09,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:09,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17344194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-11-06 18:50:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962582712] [2024-11-06 18:50:09,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:09,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-06 18:50:09,633 INFO L87 Difference]: Start difference. First operand 928 states and 1230 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:09,771 INFO L93 Difference]: Finished difference Result 1181 states and 1568 transitions. [2024-11-06 18:50:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:09,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-06 18:50:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:09,774 INFO L225 Difference]: With dead ends: 1181 [2024-11-06 18:50:09,774 INFO L226 Difference]: Without dead ends: 1104 [2024-11-06 18:50:09,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-06 18:50:09,775 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 60 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:09,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1054 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:09,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-06 18:50:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 839. [2024-11-06 18:50:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 774 states have (on average 1.276485788113695) internal successors, (988), 780 states have internal predecessors, (988), 58 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (63), 57 states have call predecessors, (63), 55 states have call successors, (63) [2024-11-06 18:50:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1109 transitions. [2024-11-06 18:50:09,803 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1109 transitions. Word has length 55 [2024-11-06 18:50:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:09,803 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1109 transitions. [2024-11-06 18:50:09,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1109 transitions. [2024-11-06 18:50:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:09,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:09,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:09,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:10,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:10,011 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1074781062, now seen corresponding path program 1 times [2024-11-06 18:50:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633383989] [2024-11-06 18:50:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:10,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633383989] [2024-11-06 18:50:10,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633383989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:10,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:10,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22334473] [2024-11-06 18:50:10,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:10,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:10,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:10,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:10,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:10,149 INFO L87 Difference]: Start difference. First operand 839 states and 1109 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:10,210 INFO L93 Difference]: Finished difference Result 845 states and 1114 transitions. [2024-11-06 18:50:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:10,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-06 18:50:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:10,213 INFO L225 Difference]: With dead ends: 845 [2024-11-06 18:50:10,213 INFO L226 Difference]: Without dead ends: 843 [2024-11-06 18:50:10,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:10,213 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:10,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 707 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-06 18:50:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2024-11-06 18:50:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 777 states have (on average 1.2754182754182755) internal successors, (991), 783 states have internal predecessors, (991), 58 states have call successors, (58), 5 states have call predecessors, (58), 7 states have return successors, (63), 57 states have call predecessors, (63), 55 states have call successors, (63) [2024-11-06 18:50:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1112 transitions. [2024-11-06 18:50:10,233 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1112 transitions. Word has length 55 [2024-11-06 18:50:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:10,233 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1112 transitions. [2024-11-06 18:50:10,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1112 transitions. [2024-11-06 18:50:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 18:50:10,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:10,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:10,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-06 18:50:10,234 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -130309154, now seen corresponding path program 1 times [2024-11-06 18:50:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418889506] [2024-11-06 18:50:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418889506] [2024-11-06 18:50:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418889506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26152680] [2024-11-06 18:50:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:10,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:10,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:10,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:10,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:10,284 INFO L87 Difference]: Start difference. First operand 843 states and 1112 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:10,321 INFO L93 Difference]: Finished difference Result 870 states and 1140 transitions. [2024-11-06 18:50:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:10,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-06 18:50:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:10,324 INFO L225 Difference]: With dead ends: 870 [2024-11-06 18:50:10,324 INFO L226 Difference]: Without dead ends: 868 [2024-11-06 18:50:10,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:10,324 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 19 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:10,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 728 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-06 18:50:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 849. [2024-11-06 18:50:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 781 states have (on average 1.2740076824583866) internal successors, (995), 788 states have internal predecessors, (995), 59 states have call successors, (59), 6 states have call predecessors, (59), 8 states have return successors, (64), 57 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-06 18:50:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1118 transitions. [2024-11-06 18:50:10,344 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1118 transitions. Word has length 56 [2024-11-06 18:50:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:10,344 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1118 transitions. [2024-11-06 18:50:10,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1118 transitions. [2024-11-06 18:50:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-06 18:50:10,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:10,345 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-06 18:50:10,345 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,345 INFO L85 PathProgramCache]: Analyzing trace with hash -73050852, now seen corresponding path program 1 times [2024-11-06 18:50:10,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939845959] [2024-11-06 18:50:10,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939845959] [2024-11-06 18:50:10,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939845959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:10,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780298388] [2024-11-06 18:50:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:10,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:10,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:10,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:10,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:10,401 INFO L87 Difference]: Start difference. First operand 849 states and 1118 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:10,437 INFO L93 Difference]: Finished difference Result 859 states and 1127 transitions. [2024-11-06 18:50:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-06 18:50:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:10,440 INFO L225 Difference]: With dead ends: 859 [2024-11-06 18:50:10,440 INFO L226 Difference]: Without dead ends: 857 [2024-11-06 18:50:10,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:10,440 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:10,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 641 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-06 18:50:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 853. [2024-11-06 18:50:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 784 states have (on average 1.2729591836734695) internal successors, (998), 791 states have internal predecessors, (998), 59 states have call successors, (59), 7 states have call predecessors, (59), 9 states have return successors, (64), 57 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-06 18:50:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1121 transitions. [2024-11-06 18:50:10,462 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1121 transitions. Word has length 56 [2024-11-06 18:50:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:10,462 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1121 transitions. [2024-11-06 18:50:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1121 transitions. [2024-11-06 18:50:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-06 18:50:10,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:10,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-06 18:50:10,464 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1983366207, now seen corresponding path program 1 times [2024-11-06 18:50:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047333742] [2024-11-06 18:50:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-06 18:50:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047333742] [2024-11-06 18:50:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047333742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831487959] [2024-11-06 18:50:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:10,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:50:10,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:10,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:50:10,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-06 18:50:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:10,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:50:10,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:10,733 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:10,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:50:10,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831487959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:10,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:50:10,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-11-06 18:50:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356526908] [2024-11-06 18:50:10,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:10,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 18:50:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 18:50:10,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:10,858 INFO L87 Difference]: Start difference. First operand 853 states and 1121 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-06 18:50:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,088 INFO L93 Difference]: Finished difference Result 955 states and 1245 transitions. [2024-11-06 18:50:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:50:11,088 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2024-11-06 18:50:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,091 INFO L225 Difference]: With dead ends: 955 [2024-11-06 18:50:11,091 INFO L226 Difference]: Without dead ends: 933 [2024-11-06 18:50:11,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:50:11,092 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 150 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1458 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:50:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-06 18:50:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 868. [2024-11-06 18:50:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 798 states have (on average 1.268170426065163) internal successors, (1012), 803 states have internal predecessors, (1012), 60 states have call successors, (60), 7 states have call predecessors, (60), 9 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2024-11-06 18:50:11,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1137 transitions. [2024-11-06 18:50:11,114 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1137 transitions. Word has length 62 [2024-11-06 18:50:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,114 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1137 transitions. [2024-11-06 18:50:11,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-06 18:50:11,114 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1137 transitions. [2024-11-06 18:50:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 18:50:11,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-06 18:50:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-06 18:50:11,320 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1384290479, now seen corresponding path program 1 times [2024-11-06 18:50:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787507113] [2024-11-06 18:50:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:50:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-06 18:50:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787507113] [2024-11-06 18:50:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787507113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708577415] [2024-11-06 18:50:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:11,374 INFO L87 Difference]: Start difference. First operand 868 states and 1137 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,410 INFO L93 Difference]: Finished difference Result 894 states and 1164 transitions. [2024-11-06 18:50:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-06 18:50:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,413 INFO L225 Difference]: With dead ends: 894 [2024-11-06 18:50:11,413 INFO L226 Difference]: Without dead ends: 872 [2024-11-06 18:50:11,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:11,414 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 14 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 693 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-06 18:50:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 858. [2024-11-06 18:50:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 787 states have (on average 1.255400254129606) internal successors, (988), 793 states have internal predecessors, (988), 60 states have call successors, (60), 8 states have call predecessors, (60), 10 states have return successors, (65), 57 states have call predecessors, (65), 57 states have call successors, (65) [2024-11-06 18:50:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1113 transitions. [2024-11-06 18:50:11,437 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1113 transitions. Word has length 64 [2024-11-06 18:50:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,438 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1113 transitions. [2024-11-06 18:50:11,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1113 transitions. [2024-11-06 18:50:11,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 18:50:11,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-06 18:50:11,448 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1809751259, now seen corresponding path program 1 times [2024-11-06 18:50:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197416961] [2024-11-06 18:50:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-06 18:50:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:50:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197416961] [2024-11-06 18:50:11,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197416961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917400294] [2024-11-06 18:50:11,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:11,501 INFO L87 Difference]: Start difference. First operand 858 states and 1113 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,541 INFO L93 Difference]: Finished difference Result 879 states and 1133 transitions. [2024-11-06 18:50:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-06 18:50:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,545 INFO L225 Difference]: With dead ends: 879 [2024-11-06 18:50:11,545 INFO L226 Difference]: Without dead ends: 865 [2024-11-06 18:50:11,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:11,545 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 14 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 697 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-06 18:50:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 834. [2024-11-06 18:50:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 767 states have (on average 1.2555410691003912) internal successors, (963), 771 states have internal predecessors, (963), 56 states have call successors, (56), 8 states have call predecessors, (56), 10 states have return successors, (61), 55 states have call predecessors, (61), 53 states have call successors, (61) [2024-11-06 18:50:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1080 transitions. [2024-11-06 18:50:11,571 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1080 transitions. Word has length 64 [2024-11-06 18:50:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,571 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1080 transitions. [2024-11-06 18:50:11,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1080 transitions. [2024-11-06 18:50:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-06 18:50:11,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-06 18:50:11,572 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -707480718, now seen corresponding path program 1 times [2024-11-06 18:50:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268354133] [2024-11-06 18:50:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 18:50:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268354133] [2024-11-06 18:50:11,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268354133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452532170] [2024-11-06 18:50:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:11,622 INFO L87 Difference]: Start difference. First operand 834 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,681 INFO L93 Difference]: Finished difference Result 911 states and 1192 transitions. [2024-11-06 18:50:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:11,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-06 18:50:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,684 INFO L225 Difference]: With dead ends: 911 [2024-11-06 18:50:11,684 INFO L226 Difference]: Without dead ends: 906 [2024-11-06 18:50:11,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:11,685 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 477 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-06 18:50:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 883. [2024-11-06 18:50:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 800 states have (on average 1.26875) internal successors, (1015), 819 states have internal predecessors, (1015), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-06 18:50:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1162 transitions. [2024-11-06 18:50:11,721 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1162 transitions. Word has length 64 [2024-11-06 18:50:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,721 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1162 transitions. [2024-11-06 18:50:11,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1162 transitions. [2024-11-06 18:50:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 18:50:11,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-06 18:50:11,724 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 793945063, now seen corresponding path program 1 times [2024-11-06 18:50:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418641943] [2024-11-06 18:50:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 18:50:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418641943] [2024-11-06 18:50:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418641943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:50:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429827391] [2024-11-06 18:50:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:50:11,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:50:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:11,788 INFO L87 Difference]: Start difference. First operand 883 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:11,826 INFO L93 Difference]: Finished difference Result 1134 states and 1495 transitions. [2024-11-06 18:50:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:50:11,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2024-11-06 18:50:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:11,829 INFO L225 Difference]: With dead ends: 1134 [2024-11-06 18:50:11,829 INFO L226 Difference]: Without dead ends: 899 [2024-11-06 18:50:11,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:50:11,830 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:11,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:11,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-11-06 18:50:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2024-11-06 18:50:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 816 states have (on average 1.2634803921568627) internal successors, (1031), 835 states have internal predecessors, (1031), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-06 18:50:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1178 transitions. [2024-11-06 18:50:11,862 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1178 transitions. Word has length 65 [2024-11-06 18:50:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:11,862 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1178 transitions. [2024-11-06 18:50:11,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1178 transitions. [2024-11-06 18:50:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 18:50:11,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:11,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:11,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-06 18:50:11,865 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:11,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:11,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1482946329, now seen corresponding path program 1 times [2024-11-06 18:50:11,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:11,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879690471] [2024-11-06 18:50:11,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:11,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 18:50:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-06 18:50:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:50:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-06 18:50:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:11,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:50:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879690471] [2024-11-06 18:50:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879690471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:11,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:11,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958759583] [2024-11-06 18:50:11,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:11,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:11,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:50:11,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:11,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:11,954 INFO L87 Difference]: Start difference. First operand 899 states and 1178 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:12,038 INFO L93 Difference]: Finished difference Result 960 states and 1258 transitions. [2024-11-06 18:50:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:12,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-06 18:50:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:12,044 INFO L225 Difference]: With dead ends: 960 [2024-11-06 18:50:12,044 INFO L226 Difference]: Without dead ends: 955 [2024-11-06 18:50:12,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:12,045 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:12,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 613 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:12,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-06 18:50:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 898. [2024-11-06 18:50:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 815 states have (on average 1.2625766871165645) internal successors, (1029), 834 states have internal predecessors, (1029), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-06 18:50:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1176 transitions. [2024-11-06 18:50:12,084 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1176 transitions. Word has length 66 [2024-11-06 18:50:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:12,084 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1176 transitions. [2024-11-06 18:50:12,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:50:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1176 transitions. [2024-11-06 18:50:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 18:50:12,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:12,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:12,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-06 18:50:12,087 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:12,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 179391471, now seen corresponding path program 1 times [2024-11-06 18:50:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:50:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060759088] [2024-11-06 18:50:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:12,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:50:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:12,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:50:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:50:12,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 18:50:12,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:50:12,143 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:50:12,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-06 18:50:12,146 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:12,175 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:50:12,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:50:12 BoogieIcfgContainer [2024-11-06 18:50:12,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:50:12,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:50:12,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:50:12,179 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:50:12,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:49:58" (3/4) ... [2024-11-06 18:50:12,180 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-06 18:50:12,181 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:50:12,183 INFO L158 Benchmark]: Toolchain (without parser) took 14242.47ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 76.6MB in the beginning and 154.8MB in the end (delta: -78.2MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.09ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.96ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 60.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: Boogie Preprocessor took 32.24ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 58.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: RCFGBuilder took 420.13ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 74.1MB in the end (delta: -15.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: TraceAbstraction took 13540.44ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 73.6MB in the beginning and 154.9MB in the end (delta: -81.2MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-11-06 18:50:12,184 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 276.8MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 56.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:50:12,185 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.31ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.09ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 62.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.96ms. Allocated memory is still 100.7MB. Free memory was 62.3MB in the beginning and 60.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.24ms. Allocated memory is still 100.7MB. Free memory was 60.6MB in the beginning and 58.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.13ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 74.1MB in the end (delta: -15.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13540.44ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 73.6MB in the beginning and 154.9MB in the end (delta: -81.2MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 276.8MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 56.3kB). 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: 18]: 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 bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=-4261412865, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4261412865] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=127, ma=-4261412865, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4261412865] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8539602945] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8539602945] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1814 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1720 mSDsluCounter, 25730 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20591 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3772 IncrementalHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 5139 mSDtfsCounter, 3772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1503 GetRequests, 1227 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=20, InterpolantAutomatonStates: 232, 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, 36 MinimizatonAttempts, 1967 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2561 NumberOfCodeBlocks, 2561 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2742 ConstructedInterpolants, 0 QuantifiedInterpolants, 5617 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2090 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 56 InterpolantComputations, 32 PerfectInterpolantSequences, 854/941 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-06 18:50:12,206 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/bitvector/soft_float_1-2a.c.cil.c -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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:50:13,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:50:14,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 18:50:14,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:50:14,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:50:14,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:50:14,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:50:14,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:50:14,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:50:14,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:50:14,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:50:14,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:50:14,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:50:14,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:50:14,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:50:14,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 18:50:14,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:50:14,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:14,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:50:14,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:50:14,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:50:14,053 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-06 18:50:14,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:50:14,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:50:14,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:50:14,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:50:14,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:50:14,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-06 18:50:15,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:50:15,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:50:15,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-06 18:50:15,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d2f14a13/54d2b8db759444b4aa9309d96f260906/FLAG8c7dec0bb [2024-11-06 18:50:16,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d2f14a13/54d2b8db759444b4aa9309d96f260906 [2024-11-06 18:50:16,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:50:16,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:50:16,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:16,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:50:16,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:50:16,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3c8f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16, skipping insertion in model container [2024-11-06 18:50:16,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:50:16,177 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-06 18:50:16,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:16,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:50:16,230 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-06 18:50:16,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:50:16,261 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:50:16,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16 WrapperNode [2024-11-06 18:50:16,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:50:16,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:16,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:50:16,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:50:16,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,293 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-06 18:50:16,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:50:16,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:50:16,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:50:16,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:50:16,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,321 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 18:50:16,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:50:16,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:50:16,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:50:16,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:50:16,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (1/1) ... [2024-11-06 18:50:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:50:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:50:16,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 18:50:16,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 18:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 18:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-06 18:50:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-06 18:50:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:50:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:50:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 18:50:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 18:50:16,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:50:16,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:50:16,689 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-06 18:50:16,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:50:16,696 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:50:16,696 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 18:50:16,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:16 BoogieIcfgContainer [2024-11-06 18:50:16,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:50:16,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:50:16,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:50:16,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:50:16,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:50:16" (1/3) ... [2024-11-06 18:50:16,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e770d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:16, skipping insertion in model container [2024-11-06 18:50:16,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:50:16" (2/3) ... [2024-11-06 18:50:16,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e770d90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:50:16, skipping insertion in model container [2024-11-06 18:50:16,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:50:16" (3/3) ... [2024-11-06 18:50:16,705 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-06 18:50:16,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:50:16,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:50:16,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:50:16,763 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;@576cd831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:50:16,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:50:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:50:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 18:50:16,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:16,771 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:16,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash -760882007, now seen corresponding path program 1 times [2024-11-06 18:50:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440604918] [2024-11-06 18:50:16,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:16,781 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-06 18:50:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:16,782 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-06 18:50:16,783 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-06 18:50:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:16,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:50:16,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:16,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:16,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:16,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440604918] [2024-11-06 18:50:16,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440604918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:16,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:16,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-06 18:50:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738261382] [2024-11-06 18:50:16,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:16,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:17,011 INFO L87 Difference]: Start difference. First operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,083 INFO L93 Difference]: Finished difference Result 154 states and 253 transitions. [2024-11-06 18:50:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-06 18:50:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,090 INFO L225 Difference]: With dead ends: 154 [2024-11-06 18:50:17,090 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 18:50:17,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:17,094 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 491 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 18:50:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-06 18:50:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-06 18:50:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-06 18:50:17,124 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 32 [2024-11-06 18:50:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,125 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-06 18:50:17,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-06 18:50:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:50:17,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:17,129 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-06 18:50:17,327 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-06 18:50:17,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,328 INFO L85 PathProgramCache]: Analyzing trace with hash 975798983, now seen corresponding path program 1 times [2024-11-06 18:50:17,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:17,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599340818] [2024-11-06 18:50:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,329 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-06 18:50:17,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:17,331 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-06 18:50:17,332 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-06 18:50:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:50:17,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:17,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:17,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599340818] [2024-11-06 18:50:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599340818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:17,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:17,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472334195] [2024-11-06 18:50:17,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:17,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:17,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:17,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:17,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:17,426 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,518 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-11-06 18:50:17,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:17,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:50:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,520 INFO L225 Difference]: With dead ends: 167 [2024-11-06 18:50:17,520 INFO L226 Difference]: Without dead ends: 125 [2024-11-06 18:50:17,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:17,521 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-06 18:50:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-06 18:50:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.457142857142857) internal successors, (153), 106 states have internal predecessors, (153), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-06 18:50:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-06 18:50:17,541 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 36 [2024-11-06 18:50:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,542 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-06 18:50:17,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-06 18:50:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 18:50:17,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:17,545 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-06 18:50:17,743 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-06 18:50:17,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:17,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1655857353, now seen corresponding path program 1 times [2024-11-06 18:50:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:17,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525745868] [2024-11-06 18:50:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:17,744 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-06 18:50:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:17,746 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-06 18:50:17,748 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-06 18:50:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:17,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:50:17,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:17,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:17,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:17,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525745868] [2024-11-06 18:50:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525745868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:17,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520563868] [2024-11-06 18:50:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:17,843 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:17,927 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2024-11-06 18:50:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-06 18:50:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:17,928 INFO L225 Difference]: With dead ends: 155 [2024-11-06 18:50:17,928 INFO L226 Difference]: Without dead ends: 116 [2024-11-06 18:50:17,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:17,929 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:17,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 511 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-06 18:50:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-06 18:50:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 14 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-06 18:50:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-11-06 18:50:17,936 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 36 [2024-11-06 18:50:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:17,936 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-11-06 18:50:17,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-11-06 18:50:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:50:17,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:17,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-06 18:50:17,940 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 (4)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:18,139 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-06 18:50:18,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash -371678158, now seen corresponding path program 1 times [2024-11-06 18:50:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197155406] [2024-11-06 18:50:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:18,140 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-06 18:50:18,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:18,143 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-06 18:50:18,144 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-06 18:50:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:18,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:18,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:18,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:18,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197155406] [2024-11-06 18:50:18,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197155406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:18,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:18,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-06 18:50:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566001780] [2024-11-06 18:50:18,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:18,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:18,304 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:18,418 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2024-11-06 18:50:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:50:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-06 18:50:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:18,420 INFO L225 Difference]: With dead ends: 256 [2024-11-06 18:50:18,421 INFO L226 Difference]: Without dead ends: 181 [2024-11-06 18:50:18,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:50:18,421 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:18,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 590 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-06 18:50:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-06 18:50:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 155 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 24 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-06 18:50:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 258 transitions. [2024-11-06 18:50:18,441 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 258 transitions. Word has length 40 [2024-11-06 18:50:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:18,441 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 258 transitions. [2024-11-06 18:50:18,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 258 transitions. [2024-11-06 18:50:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:18,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:18,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:18,446 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-06 18:50:18,643 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-06 18:50:18,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2082074321, now seen corresponding path program 1 times [2024-11-06 18:50:18,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:18,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689244755] [2024-11-06 18:50:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:18,644 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-06 18:50:18,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:18,646 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-06 18:50:18,647 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-06 18:50:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:18,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:18,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:18,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:18,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689244755] [2024-11-06 18:50:18,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689244755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:18,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:18,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:18,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373447068] [2024-11-06 18:50:18,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:18,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:18,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:18,703 INFO L87 Difference]: Start difference. First operand 178 states and 258 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:18,721 INFO L93 Difference]: Finished difference Result 299 states and 437 transitions. [2024-11-06 18:50:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:18,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-06 18:50:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:18,723 INFO L225 Difference]: With dead ends: 299 [2024-11-06 18:50:18,723 INFO L226 Difference]: Without dead ends: 233 [2024-11-06 18:50:18,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-06 18:50:18,724 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 15 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:18,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 318 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-06 18:50:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-06 18:50:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 208 states have internal predecessors, (281), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-06 18:50:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-11-06 18:50:18,738 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 43 [2024-11-06 18:50:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:18,738 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-11-06 18:50:18,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-11-06 18:50:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 18:50:18,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:18,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:18,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 18:50:18,942 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-06 18:50:18,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:18,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:18,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1847325628, now seen corresponding path program 1 times [2024-11-06 18:50:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:18,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672153960] [2024-11-06 18:50:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:18,943 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-06 18:50:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:18,944 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-06 18:50:18,945 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-06 18:50:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:18,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:18,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 18:50:19,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:19,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:19,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672153960] [2024-11-06 18:50:19,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672153960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:19,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:19,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:19,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117185384] [2024-11-06 18:50:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:19,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:19,016 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:19,068 INFO L93 Difference]: Finished difference Result 408 states and 569 transitions. [2024-11-06 18:50:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-06 18:50:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:19,069 INFO L225 Difference]: With dead ends: 408 [2024-11-06 18:50:19,069 INFO L226 Difference]: Without dead ends: 178 [2024-11-06 18:50:19,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:19,070 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 26 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:19,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 258 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-06 18:50:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-06 18:50:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 148 states have (on average 1.304054054054054) internal successors, (193), 150 states have internal predecessors, (193), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-06 18:50:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2024-11-06 18:50:19,078 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 43 [2024-11-06 18:50:19,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:19,078 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2024-11-06 18:50:19,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2024-11-06 18:50:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:19,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:19,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:19,081 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-06 18:50:19,281 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-06 18:50:19,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:19,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:19,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1563397194, now seen corresponding path program 1 times [2024-11-06 18:50:19,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:19,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976718581] [2024-11-06 18:50:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:19,283 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-06 18:50:19,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:19,286 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-06 18:50:19,287 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-06 18:50:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:50:19,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:19,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:19,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976718581] [2024-11-06 18:50:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976718581] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-06 18:50:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95418620] [2024-11-06 18:50:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:19,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:19,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:19,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:19,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:19,526 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:19,663 INFO L93 Difference]: Finished difference Result 252 states and 350 transitions. [2024-11-06 18:50:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:19,665 INFO L225 Difference]: With dead ends: 252 [2024-11-06 18:50:19,665 INFO L226 Difference]: Without dead ends: 216 [2024-11-06 18:50:19,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:50:19,665 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 25 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:19,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 372 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-06 18:50:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-11-06 18:50:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 185 states have internal predecessors, (236), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-06 18:50:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2024-11-06 18:50:19,683 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 44 [2024-11-06 18:50:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2024-11-06 18:50:19,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2024-11-06 18:50:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:19,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:19,685 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:19,688 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 (8)] Ended with exit code 0 [2024-11-06 18:50:19,888 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-06 18:50:19,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:19,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:19,888 INFO L85 PathProgramCache]: Analyzing trace with hash -956562740, now seen corresponding path program 1 times [2024-11-06 18:50:19,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:19,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673393704] [2024-11-06 18:50:19,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:19,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:19,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:19,892 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-06 18:50:19,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-06 18:50:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:19,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:50:19,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:19,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:19,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:19,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673393704] [2024-11-06 18:50:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673393704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:19,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282428808] [2024-11-06 18:50:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:19,964 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:19,993 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2024-11-06 18:50:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:50:19,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:19,995 INFO L225 Difference]: With dead ends: 211 [2024-11-06 18:50:19,996 INFO L226 Difference]: Without dead ends: 204 [2024-11-06 18:50:19,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:19,997 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:19,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-06 18:50:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-06 18:50:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 185 states have internal predecessors, (233), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-06 18:50:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2024-11-06 18:50:20,007 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 44 [2024-11-06 18:50:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:20,007 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2024-11-06 18:50:20,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2024-11-06 18:50:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:20,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:20,009 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:20,011 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 (9)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:20,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:20,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:20,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -3100185, now seen corresponding path program 2 times [2024-11-06 18:50:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:20,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608002803] [2024-11-06 18:50:20,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:50:20,210 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-06 18:50:20,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:20,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:20,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-06 18:50:20,255 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 18:50:20,255 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:50:20,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:50:20,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:20,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:20,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608002803] [2024-11-06 18:50:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608002803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565335807] [2024-11-06 18:50:20,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:20,364 INFO L87 Difference]: Start difference. First operand 204 states and 272 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:20,434 INFO L93 Difference]: Finished difference Result 210 states and 277 transitions. [2024-11-06 18:50:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:20,436 INFO L225 Difference]: With dead ends: 210 [2024-11-06 18:50:20,436 INFO L226 Difference]: Without dead ends: 208 [2024-11-06 18:50:20,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:20,436 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:20,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 455 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-06 18:50:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-06 18:50:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 188 states have internal predecessors, (236), 17 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-06 18:50:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 275 transitions. [2024-11-06 18:50:20,444 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 275 transitions. Word has length 44 [2024-11-06 18:50:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:20,445 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 275 transitions. [2024-11-06 18:50:20,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 275 transitions. [2024-11-06 18:50:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 18:50:20,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:20,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:20,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-06 18:50:20,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:20,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:20,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:20,649 INFO L85 PathProgramCache]: Analyzing trace with hash 54158117, now seen corresponding path program 1 times [2024-11-06 18:50:20,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:20,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546291631] [2024-11-06 18:50:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:20,649 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-06 18:50:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:20,651 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-06 18:50:20,655 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-06 18:50:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:20,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 18:50:20,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:50:20,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:20,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546291631] [2024-11-06 18:50:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546291631] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 18:50:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:50:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-06 18:50:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537072963] [2024-11-06 18:50:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:20,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-06 18:50:20,941 INFO L87 Difference]: Start difference. First operand 208 states and 275 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:20,993 INFO L93 Difference]: Finished difference Result 214 states and 280 transitions. [2024-11-06 18:50:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-06 18:50:20,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:20,995 INFO L225 Difference]: With dead ends: 214 [2024-11-06 18:50:20,995 INFO L226 Difference]: Without dead ends: 212 [2024-11-06 18:50:20,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:50:20,996 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:20,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 450 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:20,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-06 18:50:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-06 18:50:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.2712765957446808) internal successors, (239), 191 states have internal predecessors, (239), 17 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-06 18:50:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 278 transitions. [2024-11-06 18:50:21,003 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 278 transitions. Word has length 44 [2024-11-06 18:50:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,003 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 278 transitions. [2024-11-06 18:50:21,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2024-11-06 18:50:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 18:50:21,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,004 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:21,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-06 18:50:21,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 18:50:21,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,205 INFO L85 PathProgramCache]: Analyzing trace with hash 561980754, now seen corresponding path program 1 times [2024-11-06 18:50:21,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:21,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480351211] [2024-11-06 18:50:21,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,205 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-06 18:50:21,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:21,207 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 18:50:21,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-06 18:50:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:21,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:21,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:21,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:21,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480351211] [2024-11-06 18:50:21,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480351211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861622361] [2024-11-06 18:50:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:21,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:21,257 INFO L87 Difference]: Start difference. First operand 212 states and 278 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,271 INFO L93 Difference]: Finished difference Result 345 states and 463 transitions. [2024-11-06 18:50:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:21,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-06 18:50:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,273 INFO L225 Difference]: With dead ends: 345 [2024-11-06 18:50:21,273 INFO L226 Difference]: Without dead ends: 293 [2024-11-06 18:50:21,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-06 18:50:21,279 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 28 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-06 18:50:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 231. [2024-11-06 18:50:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 208 states have internal predecessors, (263), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (23), 20 states have call predecessors, (23), 17 states have call successors, (23) [2024-11-06 18:50:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2024-11-06 18:50:21,292 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 45 [2024-11-06 18:50:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,292 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2024-11-06 18:50:21,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2024-11-06 18:50:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 18:50:21,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:21,296 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 (12)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:21,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-06 18:50:21,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2079579127, now seen corresponding path program 1 times [2024-11-06 18:50:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959985496] [2024-11-06 18:50:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,494 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-06 18:50:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:21,496 INFO L229 MonitoredProcess]: Starting monitored process 13 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-06 18:50:21,498 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 (13)] Waiting until timeout for monitored process [2024-11-06 18:50:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:21,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:21,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:21,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:21,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959985496] [2024-11-06 18:50:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959985496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744644679] [2024-11-06 18:50:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:21,544 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,557 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2024-11-06 18:50:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:21,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-06 18:50:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,559 INFO L225 Difference]: With dead ends: 246 [2024-11-06 18:50:21,559 INFO L226 Difference]: Without dead ends: 207 [2024-11-06 18:50:21,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 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-06 18:50:21,559 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 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.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-06 18:50:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-06 18:50:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.2912087912087913) internal successors, (235), 185 states have internal predecessors, (235), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-06 18:50:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 274 transitions. [2024-11-06 18:50:21,567 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 274 transitions. Word has length 48 [2024-11-06 18:50:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,567 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 274 transitions. [2024-11-06 18:50:21,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 274 transitions. [2024-11-06 18:50:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 18:50:21,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:21,571 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 (13)] Ended with exit code 0 [2024-11-06 18:50:21,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-06 18:50:21,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:21,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:21,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1609971577, now seen corresponding path program 1 times [2024-11-06 18:50:21,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138960301] [2024-11-06 18:50:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:21,771 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-06 18:50:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:21,774 INFO L229 MonitoredProcess]: Starting monitored process 14 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-06 18:50:21,775 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 (14)] Waiting until timeout for monitored process [2024-11-06 18:50:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:21,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:50:21,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:21,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:21,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:21,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138960301] [2024-11-06 18:50:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138960301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:21,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:21,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 18:50:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685266638] [2024-11-06 18:50:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:21,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:50:21,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:21,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:50:21,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:21,832 INFO L87 Difference]: Start difference. First operand 207 states and 274 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:21,908 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2024-11-06 18:50:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:21,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-06 18:50:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:21,910 INFO L225 Difference]: With dead ends: 263 [2024-11-06 18:50:21,910 INFO L226 Difference]: Without dead ends: 221 [2024-11-06 18:50:21,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:21,910 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:21,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-06 18:50:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2024-11-06 18:50:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 185 states have internal predecessors, (233), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-06 18:50:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2024-11-06 18:50:21,922 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 49 [2024-11-06 18:50:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:21,923 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2024-11-06 18:50:21,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2024-11-06 18:50:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 18:50:21,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:21,924 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:21,927 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 (14)] Ended with exit code 0 [2024-11-06 18:50:22,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-06 18:50:22,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -908906999, now seen corresponding path program 1 times [2024-11-06 18:50:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860918287] [2024-11-06 18:50:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:22,127 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-06 18:50:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:22,129 INFO L229 MonitoredProcess]: Starting monitored process 15 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-06 18:50:22,132 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 (15)] Waiting until timeout for monitored process [2024-11-06 18:50:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:50:22,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:22,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:22,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860918287] [2024-11-06 18:50:22,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860918287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:22,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:22,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297907086] [2024-11-06 18:50:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:22,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:22,188 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:22,227 INFO L93 Difference]: Finished difference Result 285 states and 374 transitions. [2024-11-06 18:50:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-06 18:50:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:22,229 INFO L225 Difference]: With dead ends: 285 [2024-11-06 18:50:22,229 INFO L226 Difference]: Without dead ends: 254 [2024-11-06 18:50:22,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:50:22,230 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:22,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-06 18:50:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 211. [2024-11-06 18:50:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.2741935483870968) internal successors, (237), 189 states have internal predecessors, (237), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-06 18:50:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2024-11-06 18:50:22,237 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 49 [2024-11-06 18:50:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:22,238 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2024-11-06 18:50:22,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2024-11-06 18:50:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:22,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:22,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:22,241 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 (15)] Forceful destruction successful, exit code 0 [2024-11-06 18:50:22,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-06 18:50:22,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1552744902, now seen corresponding path program 1 times [2024-11-06 18:50:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:22,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052295020] [2024-11-06 18:50:22,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:22,440 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-06 18:50:22,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:22,442 INFO L229 MonitoredProcess]: Starting monitored process 16 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-06 18:50:22,442 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 (16)] Waiting until timeout for monitored process [2024-11-06 18:50:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:50:22,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:22,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:22,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052295020] [2024-11-06 18:50:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052295020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 18:50:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896648932] [2024-11-06 18:50:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:22,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:22,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:22,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:22,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:22,522 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:22,662 INFO L93 Difference]: Finished difference Result 290 states and 388 transitions. [2024-11-06 18:50:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 18:50:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:22,663 INFO L225 Difference]: With dead ends: 290 [2024-11-06 18:50:22,663 INFO L226 Difference]: Without dead ends: 266 [2024-11-06 18:50:22,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:22,664 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:22,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 440 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:22,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-06 18:50:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2024-11-06 18:50:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 219 states have (on average 1.269406392694064) internal successors, (278), 223 states have internal predecessors, (278), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-06 18:50:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 325 transitions. [2024-11-06 18:50:22,676 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 325 transitions. Word has length 50 [2024-11-06 18:50:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:22,677 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 325 transitions. [2024-11-06 18:50:22,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2024-11-06 18:50:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:22,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:22,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:22,681 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 (16)] Ended with exit code 0 [2024-11-06 18:50:22,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-06 18:50:22,879 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:22,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:22,879 INFO L85 PathProgramCache]: Analyzing trace with hash -963972016, now seen corresponding path program 1 times [2024-11-06 18:50:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014405719] [2024-11-06 18:50:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:22,880 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-06 18:50:22,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:22,882 INFO L229 MonitoredProcess]: Starting monitored process 17 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-06 18:50:22,883 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 (17)] Waiting until timeout for monitored process [2024-11-06 18:50:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:22,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:50:22,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:22,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:50:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 18:50:23,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:23,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014405719] [2024-11-06 18:50:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014405719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:50:23,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:50:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-06 18:50:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790277099] [2024-11-06 18:50:23,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:50:23,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 18:50:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 18:50:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:50:23,010 INFO L87 Difference]: Start difference. First operand 248 states and 325 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:23,068 INFO L93 Difference]: Finished difference Result 271 states and 351 transitions. [2024-11-06 18:50:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:23,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-06 18:50:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:23,070 INFO L225 Difference]: With dead ends: 271 [2024-11-06 18:50:23,070 INFO L226 Difference]: Without dead ends: 237 [2024-11-06 18:50:23,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:23,070 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:23,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 561 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-06 18:50:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2024-11-06 18:50:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 201 states have internal predecessors, (252), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-06 18:50:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2024-11-06 18:50:23,082 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 50 [2024-11-06 18:50:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:23,083 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2024-11-06 18:50:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:50:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2024-11-06 18:50:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 18:50:23,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:23,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:23,086 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 (17)] Ended with exit code 0 [2024-11-06 18:50:23,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-06 18:50:23,284 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:23,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1182826734, now seen corresponding path program 1 times [2024-11-06 18:50:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:23,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015488993] [2024-11-06 18:50:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,285 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-06 18:50:23,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:23,286 INFO L229 MonitoredProcess]: Starting monitored process 18 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-06 18:50:23,287 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 (18)] Waiting until timeout for monitored process [2024-11-06 18:50:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:23,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:23,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:23,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015488993] [2024-11-06 18:50:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015488993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337800934] [2024-11-06 18:50:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:23,350 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:23,369 INFO L93 Difference]: Finished difference Result 260 states and 340 transitions. [2024-11-06 18:50:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-06 18:50:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:23,370 INFO L225 Difference]: With dead ends: 260 [2024-11-06 18:50:23,370 INFO L226 Difference]: Without dead ends: 226 [2024-11-06 18:50:23,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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-06 18:50:23,371 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 26 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:23,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-06 18:50:23,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-06 18:50:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.218274111675127) internal successors, (240), 201 states have internal predecessors, (240), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-06 18:50:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2024-11-06 18:50:23,387 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 50 [2024-11-06 18:50:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:23,387 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2024-11-06 18:50:23,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2024-11-06 18:50:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:23,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:23,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:23,391 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 (18)] Ended with exit code 0 [2024-11-06 18:50:23,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-06 18:50:23,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:23,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1332385442, now seen corresponding path program 1 times [2024-11-06 18:50:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518499322] [2024-11-06 18:50:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,589 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-06 18:50:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:23,591 INFO L229 MonitoredProcess]: Starting monitored process 19 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-06 18:50:23,592 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 (19)] Waiting until timeout for monitored process [2024-11-06 18:50:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:50:23,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:23,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:23,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:23,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518499322] [2024-11-06 18:50:23,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518499322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:23,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:23,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:50:23,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341916566] [2024-11-06 18:50:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:23,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:50:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:23,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:50:23,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:50:23,636 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:23,647 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2024-11-06 18:50:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:50:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:23,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:23,648 INFO L225 Difference]: With dead ends: 235 [2024-11-06 18:50:23,648 INFO L226 Difference]: Without dead ends: 194 [2024-11-06 18:50:23,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 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-06 18:50:23,649 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 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.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:23,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:50:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-06 18:50:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2024-11-06 18:50:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 158 states have (on average 1.2278481012658229) internal successors, (194), 164 states have internal predecessors, (194), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-06 18:50:23,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2024-11-06 18:50:23,655 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 52 [2024-11-06 18:50:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:23,655 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2024-11-06 18:50:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2024-11-06 18:50:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-06 18:50:23,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:23,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:50:23,659 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 (19)] Ended with exit code 0 [2024-11-06 18:50:23,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-06 18:50:23,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -444512686, now seen corresponding path program 1 times [2024-11-06 18:50:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689233766] [2024-11-06 18:50:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:23,859 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-06 18:50:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:23,861 INFO L229 MonitoredProcess]: Starting monitored process 20 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-06 18:50:23,862 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 (20)] Waiting until timeout for monitored process [2024-11-06 18:50:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:23,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:50:23,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:50:23,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:23,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689233766] [2024-11-06 18:50:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689233766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:23,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:50:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057145422] [2024-11-06 18:50:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:50:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:50:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:23,925 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:24,030 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2024-11-06 18:50:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:50:24,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-06 18:50:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:24,031 INFO L225 Difference]: With dead ends: 235 [2024-11-06 18:50:24,031 INFO L226 Difference]: Without dead ends: 186 [2024-11-06 18:50:24,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:50:24,032 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:24,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 459 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:50:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-06 18:50:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2024-11-06 18:50:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 132 states have (on average 1.25) internal successors, (165), 138 states have internal predecessors, (165), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-06 18:50:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2024-11-06 18:50:24,038 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 52 [2024-11-06 18:50:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:24,038 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2024-11-06 18:50:24,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:50:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2024-11-06 18:50:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 18:50:24,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:24,049 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:24,052 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 (20)] Ended with exit code 0 [2024-11-06 18:50:24,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-06 18:50:24,250 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 147478644, now seen corresponding path program 1 times [2024-11-06 18:50:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588293708] [2024-11-06 18:50:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:24,251 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-06 18:50:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:24,252 INFO L229 MonitoredProcess]: Starting monitored process 21 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-06 18:50:24,254 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 (21)] Waiting until timeout for monitored process [2024-11-06 18:50:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:24,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:50:24,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:24,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:24,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:24,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588293708] [2024-11-06 18:50:24,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588293708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:24,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:24,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:24,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353407439] [2024-11-06 18:50:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:24,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:24,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:50:24,428 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:26,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:50:26,299 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2024-11-06 18:50:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:50:26,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-06 18:50:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:50:26,300 INFO L225 Difference]: With dead ends: 176 [2024-11-06 18:50:26,300 INFO L226 Difference]: Without dead ends: 174 [2024-11-06 18:50:26,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:50:26,301 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 8 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 18:50:26,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 490 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 18:50:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-06 18:50:26,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2024-11-06 18:50:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 144 states have internal predecessors, (168), 23 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 16 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-06 18:50:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2024-11-06 18:50:26,308 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 54 [2024-11-06 18:50:26,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:50:26,308 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2024-11-06 18:50:26,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2024-11-06 18:50:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 18:50:26,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:50:26,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:50:26,312 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 (21)] Ended with exit code 0 [2024-11-06 18:50:26,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-06 18:50:26,509 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:50:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:50:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash -36563148, now seen corresponding path program 1 times [2024-11-06 18:50:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:50:26,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723353716] [2024-11-06 18:50:26,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:50:26,510 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-06 18:50:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:50:26,512 INFO L229 MonitoredProcess]: Starting monitored process 22 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-06 18:50:26,512 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 (22)] Waiting until timeout for monitored process [2024-11-06 18:50:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:50:26,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:50:26,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:50:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:50:35,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:50:35,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:50:35,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723353716] [2024-11-06 18:50:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723353716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:50:35,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:50:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:50:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657071238] [2024-11-06 18:50:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:50:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:50:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:50:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:50:35,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-11-06 18:50:35,469 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:50:38,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:41,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:45,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:47,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:51,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:53,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:50:57,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:01,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:01,457 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2024-11-06 18:51:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:51:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-06 18:51:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:01,458 INFO L225 Difference]: With dead ends: 180 [2024-11-06 18:51:01,458 INFO L226 Difference]: Without dead ends: 178 [2024-11-06 18:51:01,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2024-11-06 18:51:01,459 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:01,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 493 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 7 Unknown, 0 Unchecked, 26.0s Time] [2024-11-06 18:51:01,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-06 18:51:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2024-11-06 18:51:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 141 states have internal predecessors, (168), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-06 18:51:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2024-11-06 18:51:01,467 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 55 [2024-11-06 18:51:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2024-11-06 18:51:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2024-11-06 18:51:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-06 18:51:01,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:01,468 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:01,472 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 (22)] Ended with exit code 0 [2024-11-06 18:51:01,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-06 18:51:01,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:01,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:01,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2067393215, now seen corresponding path program 1 times [2024-11-06 18:51:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:01,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945381059] [2024-11-06 18:51:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:01,670 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-06 18:51:01,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:01,673 INFO L229 MonitoredProcess]: Starting monitored process 23 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-06 18:51:01,674 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 (23)] Waiting until timeout for monitored process [2024-11-06 18:51:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:01,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 18:51:01,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:51:02,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:02,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945381059] [2024-11-06 18:51:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945381059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:02,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-06 18:51:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742985514] [2024-11-06 18:51:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:02,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 18:51:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 18:51:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:51:02,296 INFO L87 Difference]: Start difference. First operand 162 states and 206 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:03,083 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2024-11-06 18:51:03,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:51:03,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-06 18:51:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:03,084 INFO L225 Difference]: With dead ends: 202 [2024-11-06 18:51:03,084 INFO L226 Difference]: Without dead ends: 190 [2024-11-06 18:51:03,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:03,086 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 19 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:03,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 819 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:51:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-06 18:51:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2024-11-06 18:51:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 141 states have internal predecessors, (166), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-06 18:51:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2024-11-06 18:51:03,094 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 58 [2024-11-06 18:51:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:03,095 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2024-11-06 18:51:03,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2024-11-06 18:51:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-06 18:51:03,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:03,095 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:03,098 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 (23)] Ended with exit code 0 [2024-11-06 18:51:03,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-06 18:51:03,296 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 589240327, now seen corresponding path program 1 times [2024-11-06 18:51:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021744812] [2024-11-06 18:51:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:03,297 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-06 18:51:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:03,299 INFO L229 MonitoredProcess]: Starting monitored process 24 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-06 18:51:03,300 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 (24)] Waiting until timeout for monitored process [2024-11-06 18:51:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:03,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:51:03,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:51:03,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:03,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021744812] [2024-11-06 18:51:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021744812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:03,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:03,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:51:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370935304] [2024-11-06 18:51:03,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:03,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:51:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:51:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:51:03,377 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:51:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:03,438 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2024-11-06 18:51:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:51:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-06 18:51:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:03,440 INFO L225 Difference]: With dead ends: 181 [2024-11-06 18:51:03,440 INFO L226 Difference]: Without dead ends: 179 [2024-11-06 18:51:03,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:51:03,440 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 20 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:03,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 514 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-06 18:51:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2024-11-06 18:51:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 144 states have internal predecessors, (169), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-06 18:51:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2024-11-06 18:51:03,447 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 60 [2024-11-06 18:51:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2024-11-06 18:51:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:51:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2024-11-06 18:51:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-06 18:51:03,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:03,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:03,452 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 (24)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-06 18:51:03,649 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:03,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1364362596, now seen corresponding path program 1 times [2024-11-06 18:51:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705203907] [2024-11-06 18:51:03,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:03,650 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-06 18:51:03,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:03,651 INFO L229 MonitoredProcess]: Starting monitored process 25 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-06 18:51:03,652 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 (25)] Waiting until timeout for monitored process [2024-11-06 18:51:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:03,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:51:03,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:51:04,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:04,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705203907] [2024-11-06 18:51:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705203907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 18:51:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382688181] [2024-11-06 18:51:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:51:04,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:04,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:51:04,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:51:04,037 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:04,964 INFO L93 Difference]: Finished difference Result 270 states and 344 transitions. [2024-11-06 18:51:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:51:04,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-06 18:51:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:04,966 INFO L225 Difference]: With dead ends: 270 [2024-11-06 18:51:04,966 INFO L226 Difference]: Without dead ends: 241 [2024-11-06 18:51:04,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:51:04,966 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 35 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:04,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 861 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 18:51:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-06 18:51:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 187. [2024-11-06 18:51:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 156 states have (on average 1.2179487179487178) internal successors, (190), 163 states have internal predecessors, (190), 23 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-06 18:51:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 234 transitions. [2024-11-06 18:51:04,975 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 234 transitions. Word has length 60 [2024-11-06 18:51:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 234 transitions. [2024-11-06 18:51:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 234 transitions. [2024-11-06 18:51:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-06 18:51:04,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:04,976 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:04,979 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 (25)] Ended with exit code 0 [2024-11-06 18:51:05,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-06 18:51:05,179 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:05,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash 865353347, now seen corresponding path program 1 times [2024-11-06 18:51:05,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:05,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629847585] [2024-11-06 18:51:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:05,180 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-06 18:51:05,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:05,182 INFO L229 MonitoredProcess]: Starting monitored process 26 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-06 18:51:05,182 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 (26)] Waiting until timeout for monitored process [2024-11-06 18:51:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:05,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:51:05,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:51:05,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:05,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:05,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629847585] [2024-11-06 18:51:05,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629847585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:05,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:05,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:51:05,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414690351] [2024-11-06 18:51:05,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:05,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:51:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:05,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:51:05,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:51:05,262 INFO L87 Difference]: Start difference. First operand 187 states and 234 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:51:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:05,326 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2024-11-06 18:51:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:51:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-06 18:51:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:05,328 INFO L225 Difference]: With dead ends: 209 [2024-11-06 18:51:05,328 INFO L226 Difference]: Without dead ends: 207 [2024-11-06 18:51:05,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:51:05,328 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 17 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:05,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 513 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-06 18:51:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2024-11-06 18:51:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 167 states have internal predecessors, (193), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-06 18:51:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2024-11-06 18:51:05,343 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 60 [2024-11-06 18:51:05,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:05,343 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2024-11-06 18:51:05,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 18:51:05,343 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2024-11-06 18:51:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 18:51:05,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:05,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:05,347 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 (26)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:05,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-06 18:51:05,544 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:05,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash 921322142, now seen corresponding path program 1 times [2024-11-06 18:51:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475118245] [2024-11-06 18:51:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:05,545 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-06 18:51:05,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:05,547 INFO L229 MonitoredProcess]: Starting monitored process 27 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-06 18:51:05,547 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 (27)] Waiting until timeout for monitored process [2024-11-06 18:51:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:05,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 18:51:05,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:06,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:06,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475118245] [2024-11-06 18:51:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475118245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-06 18:51:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769457199] [2024-11-06 18:51:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 18:51:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 18:51:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-06 18:51:06,411 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:08,150 INFO L93 Difference]: Finished difference Result 279 states and 350 transitions. [2024-11-06 18:51:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:51:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2024-11-06 18:51:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:08,151 INFO L225 Difference]: With dead ends: 279 [2024-11-06 18:51:08,151 INFO L226 Difference]: Without dead ends: 253 [2024-11-06 18:51:08,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:08,152 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 30 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:08,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 988 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 18:51:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-06 18:51:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 211. [2024-11-06 18:51:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 175 states have (on average 1.217142857142857) internal successors, (213), 182 states have internal predecessors, (213), 27 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-06 18:51:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 265 transitions. [2024-11-06 18:51:08,168 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 265 transitions. Word has length 65 [2024-11-06 18:51:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:08,168 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 265 transitions. [2024-11-06 18:51:08,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 265 transitions. [2024-11-06 18:51:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 18:51:08,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:08,169 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:08,178 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 (27)] Ended with exit code 0 [2024-11-06 18:51:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-06 18:51:08,369 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1450417120, now seen corresponding path program 1 times [2024-11-06 18:51:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752142575] [2024-11-06 18:51:08,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:08,370 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-06 18:51:08,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:08,371 INFO L229 MonitoredProcess]: Starting monitored process 28 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-06 18:51:08,372 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 (28)] Waiting until timeout for monitored process [2024-11-06 18:51:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:08,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 18:51:08,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:08,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:08,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:08,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:08,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752142575] [2024-11-06 18:51:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752142575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 18:51:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002392073] [2024-11-06 18:51:08,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 18:51:08,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 18:51:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:51:08,770 INFO L87 Difference]: Start difference. First operand 211 states and 265 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:13,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-06 18:51:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:13,826 INFO L93 Difference]: Finished difference Result 298 states and 379 transitions. [2024-11-06 18:51:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-06 18:51:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2024-11-06 18:51:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:13,827 INFO L225 Difference]: With dead ends: 298 [2024-11-06 18:51:13,827 INFO L226 Difference]: Without dead ends: 275 [2024-11-06 18:51:13,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:51:13,828 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 30 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:13,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 669 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-11-06 18:51:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-06 18:51:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 214. [2024-11-06 18:51:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 177 states have (on average 1.2203389830508475) internal successors, (216), 185 states have internal predecessors, (216), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-06 18:51:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2024-11-06 18:51:13,838 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 65 [2024-11-06 18:51:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:13,838 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2024-11-06 18:51:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2024-11-06 18:51:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 18:51:13,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:13,839 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:13,844 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 (28)] Ended with exit code 0 [2024-11-06 18:51:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-06 18:51:14,040 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1348434166, now seen corresponding path program 1 times [2024-11-06 18:51:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877029962] [2024-11-06 18:51:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,041 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-06 18:51:14,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:14,044 INFO L229 MonitoredProcess]: Starting monitored process 29 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-06 18:51:14,044 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 (29)] Waiting until timeout for monitored process [2024-11-06 18:51:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 18:51:14,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:51:14,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:14,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877029962] [2024-11-06 18:51:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877029962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:14,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [617208811] [2024-11-06 18:51:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:14,668 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 18:51:14,671 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 18:51:14,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2024-11-06 18:51:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:14,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:51:14,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:51:14,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:51:14,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [617208811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:14,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:51:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 12 [2024-11-06 18:51:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173324783] [2024-11-06 18:51:14,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:14,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:51:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:51:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:51:14,909 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:15,183 INFO L93 Difference]: Finished difference Result 241 states and 294 transitions. [2024-11-06 18:51:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:51:15,184 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 65 [2024-11-06 18:51:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:15,184 INFO L225 Difference]: With dead ends: 241 [2024-11-06 18:51:15,185 INFO L226 Difference]: Without dead ends: 192 [2024-11-06 18:51:15,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-06 18:51:15,185 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 11 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:15,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 839 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:51:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-06 18:51:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-06 18:51:15,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 158 states have (on average 1.2151898734177216) internal successors, (192), 165 states have internal predecessors, (192), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 18:51:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 240 transitions. [2024-11-06 18:51:15,194 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 240 transitions. Word has length 65 [2024-11-06 18:51:15,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:15,194 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 240 transitions. [2024-11-06 18:51:15,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:15,194 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 240 transitions. [2024-11-06 18:51:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 18:51:15,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:15,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:15,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2024-11-06 18:51:15,398 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 (29)] Ended with exit code 0 [2024-11-06 18:51:15,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /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-06 18:51:15,596 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash -957629534, now seen corresponding path program 1 times [2024-11-06 18:51:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251938131] [2024-11-06 18:51:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:15,597 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-06 18:51:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:15,598 INFO L229 MonitoredProcess]: Starting monitored process 31 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-06 18:51:15,600 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 (31)] Waiting until timeout for monitored process [2024-11-06 18:51:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:15,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:51:15,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:16,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:16,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251938131] [2024-11-06 18:51:16,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251938131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:16,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1670429638] [2024-11-06 18:51:16,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:16,530 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:16,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 18:51:16,532 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 18:51:16,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2024-11-06 18:51:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:16,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 18:51:16,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:51:18,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:18,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1670429638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:18,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 18:51:18,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 22 [2024-11-06 18:51:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577758258] [2024-11-06 18:51:18,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:18,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-06 18:51:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-06 18:51:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2024-11-06 18:51:18,711 INFO L87 Difference]: Start difference. First operand 192 states and 240 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-06 18:51:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:22,066 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions. [2024-11-06 18:51:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 18:51:22,067 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 66 [2024-11-06 18:51:22,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:22,068 INFO L225 Difference]: With dead ends: 255 [2024-11-06 18:51:22,068 INFO L226 Difference]: Without dead ends: 229 [2024-11-06 18:51:22,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2024-11-06 18:51:22,069 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 30 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:22,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1319 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 18:51:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-06 18:51:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 199. [2024-11-06 18:51:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 165 states have (on average 1.2242424242424241) internal successors, (202), 171 states have internal predecessors, (202), 25 states have call successors, (25), 7 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 18:51:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-11-06 18:51:22,078 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 66 [2024-11-06 18:51:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:22,078 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-11-06 18:51:22,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-06 18:51:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-11-06 18:51:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 18:51:22,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:22,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:22,082 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 (31)] Ended with exit code 0 [2024-11-06 18:51:22,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2024-11-06 18:51:22,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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,32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:22,480 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -660447408, now seen corresponding path program 1 times [2024-11-06 18:51:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:22,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044519503] [2024-11-06 18:51:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:22,480 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-06 18:51:22,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:22,483 INFO L229 MonitoredProcess]: Starting monitored process 33 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-06 18:51:22,483 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 (33)] Waiting until timeout for monitored process [2024-11-06 18:51:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:22,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 18:51:22,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:23,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:23,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:23,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044519503] [2024-11-06 18:51:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044519503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 18:51:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624323085] [2024-11-06 18:51:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:51:23,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:23,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:51:23,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:51:23,060 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:23,740 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2024-11-06 18:51:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:51:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 66 [2024-11-06 18:51:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:23,742 INFO L225 Difference]: With dead ends: 213 [2024-11-06 18:51:23,742 INFO L226 Difference]: Without dead ends: 205 [2024-11-06 18:51:23,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:51:23,742 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 8 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:23,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 700 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:51:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-06 18:51:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2024-11-06 18:51:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 168 states have (on average 1.2202380952380953) internal successors, (205), 174 states have internal predecessors, (205), 26 states have call successors, (26), 7 states have call predecessors, (26), 8 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-06 18:51:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 255 transitions. [2024-11-06 18:51:23,752 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 255 transitions. Word has length 66 [2024-11-06 18:51:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:23,752 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 255 transitions. [2024-11-06 18:51:23,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 255 transitions. [2024-11-06 18:51:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 18:51:23,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:23,753 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:23,755 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 (33)] Ended with exit code 0 [2024-11-06 18:51:23,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-06 18:51:23,953 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:23,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1467102624, now seen corresponding path program 1 times [2024-11-06 18:51:23,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:23,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399856620] [2024-11-06 18:51:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:23,954 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-06 18:51:23,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:23,955 INFO L229 MonitoredProcess]: Starting monitored process 34 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-06 18:51:23,956 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 (34)] Waiting until timeout for monitored process [2024-11-06 18:51:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:23,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 18:51:23,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:24,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:24,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:24,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399856620] [2024-11-06 18:51:24,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399856620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:24,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:24,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 18:51:24,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802206755] [2024-11-06 18:51:24,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:24,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 18:51:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:24,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 18:51:24,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 18:51:24,231 INFO L87 Difference]: Start difference. First operand 203 states and 255 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:25,118 INFO L93 Difference]: Finished difference Result 226 states and 278 transitions. [2024-11-06 18:51:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 18:51:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 66 [2024-11-06 18:51:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:25,121 INFO L225 Difference]: With dead ends: 226 [2024-11-06 18:51:25,121 INFO L226 Difference]: Without dead ends: 200 [2024-11-06 18:51:25,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:51:25,122 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 27 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:25,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 621 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:51:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-06 18:51:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 163. [2024-11-06 18:51:25,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 135 states have (on average 1.1925925925925926) internal successors, (161), 140 states have internal predecessors, (161), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-06 18:51:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-06 18:51:25,130 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 66 [2024-11-06 18:51:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-06 18:51:25,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-06 18:51:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2024-11-06 18:51:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 18:51:25,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:25,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:25,135 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 (34)] Ended with exit code 0 [2024-11-06 18:51:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-06 18:51:25,333 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1151744600, now seen corresponding path program 1 times [2024-11-06 18:51:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041875415] [2024-11-06 18:51:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:25,333 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-06 18:51:25,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:25,335 INFO L229 MonitoredProcess]: Starting monitored process 35 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-06 18:51:25,337 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 (35)] Waiting until timeout for monitored process [2024-11-06 18:51:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:25,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:51:25,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:25,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:25,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041875415] [2024-11-06 18:51:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041875415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:51:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185775535] [2024-11-06 18:51:25,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:25,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:51:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:25,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:51:25,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:51:25,416 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:51:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:25,480 INFO L93 Difference]: Finished difference Result 184 states and 219 transitions. [2024-11-06 18:51:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:51:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-06 18:51:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:25,481 INFO L225 Difference]: With dead ends: 184 [2024-11-06 18:51:25,481 INFO L226 Difference]: Without dead ends: 170 [2024-11-06 18:51:25,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:51:25,482 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 14 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:25,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-06 18:51:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2024-11-06 18:51:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 127 states have (on average 1.188976377952756) internal successors, (151), 133 states have internal predecessors, (151), 18 states have call successors, (18), 8 states have call predecessors, (18), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-06 18:51:25,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2024-11-06 18:51:25,491 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 68 [2024-11-06 18:51:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:25,491 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2024-11-06 18:51:25,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:51:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2024-11-06 18:51:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 18:51:25,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:25,492 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:25,498 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 (35)] Ended with exit code 0 [2024-11-06 18:51:25,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-06 18:51:25,692 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:25,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2076413752, now seen corresponding path program 1 times [2024-11-06 18:51:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:25,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034321186] [2024-11-06 18:51:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:25,693 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-06 18:51:25,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:25,695 INFO L229 MonitoredProcess]: Starting monitored process 36 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-06 18:51:25,695 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 (36)] Waiting until timeout for monitored process [2024-11-06 18:51:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:25,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:51:25,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:51:25,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:25,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:25,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034321186] [2024-11-06 18:51:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034321186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:51:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994571538] [2024-11-06 18:51:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:25,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:51:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:25,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:51:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:51:25,779 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:25,803 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2024-11-06 18:51:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:51:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2024-11-06 18:51:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:25,804 INFO L225 Difference]: With dead ends: 174 [2024-11-06 18:51:25,804 INFO L226 Difference]: Without dead ends: 147 [2024-11-06 18:51:25,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-06 18:51:25,804 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 16 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:25,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 267 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:25,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-06 18:51:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2024-11-06 18:51:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-06 18:51:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-06 18:51:25,811 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 67 [2024-11-06 18:51:25,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:25,811 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-06 18:51:25,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-06 18:51:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 18:51:25,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:25,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:51:25,815 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 (36)] Ended with exit code 0 [2024-11-06 18:51:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-06 18:51:26,013 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 106001302, now seen corresponding path program 1 times [2024-11-06 18:51:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881759901] [2024-11-06 18:51:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:26,013 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-06 18:51:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:26,015 INFO L229 MonitoredProcess]: Starting monitored process 37 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-06 18:51:26,016 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 (37)] Waiting until timeout for monitored process [2024-11-06 18:51:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:26,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:51:26,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-06 18:51:26,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:26,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881759901] [2024-11-06 18:51:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881759901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:26,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 18:51:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117469604] [2024-11-06 18:51:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:26,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 18:51:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 18:51:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:51:26,119 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:51:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:26,165 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2024-11-06 18:51:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:51:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2024-11-06 18:51:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:26,166 INFO L225 Difference]: With dead ends: 139 [2024-11-06 18:51:26,166 INFO L226 Difference]: Without dead ends: 117 [2024-11-06 18:51:26,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:51:26,167 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:26,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:51:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-06 18:51:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-06 18:51:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 18:51:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2024-11-06 18:51:26,173 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 68 [2024-11-06 18:51:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2024-11-06 18:51:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 18:51:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2024-11-06 18:51:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 18:51:26,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:26,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:26,176 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 (37)] Ended with exit code 0 [2024-11-06 18:51:26,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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-06 18:51:26,374 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:26,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1801654138, now seen corresponding path program 1 times [2024-11-06 18:51:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:26,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598917971] [2024-11-06 18:51:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:26,375 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-06 18:51:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:26,376 INFO L229 MonitoredProcess]: Starting monitored process 38 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-06 18:51:26,377 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 (38)] Waiting until timeout for monitored process [2024-11-06 18:51:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:26,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:51:26,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:51:26,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:26,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598917971] [2024-11-06 18:51:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598917971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [614392369] [2024-11-06 18:51:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 18:51:26,747 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 18:51:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2024-11-06 18:51:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:26,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 18:51:26,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 18:51:26,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:26,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [614392369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:26,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:51:26,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-06 18:51:26,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173133122] [2024-11-06 18:51:26,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:26,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:51:26,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:26,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:51:26,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:51:26,915 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:27,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:27,027 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2024-11-06 18:51:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 18:51:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2024-11-06 18:51:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:27,028 INFO L225 Difference]: With dead ends: 152 [2024-11-06 18:51:27,028 INFO L226 Difference]: Without dead ends: 115 [2024-11-06 18:51:27,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2024-11-06 18:51:27,029 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:27,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 312 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-06 18:51:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-06 18:51:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 98 states have internal predecessors, (109), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 18:51:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2024-11-06 18:51:27,035 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 67 [2024-11-06 18:51:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:27,035 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2024-11-06 18:51:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:51:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2024-11-06 18:51:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-06 18:51:27,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:27,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:27,039 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 (38)] Ended with exit code 0 [2024-11-06 18:51:27,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:27,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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,39 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:27,436 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:27,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash -415450744, now seen corresponding path program 1 times [2024-11-06 18:51:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83405198] [2024-11-06 18:51:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:27,437 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-06 18:51:27,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:27,438 INFO L229 MonitoredProcess]: Starting monitored process 40 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-06 18:51:27,439 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 (40)] Waiting until timeout for monitored process [2024-11-06 18:51:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:27,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-06 18:51:27,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:51:27,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:27,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83405198] [2024-11-06 18:51:27,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83405198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:51:27,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345278456] [2024-11-06 18:51:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 18:51:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 18:51:27,922 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 18:51:27,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2024-11-06 18:51:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:27,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 18:51:27,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:51:28,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:51:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 18:51:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345278456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:51:28,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:51:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 11 [2024-11-06 18:51:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749597675] [2024-11-06 18:51:28,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:51:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:51:28,161 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:28,307 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-06 18:51:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:51:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2024-11-06 18:51:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:28,308 INFO L225 Difference]: With dead ends: 127 [2024-11-06 18:51:28,308 INFO L226 Difference]: Without dead ends: 87 [2024-11-06 18:51:28,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-06 18:51:28,308 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:28,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 580 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:51:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-06 18:51:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-06 18:51:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 72 states have internal predecessors, (80), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:51:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-06 18:51:28,317 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 67 [2024-11-06 18:51:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:28,317 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-06 18:51:28,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-06 18:51:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-06 18:51:28,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:28,317 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:28,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2024-11-06 18:51:28,521 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 (40)] Ended with exit code 0 [2024-11-06 18:51:28,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,40 /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-06 18:51:28,718 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 438339121, now seen corresponding path program 1 times [2024-11-06 18:51:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182415844] [2024-11-06 18:51:28,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:28,719 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-06 18:51:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:28,721 INFO L229 MonitoredProcess]: Starting monitored process 42 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-06 18:51:28,722 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 (42)] Waiting until timeout for monitored process [2024-11-06 18:51:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:28,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 18:51:28,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 18:51:32,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:32,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182415844] [2024-11-06 18:51:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182415844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:32,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 18:51:32,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373217880] [2024-11-06 18:51:32,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:32,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:51:32,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:32,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:51:32,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:51:32,593 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:33,314 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-06 18:51:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:51:33,315 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 73 [2024-11-06 18:51:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:33,315 INFO L225 Difference]: With dead ends: 108 [2024-11-06 18:51:33,315 INFO L226 Difference]: Without dead ends: 92 [2024-11-06 18:51:33,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-06 18:51:33,316 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:33,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 541 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:51:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-06 18:51:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-06 18:51:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 72 states have internal predecessors, (79), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-06 18:51:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-06 18:51:33,322 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 73 [2024-11-06 18:51:33,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:33,322 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-06 18:51:33,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-06 18:51:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-06 18:51:33,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:33,323 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:33,326 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 (42)] Ended with exit code 0 [2024-11-06 18:51:33,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /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-06 18:51:33,523 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -405666381, now seen corresponding path program 1 times [2024-11-06 18:51:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:33,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522150041] [2024-11-06 18:51:33,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:33,524 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-06 18:51:33,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:33,526 INFO L229 MonitoredProcess]: Starting monitored process 43 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-06 18:51:33,526 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 (43)] Waiting until timeout for monitored process [2024-11-06 18:51:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:33,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-06 18:51:33,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 18:51:34,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:34,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:34,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522150041] [2024-11-06 18:51:34,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522150041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:34,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:34,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-06 18:51:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032563497] [2024-11-06 18:51:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:34,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:51:34,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:51:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:34,598 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:35,791 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-06 18:51:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:51:35,792 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 73 [2024-11-06 18:51:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:35,792 INFO L225 Difference]: With dead ends: 99 [2024-11-06 18:51:35,792 INFO L226 Difference]: Without dead ends: 80 [2024-11-06 18:51:35,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:51:35,793 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:35,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 561 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 18:51:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-06 18:51:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-11-06 18:51:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 18:51:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-11-06 18:51:35,797 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 73 [2024-11-06 18:51:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:35,797 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-11-06 18:51:35,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-11-06 18:51:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:35,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:35,798 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:35,801 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 (43)] Ended with exit code 0 [2024-11-06 18:51:35,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /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-06 18:51:35,998 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:35,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1028998347, now seen corresponding path program 1 times [2024-11-06 18:51:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:35,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207050102] [2024-11-06 18:51:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:35,999 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-06 18:51:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:36,001 INFO L229 MonitoredProcess]: Starting monitored process 44 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-06 18:51:36,002 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 (44)] Waiting until timeout for monitored process [2024-11-06 18:51:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:36,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-06 18:51:36,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:51:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 18:51:36,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:51:36,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 18:51:36,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207050102] [2024-11-06 18:51:36,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207050102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:51:36,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:51:36,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 18:51:36,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168936353] [2024-11-06 18:51:36,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:51:36,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:51:36,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 18:51:36,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:51:36,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:51:36,515 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:51:37,060 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-06 18:51:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 18:51:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 74 [2024-11-06 18:51:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:51:37,061 INFO L225 Difference]: With dead ends: 92 [2024-11-06 18:51:37,061 INFO L226 Difference]: Without dead ends: 68 [2024-11-06 18:51:37,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:51:37,061 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:51:37,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 472 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:51:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-06 18:51:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-06 18:51:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-06 18:51:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2024-11-06 18:51:37,068 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 74 [2024-11-06 18:51:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:51:37,068 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2024-11-06 18:51:37,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-06 18:51:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2024-11-06 18:51:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-06 18:51:37,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:51:37,068 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 18:51:37,072 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 (44)] Forceful destruction successful, exit code 0 [2024-11-06 18:51:37,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /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-06 18:51:37,269 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:51:37,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:51:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1423365133, now seen corresponding path program 1 times [2024-11-06 18:51:37,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 18:51:37,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622901126] [2024-11-06 18:51:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:51:37,270 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-06 18:51:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 18:51:37,271 INFO L229 MonitoredProcess]: Starting monitored process 45 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-06 18:51:37,272 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 (45)] Waiting until timeout for monitored process [2024-11-06 18:51:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:51:37,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 18:51:37,322 INFO L278 TraceCheckSpWp]: Computing forward predicates...