./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3'] 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/combinations/gcd_4+newton_3_4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:22:10,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:22:10,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:22:10,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:22:10,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:22:10,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:22:10,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:22:10,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:22:10,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:22:10,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:22:10,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:22:10,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:22:10,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:22:10,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:22:10,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:22:10,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:22:10,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:22:10,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:22:10,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:22:10,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:22:10,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:22:10,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:22:10,240 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2024-11-07 01:22:10,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:22:10,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:22:10,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:22:10,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:22:10,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:22:10,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2024-11-07 01:22:11,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:22:11,733 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:22:11,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2024-11-07 01:22:11,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22090f449/eca81b53dc1c4eca919516218ef9ff20/FLAG4cf62830c [2024-11-07 01:22:12,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22090f449/eca81b53dc1c4eca919516218ef9ff20 [2024-11-07 01:22:12,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:22:12,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:22:12,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:22:12,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:22:12,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:22:12,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1c9810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12, skipping insertion in model container [2024-11-07 01:22:12,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:22:12,233 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2024-11-07 01:22:12,259 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2024-11-07 01:22:12,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:22:12,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:22:12,276 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2024-11-07 01:22:12,284 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2024-11-07 01:22:12,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:22:12,293 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:22:12,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12 WrapperNode [2024-11-07 01:22:12,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:22:12,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:22:12,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:22:12,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:22:12,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,316 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2024-11-07 01:22:12,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:22:12,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:22:12,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:22:12,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:22:12,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,339 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-07 01:22:12,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:22:12,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:22:12,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:22:12,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:22:12,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (1/1) ... [2024-11-07 01:22:12,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:22:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:12,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:22:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:22:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:22:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-07 01:22:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-07 01:22:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-07 01:22:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-07 01:22:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:22:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 01:22:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:22:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:22:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 01:22:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 01:22:12,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:22:12,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:22:12,594 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-07 01:22:12,595 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:22:12,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:22:12,604 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:22:12,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:12 BoogieIcfgContainer [2024-11-07 01:22:12,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:22:12,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:22:12,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:22:12,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:22:12,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:22:12" (1/3) ... [2024-11-07 01:22:12,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fe3a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:12, skipping insertion in model container [2024-11-07 01:22:12,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:12" (2/3) ... [2024-11-07 01:22:12,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fe3a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:12, skipping insertion in model container [2024-11-07 01:22:12,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:12" (3/3) ... [2024-11-07 01:22:12,613 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2024-11-07 01:22:12,623 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:22:12,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:22:12,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:22:12,670 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;@6df87ed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:22:12,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:22:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 01:22:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 01:22:12,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:12,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:12,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-07 01:22:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:12,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451317121] [2024-11-07 01:22:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:12,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451317121] [2024-11-07 01:22:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451317121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:12,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926174263] [2024-11-07 01:22:12,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:12,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:12,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:12,921 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:12,954 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-07 01:22:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 01:22:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:12,960 INFO L225 Difference]: With dead ends: 90 [2024-11-07 01:22:12,960 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 01:22:12,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:12,964 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 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-07 01:22:12,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:22:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 01:22:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-07 01:22:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-07 01:22:12,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-07 01:22:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:12,986 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-07 01:22:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-07 01:22:12,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 01:22:12,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:12,988 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:12,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:22:12,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:12,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-07 01:22:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021693420] [2024-11-07 01:22:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021693420] [2024-11-07 01:22:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021693420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183935068] [2024-11-07 01:22:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:13,076 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:13,093 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-07 01:22:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 01:22:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:13,094 INFO L225 Difference]: With dead ends: 55 [2024-11-07 01:22:13,095 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 01:22:13,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:13,096 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:13,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:22:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 01:22:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 01:22:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-07 01:22:13,101 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-07 01:22:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-07 01:22:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-07 01:22:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 01:22:13,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:13,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:13,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:22:13,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:13,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-07 01:22:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:13,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708521752] [2024-11-07 01:22:13,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:13,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708521752] [2024-11-07 01:22:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708521752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212767004] [2024-11-07 01:22:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:13,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:13,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:13,179 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:13,202 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-07 01:22:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 01:22:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:13,204 INFO L225 Difference]: With dead ends: 56 [2024-11-07 01:22:13,204 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 01:22:13,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:13,205 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:13,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:22:13,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 01:22:13,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 01:22:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-07 01:22:13,213 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-07 01:22:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:13,213 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-07 01:22:13,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-07 01:22:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 01:22:13,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:13,214 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:22:13,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-07 01:22:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798322490] [2024-11-07 01:22:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798322490] [2024-11-07 01:22:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798322490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:22:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139944015] [2024-11-07 01:22:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:13,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:13,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 01:22:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:13,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 01:22:13,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139944015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:13,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:22:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-07 01:22:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11288773] [2024-11-07 01:22:13,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:13,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:22:13,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:22:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:22:13,523 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:13,566 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-07 01:22:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:22:13,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 01:22:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:13,569 INFO L225 Difference]: With dead ends: 60 [2024-11-07 01:22:13,569 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 01:22:13,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:22:13,570 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:13,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 01:22:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 01:22:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 01:22:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-07 01:22:13,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-07 01:22:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:13,577 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-07 01:22:13,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-07 01:22:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 01:22:13,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:13,577 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:13,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:22:13,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:13,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:13,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-07 01:22:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225469495] [2024-11-07 01:22:13,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:13,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225469495] [2024-11-07 01:22:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225469495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:22:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751489262] [2024-11-07 01:22:13,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 01:22:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:13,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:13,901 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 01:22:13,945 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 01:22:13,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:13,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 01:22:13,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:14,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751489262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:14,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:22:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-07 01:22:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482207302] [2024-11-07 01:22:14,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 01:22:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 01:22:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:22:14,106 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:14,200 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-11-07 01:22:14,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 01:22:14,201 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 01:22:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:14,202 INFO L225 Difference]: With dead ends: 68 [2024-11-07 01:22:14,202 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 01:22:14,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:22:14,203 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:14,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 330 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 01:22:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-07 01:22:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-07 01:22:14,213 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 21 [2024-11-07 01:22:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:14,213 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-07 01:22:14,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-11-07 01:22:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 01:22:14,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:14,216 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:14,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 01:22:14,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:14,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:14,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1120707465, now seen corresponding path program 3 times [2024-11-07 01:22:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905939203] [2024-11-07 01:22:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 01:22:14,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394692690] [2024-11-07 01:22:14,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 01:22:14,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:14,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:14,440 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:14,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 01:22:14,481 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-07 01:22:14,482 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:14,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 01:22:14,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 01:22:14,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 01:22:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905939203] [2024-11-07 01:22:14,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 01:22:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394692690] [2024-11-07 01:22:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394692690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:14,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:14,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 01:22:14,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206691592] [2024-11-07 01:22:14,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:14,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 01:22:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 01:22:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:22:14,892 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:15,152 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2024-11-07 01:22:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 01:22:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 01:22:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:15,153 INFO L225 Difference]: With dead ends: 76 [2024-11-07 01:22:15,153 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 01:22:15,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-07 01:22:15,154 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:15,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 293 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 01:22:15,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 01:22:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-07 01:22:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 01:22:15,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2024-11-07 01:22:15,167 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2024-11-07 01:22:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:15,168 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2024-11-07 01:22:15,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2024-11-07 01:22:15,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 01:22:15,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:15,169 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:15,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 01:22:15,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:15,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:15,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:15,370 INFO L85 PathProgramCache]: Analyzing trace with hash 469106930, now seen corresponding path program 4 times [2024-11-07 01:22:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105078284] [2024-11-07 01:22:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105078284] [2024-11-07 01:22:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105078284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:22:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314080589] [2024-11-07 01:22:15,483 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 01:22:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:15,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 01:22:15,523 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 01:22:15,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:15,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 01:22:15,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:15,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:15,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314080589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:15,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:22:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-07 01:22:15,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341235632] [2024-11-07 01:22:15,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:15,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 01:22:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:15,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 01:22:15,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:22:15,737 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:15,846 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2024-11-07 01:22:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:22:15,847 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 01:22:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:15,849 INFO L225 Difference]: With dead ends: 94 [2024-11-07 01:22:15,850 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 01:22:15,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2024-11-07 01:22:15,851 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:15,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 509 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 01:22:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 01:22:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 01:22:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-11-07 01:22:15,860 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 25 [2024-11-07 01:22:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:15,860 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-11-07 01:22:15,860 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-11-07 01:22:15,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 01:22:15,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:15,862 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:15,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 01:22:16,063 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,SelfDestructingSolverStorable6 [2024-11-07 01:22:16,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:16,063 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-07 01:22:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379192344] [2024-11-07 01:22:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:22:16,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379192344] [2024-11-07 01:22:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379192344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 01:22:16,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932716521] [2024-11-07 01:22:16,161 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 01:22:16,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:16,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:16,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:16,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 01:22:16,208 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-07 01:22:16,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:16,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 01:22:16,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:16,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932716521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:16,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 01:22:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-07 01:22:16,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658682632] [2024-11-07 01:22:16,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 01:22:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 01:22:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2024-11-07 01:22:16,440 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:16,510 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-11-07 01:22:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:22:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 01:22:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:16,512 INFO L225 Difference]: With dead ends: 76 [2024-11-07 01:22:16,512 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 01:22:16,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2024-11-07 01:22:16,513 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:16,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 01:22:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 01:22:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 01:22:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-07 01:22:16,518 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2024-11-07 01:22:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-07 01:22:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-07 01:22:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 01:22:16,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:16,520 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:16,533 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-07 01:22:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:16,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:16,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-07 01:22:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745098662] [2024-11-07 01:22:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 01:22:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910377568] [2024-11-07 01:22:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:16,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 01:22:16,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:16,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 01:22:16,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 01:22:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:16,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 01:22:16,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:22:16,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:22:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:22:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745098662] [2024-11-07 01:22:17,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 01:22:17,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910377568] [2024-11-07 01:22:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910377568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:17,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-07 01:22:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283122977] [2024-11-07 01:22:17,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:17,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 01:22:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:22:17,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 01:22:17,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:22:17,112 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:22:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:17,232 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-07 01:22:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:22:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-07 01:22:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:17,234 INFO L225 Difference]: With dead ends: 49 [2024-11-07 01:22:17,234 INFO L226 Difference]: Without dead ends: 23 [2024-11-07 01:22:17,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:22:17,235 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:17,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 378 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-07 01:22:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-07 01:22:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 01:22:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-07 01:22:17,238 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 28 [2024-11-07 01:22:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:17,238 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-07 01:22:17,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:22:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-07 01:22:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 01:22:17,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:17,239 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] [2024-11-07 01:22:17,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 01:22:17,443 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,SelfDestructingSolverStorable8 [2024-11-07 01:22:17,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-07 01:22:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:22:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330679446] [2024-11-07 01:22:17,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:22:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:22:17,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 01:22:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 01:22:17,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 01:22:17,470 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 01:22:17,471 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-07 01:22:17,472 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-07 01:22:17,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:22:17,475 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-07 01:22:17,489 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 01:22:17,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:22:17 BoogieIcfgContainer [2024-11-07 01:22:17,492 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 01:22:17,493 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 01:22:17,493 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 01:22:17,494 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 01:22:17,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:12" (3/4) ... [2024-11-07 01:22:17,496 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 01:22:17,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 01:22:17,497 INFO L158 Benchmark]: Toolchain (without parser) took 5368.54ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 54.9MB in the end (delta: 21.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-07 01:22:17,497 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:22:17,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.12ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:22:17,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.04ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 63.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:22:17,497 INFO L158 Benchmark]: Boogie Preprocessor took 39.47ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:22:17,498 INFO L158 Benchmark]: RCFGBuilder took 246.59ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 48.6MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 01:22:17,498 INFO L158 Benchmark]: TraceAbstraction took 4884.89ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 54.9MB in the end (delta: -6.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-11-07 01:22:17,498 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 01:22:17,499 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.56ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.12ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 64.7MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.04ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 63.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.47ms. Allocated memory is still 100.7MB. Free memory was 63.2MB in the beginning and 61.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.59ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 48.6MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4884.89ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 54.9MB in the end (delta: -6.9MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 34.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.8f && IN < 0.8f) [L100] CALL, EXPR f(IN) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L100] RET, EXPR f(IN) VAL [IN=112] [L100] CALL, EXPR fp(IN) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L100] RET, EXPR fp(IN) VAL [IN=112] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=112, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=112, x=110] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L104] RET, EXPR f(x) VAL [IN=112, x=111] [L104] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L104] RET, EXPR fp(x) VAL [IN=112, x=111] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=112] [L109] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2397 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2038 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 829 IncrementalHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 359 mSDtfsCounter, 829 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=6, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 355 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1963 SizeOfPredicates, 17 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 114/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 01:22:17,515 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/combinations/gcd_4+newton_3_4.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:22:19,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:22:19,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 01:22:19,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:22:19,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:22:19,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:22:19,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:22:19,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:22:19,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:22:19,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:22:19,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:22:19,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:22:19,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:22:19,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:22:19,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:22:19,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 01:22:19,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:22:19,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:22:19,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:22:19,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:22:19,321 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:22:19,321 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 -> f09b746b21098ae229b5e9917c4ca5a923788d2aece1e91f4b662939d14a19d3 [2024-11-07 01:22:19,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:22:19,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:22:19,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:22:19,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:22:19,573 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:22:19,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2024-11-07 01:22:20,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:22:20,866 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:22:20,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i [2024-11-07 01:22:20,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea5960921/0f6202111f89410e8406cefdc296512b/FLAGa10f634f9 [2024-11-07 01:22:20,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ea5960921/0f6202111f89410e8406cefdc296512b [2024-11-07 01:22:20,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:22:20,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:22:20,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:22:20,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:22:20,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:22:20,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:20" (1/1) ... [2024-11-07 01:22:20,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3193f1f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:20, skipping insertion in model container [2024-11-07 01:22:20,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:22:20" (1/1) ... [2024-11-07 01:22:20,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:22:20,991 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2024-11-07 01:22:21,015 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/combinations/gcd_4+newton_3_4.i[2848,2861] [2024-11-07 01:22:21,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:22:21,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:22:21,032 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/combinations/gcd_4+newton_3_4.i[1224,1237] [2024-11-07 01:22:21,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_4.i[2848,2861] [2024-11-07 01:22:21,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:22:21,048 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:22:21,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21 WrapperNode [2024-11-07 01:22:21,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:22:21,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:22:21,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:22:21,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:22:21,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,069 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2024-11-07 01:22:21,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:22:21,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:22:21,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:22:21,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:22:21,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,094 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-07 01:22:21,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:22:21,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:22:21,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:22:21,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:22:21,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (1/1) ... [2024-11-07 01:22:21,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:22:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:22:21,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 01:22:21,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 01:22:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:22:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 01:22:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 01:22:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-07 01:22:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-07 01:22:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-07 01:22:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-07 01:22:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:22:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:22:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 01:22:21,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 01:22:21,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:22:21,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:22:32,043 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 01:22:32,043 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:22:32,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:22:32,050 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 01:22:32,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:32 BoogieIcfgContainer [2024-11-07 01:22:32,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:22:32,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:22:32,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:22:32,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:22:32,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:22:20" (1/3) ... [2024-11-07 01:22:32,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f9c872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:32, skipping insertion in model container [2024-11-07 01:22:32,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:22:21" (2/3) ... [2024-11-07 01:22:32,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f9c872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:22:32, skipping insertion in model container [2024-11-07 01:22:32,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:22:32" (3/3) ... [2024-11-07 01:22:32,059 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_4.i [2024-11-07 01:22:32,070 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:22:32,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:22:32,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:22:32,110 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;@48e7ffab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:22:32,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:22:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 01:22:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 01:22:32,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:32,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:32,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:32,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:32,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-07 01:22:32,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621817568] [2024-11-07 01:22:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:32,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:32,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 (2)] Waiting until timeout for monitored process [2024-11-07 01:22:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:32,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 01:22:32,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:32,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:22:32,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:32,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621817568] [2024-11-07 01:22:32,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621817568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:32,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:32,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610423729] [2024-11-07 01:22:32,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:32,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:32,325 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:32,450 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-07 01:22:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 01:22:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:32,455 INFO L225 Difference]: With dead ends: 90 [2024-11-07 01:22:32,455 INFO L226 Difference]: Without dead ends: 42 [2024-11-07 01:22:32,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:32,459 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:32,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-07 01:22:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-07 01:22:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-07 01:22:32,479 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-07 01:22:32,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:32,479 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-07 01:22:32,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-07 01:22:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 01:22:32,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:32,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:32,486 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 (2)] Forceful destruction successful, exit code 0 [2024-11-07 01:22:32,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:32,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:32,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-07 01:22:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331821902] [2024-11-07 01:22:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:32,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:32,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:32,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:32,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 01:22:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:32,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 01:22:32,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:32,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:22:32,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331821902] [2024-11-07 01:22:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331821902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644012496] [2024-11-07 01:22:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:32,820 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:32,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:32,935 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-07 01:22:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:32,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 01:22:32,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:32,936 INFO L225 Difference]: With dead ends: 55 [2024-11-07 01:22:32,936 INFO L226 Difference]: Without dead ends: 41 [2024-11-07 01:22:32,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:32,937 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:32,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-07 01:22:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-07 01:22:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-07 01:22:32,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-07 01:22:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:32,942 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-07 01:22:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-07 01:22:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 01:22:32,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:32,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:32,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 01:22:33,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:33,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:33,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-07 01:22:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904046107] [2024-11-07 01:22:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:33,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:33,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:33,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 01:22:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:33,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 01:22:33,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:33,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:22:33,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904046107] [2024-11-07 01:22:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904046107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536099777] [2024-11-07 01:22:33,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:33,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:33,509 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:33,634 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-07 01:22:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:33,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 01:22:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:33,635 INFO L225 Difference]: With dead ends: 56 [2024-11-07 01:22:33,635 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 01:22:33,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:33,636 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:33,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 01:22:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-07 01:22:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-07 01:22:33,640 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-07 01:22:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:33,640 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-07 01:22:33,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-07 01:22:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 01:22:33,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:33,641 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:33,645 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-07 01:22:33,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:33,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:33,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-07 01:22:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112145380] [2024-11-07 01:22:33,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:22:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:33,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:33,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 01:22:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:22:33,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 01:22:33,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:34,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:34,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112145380] [2024-11-07 01:22:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112145380] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:34,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-07 01:22:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878973596] [2024-11-07 01:22:34,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:34,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:22:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:22:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:22:34,661 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:35,011 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-07 01:22:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 01:22:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 01:22:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:35,013 INFO L225 Difference]: With dead ends: 60 [2024-11-07 01:22:35,013 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 01:22:35,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:22:35,014 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:35,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 01:22:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 01:22:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 01:22:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:22:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-07 01:22:35,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-07 01:22:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:35,018 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-07 01:22:35,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-07 01:22:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 01:22:35,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:35,018 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:35,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 01:22:35,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:35,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:35,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-07 01:22:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015269622] [2024-11-07 01:22:35,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 01:22:35,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:35,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:35,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:35,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 01:22:35,277 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 01:22:35,278 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:35,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 01:22:35,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 01:22:37,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 01:22:42,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015269622] [2024-11-07 01:22:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015269622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:42,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 01:22:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895951262] [2024-11-07 01:22:42,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:42,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 01:22:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 01:22:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:22:42,741 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:47,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:47,113 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-07 01:22:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:22:47,118 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-07 01:22:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:47,119 INFO L225 Difference]: With dead ends: 71 [2024-11-07 01:22:47,119 INFO L226 Difference]: Without dead ends: 68 [2024-11-07 01:22:47,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:22:47,120 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:47,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 365 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-07 01:22:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-07 01:22:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-07 01:22:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 52 states have internal predecessors, (59), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 01:22:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-07 01:22:47,131 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 21 [2024-11-07 01:22:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-07 01:22:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-07 01:22:47,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 01:22:47,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:47,132 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:47,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 01:22:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:47,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:47,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -311360839, now seen corresponding path program 3 times [2024-11-07 01:22:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401784446] [2024-11-07 01:22:47,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 01:22:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:47,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:47,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 01:22:47,389 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 01:22:47,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:47,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 01:22:47,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 01:22:47,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 01:22:47,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401784446] [2024-11-07 01:22:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401784446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:22:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:22:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 01:22:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473701045] [2024-11-07 01:22:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:22:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 01:22:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 01:22:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:47,468 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:47,556 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-07 01:22:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 01:22:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-07 01:22:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:47,558 INFO L225 Difference]: With dead ends: 78 [2024-11-07 01:22:47,558 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 01:22:47,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 01:22:47,558 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:47,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 01:22:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 01:22:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-11-07 01:22:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 50 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 01:22:47,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-11-07 01:22:47,568 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 23 [2024-11-07 01:22:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-11-07 01:22:47,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-11-07 01:22:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 01:22:47,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:47,569 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:47,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 01:22:47,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:47,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:47,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash 603968502, now seen corresponding path program 4 times [2024-11-07 01:22:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148400348] [2024-11-07 01:22:47,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 01:22:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:47,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:47,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 01:22:47,847 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 01:22:47,847 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:47,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 01:22:47,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:49,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 01:22:50,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:50,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148400348] [2024-11-07 01:22:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148400348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:50,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-07 01:22:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763031780] [2024-11-07 01:22:50,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 01:22:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 01:22:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:22:50,890 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:22:54,003 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-07 01:22:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:22:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-07 01:22:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:22:54,006 INFO L225 Difference]: With dead ends: 99 [2024-11-07 01:22:54,006 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 01:22:54,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2024-11-07 01:22:54,007 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:22:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:22:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 01:22:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-07 01:22:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 01:22:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-11-07 01:22:54,021 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 25 [2024-11-07 01:22:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:22:54,021 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-11-07 01:22:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:22:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-11-07 01:22:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 01:22:54,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:22:54,022 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:22:54,030 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-07 01:22:54,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:54,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:22:54,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:22:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-07 01:22:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:22:54,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042517457] [2024-11-07 01:22:54,226 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 01:22:54,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:22:54,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:22:54,229 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:22:54,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 01:22:54,286 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-07 01:22:54,286 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 01:22:54,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 01:22:54,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:22:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:22:55,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:22:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 01:22:59,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:22:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042517457] [2024-11-07 01:22:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042517457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:22:59,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:22:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-07 01:22:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295127978] [2024-11-07 01:22:59,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:22:59,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 01:22:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:22:59,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 01:22:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-07 01:22:59,382 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:23:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:23:02,578 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2024-11-07 01:23:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 01:23:02,579 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-07 01:23:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:23:02,580 INFO L225 Difference]: With dead ends: 104 [2024-11-07 01:23:02,580 INFO L226 Difference]: Without dead ends: 70 [2024-11-07 01:23:02,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:23:02,581 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:23:02,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:23:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-07 01:23:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-07 01:23:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 01:23:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-11-07 01:23:02,589 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 27 [2024-11-07 01:23:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:23:02,589 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-11-07 01:23:02,589 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 01:23:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-11-07 01:23:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 01:23:02,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:23:02,590 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:23:02,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 01:23:02,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:23:02,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:23:02,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:23:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-07 01:23:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:23:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566843590] [2024-11-07 01:23:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:23:02,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:23:02,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:23:02,794 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:23:02,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 01:23:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:23:02,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 01:23:02,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 01:23:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:23:04,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 01:23:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 01:23:10,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 01:23:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566843590] [2024-11-07 01:23:10,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566843590] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 01:23:10,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 01:23:10,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 01:23:10,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274761898] [2024-11-07 01:23:10,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 01:23:10,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 01:23:10,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 01:23:10,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 01:23:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-07 01:23:10,830 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:23:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:23:14,867 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-07 01:23:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 01:23:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-07 01:23:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:23:14,869 INFO L225 Difference]: With dead ends: 76 [2024-11-07 01:23:14,869 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 01:23:14,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:23:14,869 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:23:14,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 399 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-07 01:23:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 01:23:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-07 01:23:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 01:23:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-07 01:23:14,875 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 28 [2024-11-07 01:23:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:23:14,875 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-07 01:23:14,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 01:23:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-07 01:23:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 01:23:14,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:23:14,877 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] [2024-11-07 01:23:14,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-07 01:23:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:23:15,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:23:15,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:23:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-07 01:23:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 01:23:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410370482] [2024-11-07 01:23:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:23:15,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 01:23:15,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 01:23:15,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 01:23:15,083 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