./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.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', '0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.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 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:17:40,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:17:40,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:17:40,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:17:40,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:17:40,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:17:40,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:17:40,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:17:40,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:17:40,131 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:17:40,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:17:40,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:17:40,131 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:17:40,132 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:17:40,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:17:40,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:17:40,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:40,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:17:40,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:17:40,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:17:40,135 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 -> 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 [2024-11-07 08:17:40,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:17:40,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:17:40,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:17:40,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:17:40,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:17:40,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:41,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:17:42,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:17:42,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:42,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cb6b48dd/448829d211b846d180abfabef76d6965/FLAGb159ecc8e [2024-11-07 08:17:42,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cb6b48dd/448829d211b846d180abfabef76d6965 [2024-11-07 08:17:42,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:17:42,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:17:42,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:42,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:17:42,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:17:42,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a930163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42, skipping insertion in model container [2024-11-07 08:17:42,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:17:42,262 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i[915,928] [2024-11-07 08:17:42,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:42,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:17:42,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i[915,928] [2024-11-07 08:17:42,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:42,373 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:17:42,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42 WrapperNode [2024-11-07 08:17:42,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:42,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:42,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:17:42,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:17:42,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,417 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-07 08:17:42,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:42,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:17:42,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:17:42,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:17:42,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:17:42,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:17:42,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:17:42,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:17:42,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:17:42,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (1/1) ... [2024-11-07 08:17:42,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:42,506 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 08:17:42,510 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 08:17:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:17:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:17:42,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:17:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:17:42,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:17:42,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:17:42,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:17:42,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:17:42,815 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 08:17:42,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:17:42,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:17:42,828 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:17:42,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:42 BoogieIcfgContainer [2024-11-07 08:17:42,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:17:42,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:17:42,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:17:42,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:17:42,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:17:42" (1/3) ... [2024-11-07 08:17:42,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba88f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:42, skipping insertion in model container [2024-11-07 08:17:42,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:42" (2/3) ... [2024-11-07 08:17:42,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba88f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:42, skipping insertion in model container [2024-11-07 08:17:42,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:42" (3/3) ... [2024-11-07 08:17:42,840 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:42,853 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:17:42,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:17:42,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:17:42,928 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;@6e2546ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:17:42,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:17:42,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:42,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:42,944 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:42,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -222045186, now seen corresponding path program 1 times [2024-11-07 08:17:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802442788] [2024-11-07 08:17:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:17:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:17:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:17:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:17:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 08:17:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:17:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:17:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:17:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:17:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 08:17:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802442788] [2024-11-07 08:17:43,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802442788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:43,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:43,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:17:43,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040940631] [2024-11-07 08:17:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:43,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:17:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:17:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:43,357 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:43,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:43,380 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2024-11-07 08:17:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:17:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-07 08:17:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:43,390 INFO L225 Difference]: With dead ends: 103 [2024-11-07 08:17:43,391 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 08:17:43,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:43,396 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:17:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 08:17:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 08:17:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 08:17:43,430 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 103 [2024-11-07 08:17:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:43,431 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 08:17:43,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 08:17:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:43,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:43,434 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:43,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:17:43,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:43,436 INFO L85 PathProgramCache]: Analyzing trace with hash 644726474, now seen corresponding path program 1 times [2024-11-07 08:17:43,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:43,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290342597] [2024-11-07 08:17:43,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:17:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:17:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:17:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:17:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:17:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:17:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:17:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 08:17:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 08:17:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 08:17:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 08:17:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 08:17:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 08:17:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 08:17:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 08:17:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 08:17:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:17:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:17:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290342597] [2024-11-07 08:17:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290342597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:17:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362886125] [2024-11-07 08:17:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:44,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:44,373 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 08:17:44,375 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 08:17:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:44,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 08:17:44,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:17:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-07 08:17:44,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:17:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:17:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362886125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:17:45,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:17:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-07 08:17:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160231918] [2024-11-07 08:17:45,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:17:45,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:17:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:17:45,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:17:45,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:17:45,036 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 08:17:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:45,432 INFO L93 Difference]: Finished difference Result 153 states and 214 transitions. [2024-11-07 08:17:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:17:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2024-11-07 08:17:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:45,435 INFO L225 Difference]: With dead ends: 153 [2024-11-07 08:17:45,437 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 08:17:45,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:17:45,439 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 80 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:45,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 174 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 08:17:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 08:17:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 54. [2024-11-07 08:17:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-07 08:17:45,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 103 [2024-11-07 08:17:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:45,461 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-07 08:17:45,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 08:17:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-07 08:17:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:45,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:45,469 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:45,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:17:45,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:45,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:45,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:45,671 INFO L85 PathProgramCache]: Analyzing trace with hash 701984776, now seen corresponding path program 1 times [2024-11-07 08:17:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:17:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881407155] [2024-11-07 08:17:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:17:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:17:45,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616997251] [2024-11-07 08:17:45,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:45,754 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 08:17:45,756 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 08:17:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:17:45,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:17:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:17:45,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:17:45,955 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:17:45,956 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:17:45,976 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 08:17:46,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:17:46,161 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-07 08:17:46,226 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:17:46,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:17:46 BoogieIcfgContainer [2024-11-07 08:17:46,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:17:46,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:17:46,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:17:46,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:17:46,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:42" (3/4) ... [2024-11-07 08:17:46,237 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:17:46,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:17:46,239 INFO L158 Benchmark]: Toolchain (without parser) took 4128.42ms. Allocated memory is still 100.7MB. Free memory was 77.2MB in the beginning and 46.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-07 08:17:46,239 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:46,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.18ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:17:46,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 62.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:17:46,241 INFO L158 Benchmark]: Boogie Preprocessor took 54.07ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:46,241 INFO L158 Benchmark]: RCFGBuilder took 355.44ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 45.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:17:46,241 INFO L158 Benchmark]: TraceAbstraction took 3401.74ms. Allocated memory is still 100.7MB. Free memory was 45.4MB in the beginning and 47.0MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:46,242 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 46.1MB in the end (delta: 941.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:17:46,243 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.19ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.18ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 64.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 100.7MB. Free memory was 64.3MB in the beginning and 62.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.07ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 355.44ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 45.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3401.74ms. Allocated memory is still 100.7MB. Free memory was 45.4MB in the beginning and 47.0MB in the end (delta: -1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory was 47.0MB in the beginning and 46.1MB in the end (delta: 941.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed long int var_1_2 = -8; [L24] signed long int var_1_3 = 128; [L25] unsigned char var_1_5 = 0; [L26] float var_1_6 = 128.625; [L27] float var_1_7 = 2.625; [L28] float var_1_8 = 25.5; [L29] float var_1_9 = 4.75; [L30] float var_1_10 = 16.4; [L31] float var_1_11 = 0.2; [L32] float var_1_12 = 499.1; [L33] unsigned char var_1_13 = 0; [L34] signed long int var_1_14 = -8; [L35] unsigned char var_1_15 = 1; [L36] unsigned char last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L69] var_1_3 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L70] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L72] var_1_5 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L76] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L83] var_1_12 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L84] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L85] var_1_14 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L86] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L87] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L87] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L88] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L88] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L106] RET updateVariables() [L107] CALL step() [L40] signed long int stepLocal_1 = var_1_3; [L41] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-2, stepLocal_1=-1, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L42] COND FALSE !(! (-50 < var_1_2)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-2, stepLocal_1=-1, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L51] COND FALSE !(var_1_2 > (var_1_3 / var_1_14)) [L58] var_1_13 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-2, stepLocal_1=-1, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L60] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-2, stepLocal_1=-1, var_1_11=1/5, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L63] var_1_11 = (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-2, stepLocal_1=-1, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L107] RET step() [L108] CALL, EXPR property() [L97-L98] return ((((! (-50 < var_1_2)) ? ((var_1_2 != var_1_3) ? ((var_1_3 <= var_1_2) ? (var_1_1 == ((unsigned char) (last_1_var_1_13 && var_1_5))) : 1) : (var_1_1 == ((unsigned char) var_1_5))) : 1) && (var_1_13 ? (var_1_6 == ((float) (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) > (var_1_10)) ? ((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) : (var_1_10))))) : 1)) && (var_1_11 == ((float) (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f)))) && ((var_1_2 > (var_1_3 / var_1_14)) ? (var_1_1 ? (var_1_13 == ((unsigned char) (! var_1_15))) : (var_1_13 == ((unsigned char) 0))) : (var_1_13 == ((unsigned char) var_1_5))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_1=0, var_1_2=-2, var_1_3=-1, var_1_5=0, var_1_6=1029/8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 127 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 121 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 283 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 53 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1830/1920 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 08:17:46,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.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 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:17:48,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:17:48,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:17:48,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:17:48,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:17:48,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:17:48,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:17:48,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:17:48,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:17:48,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:17:48,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:17:48,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:17:48,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:17:48,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:17:48,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:17:48,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:17:48,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:17:48,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:17:48,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:17:48,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:17:48,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:17:48,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:17:48,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:48,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:17:48,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:17:48,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:17:48,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:17:48,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:17:48,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:17:48,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:17:48,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:17:48,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:17:48,654 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 -> 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 [2024-11-07 08:17:48,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:17:48,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:17:48,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:17:48,996 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:17:48,996 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:17:48,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:50,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:17:50,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:17:50,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:50,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0d19b9f2/9ef55fbc00b84ad3bd49441e574004ba/FLAGe77b6ad0b [2024-11-07 08:17:50,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0d19b9f2/9ef55fbc00b84ad3bd49441e574004ba [2024-11-07 08:17:50,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:17:50,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:17:50,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:50,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:17:50,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:17:50,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5cd6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50, skipping insertion in model container [2024-11-07 08:17:50,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:17:50,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i[915,928] [2024-11-07 08:17:50,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:50,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:17:50,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i[915,928] [2024-11-07 08:17:50,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:17:50,864 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:17:50,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50 WrapperNode [2024-11-07 08:17:50,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:17:50,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:50,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:17:50,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:17:50,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,920 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-07 08:17:50,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:17:50,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:17:50,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:17:50,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:17:50,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,954 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 08:17:50,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:17:50,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:17:50,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:17:50,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:17:50,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (1/1) ... [2024-11-07 08:17:50,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:17:51,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:17:51,019 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 08:17:51,023 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 08:17:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:17:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:17:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:17:51,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:17:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:17:51,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:17:51,137 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:17:51,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:17:51,808 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-07 08:17:51,808 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:17:51,821 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:17:51,821 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:17:51,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:51 BoogieIcfgContainer [2024-11-07 08:17:51,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:17:51,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:17:51,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:17:51,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:17:51,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:17:50" (1/3) ... [2024-11-07 08:17:51,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382bdf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:51, skipping insertion in model container [2024-11-07 08:17:51,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:17:50" (2/3) ... [2024-11-07 08:17:51,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382bdf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:17:51, skipping insertion in model container [2024-11-07 08:17:51,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:17:51" (3/3) ... [2024-11-07 08:17:51,834 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i [2024-11-07 08:17:51,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:17:51,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:17:51,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:17:51,945 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;@3541a278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:17:51,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:17:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:51,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:51,967 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:51,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:51,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash -222045186, now seen corresponding path program 1 times [2024-11-07 08:17:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:17:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170906943] [2024-11-07 08:17:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:51,987 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 08:17:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:17:51,992 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 08:17:51,994 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 08:17:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 08:17:52,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:17:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-07 08:17:52,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 08:17:52,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:17:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170906943] [2024-11-07 08:17:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170906943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:17:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:17:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:17:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125146918] [2024-11-07 08:17:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:17:52,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:17:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:17:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:17:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:52,399 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:52,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:52,420 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2024-11-07 08:17:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:17:52,422 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-07 08:17:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:52,427 INFO L225 Difference]: With dead ends: 103 [2024-11-07 08:17:52,428 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 08:17:52,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:17:52,433 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:52,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:17:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 08:17:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 08:17:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 08:17:52,479 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 103 [2024-11-07 08:17:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:52,480 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 08:17:52,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 08:17:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 08:17:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:52,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:52,487 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:52,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 08:17:52,688 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 08:17:52,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 644726474, now seen corresponding path program 1 times [2024-11-07 08:17:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:17:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143575658] [2024-11-07 08:17:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:52,690 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 08:17:52,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:17:52,693 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 08:17:52,696 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 08:17:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:52,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 08:17:52,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:17:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-07 08:17:53,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:17:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-07 08:17:53,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 08:17:53,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143575658] [2024-11-07 08:17:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143575658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:17:53,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:17:53,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 08:17:53,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573993691] [2024-11-07 08:17:53,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:17:53,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:17:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 08:17:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:17:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:17:53,619 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 08:17:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:17:54,412 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2024-11-07 08:17:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 08:17:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2024-11-07 08:17:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:17:54,415 INFO L225 Difference]: With dead ends: 157 [2024-11-07 08:17:54,416 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 08:17:54,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 08:17:54,417 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 140 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:17:54,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 145 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:17:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 08:17:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 54. [2024-11-07 08:17:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 08:17:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-07 08:17:54,435 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 103 [2024-11-07 08:17:54,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:17:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-07 08:17:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-07 08:17:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-07 08:17:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 08:17:54,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:17:54,440 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:17:54,459 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 08:17:54,640 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 08:17:54,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:17:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:17:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash 701984776, now seen corresponding path program 1 times [2024-11-07 08:17:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 08:17:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739093227] [2024-11-07 08:17:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:17:54,642 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 08:17:54,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 08:17:54,646 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 08:17:54,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 08:17:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:17:54,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 08:17:54,898 INFO L278 TraceCheckSpWp]: Computing forward predicates...