./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.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_floatingpointinfluence_has-floats_file-14.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', '7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2'] 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_floatingpointinfluence_has-floats_file-14.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 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:33:55,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:33:55,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:33:55,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:33:55,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:33:55,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:33:55,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:33:55,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:33:55,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:33:55,852 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:33:55,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:33:55,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:33:55,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:33:55,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:33:55,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:33:55,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:33:55,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:33:55,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:55,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:33:55,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:33:55,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:33:55,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:33:55,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:33:55,855 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 -> 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 [2024-11-07 07:33:56,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:33:56,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:33:56,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:33:56,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:33:56,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:33:56,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:33:57,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:33:57,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:33:57,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:33:57,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0579faec2/4cb36e974dec487584fca1f7e5c7574d/FLAG7f084e4e2 [2024-11-07 07:33:57,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0579faec2/4cb36e974dec487584fca1f7e5c7574d [2024-11-07 07:33:57,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:33:57,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:33:57,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:57,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:33:57,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:33:57,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:57" (1/1) ... [2024-11-07 07:33:57,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5deebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:57, skipping insertion in model container [2024-11-07 07:33:57,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:33:57" (1/1) ... [2024-11-07 07:33:57,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:33:57,965 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_floatingpointinfluence_has-floats_file-14.i[917,930] [2024-11-07 07:33:58,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:58,035 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:33:58,046 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_floatingpointinfluence_has-floats_file-14.i[917,930] [2024-11-07 07:33:58,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:33:58,102 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:33:58,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58 WrapperNode [2024-11-07 07:33:58,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:33:58,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:58,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:33:58,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:33:58,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,155 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-07 07:33:58,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:33:58,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:33:58,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:33:58,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:33:58,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,190 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 07:33:58,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:33:58,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:33:58,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:33:58,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:33:58,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (1/1) ... [2024-11-07 07:33:58,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:33:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:33:58,248 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 07:33:58,252 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 07:33:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:33:58,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:33:58,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:33:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:33:58,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:33:58,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:33:58,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:33:58,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:33:58,649 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 07:33:58,649 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:33:58,658 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:33:58,658 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:33:58,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:58 BoogieIcfgContainer [2024-11-07 07:33:58,659 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:33:58,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:33:58,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:33:58,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:33:58,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:33:57" (1/3) ... [2024-11-07 07:33:58,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36774eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:58, skipping insertion in model container [2024-11-07 07:33:58,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:33:58" (2/3) ... [2024-11-07 07:33:58,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36774eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:33:58, skipping insertion in model container [2024-11-07 07:33:58,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:58" (3/3) ... [2024-11-07 07:33:58,668 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:33:58,681 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:33:58,682 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:33:58,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:33:58,747 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;@5c7b8a62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:33:58,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:33:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 07:33:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:33:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:58,768 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:33:58,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:58,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 173013582, now seen corresponding path program 1 times [2024-11-07 07:33:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203372628] [2024-11-07 07:33:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:33:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:33:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:33:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:33:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:33:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:33:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:33:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:33:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:33:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:33:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:33:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:33:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:33:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:33:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:33:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 07:33:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:59,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203372628] [2024-11-07 07:33:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203372628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:59,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:59,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:33:59,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328039260] [2024-11-07 07:33:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:59,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:33:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:59,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:33:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:33:59,252 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 07:33:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:33:59,281 INFO L93 Difference]: Finished difference Result 109 states and 187 transitions. [2024-11-07 07:33:59,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:33:59,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-11-07 07:33:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:33:59,288 INFO L225 Difference]: With dead ends: 109 [2024-11-07 07:33:59,289 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 07:33:59,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 07:33:59,294 INFO L432 NwaCegarLoop]: 79 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, 79 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 07:33:59,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:33:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 07:33:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 07:33:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 07:33:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 07:33:59,343 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 131 [2024-11-07 07:33:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:33:59,344 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 07:33:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 07:33:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 07:33:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:33:59,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:33:59,350 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:33:59,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:33:59,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:33:59,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:33:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1923071244, now seen corresponding path program 1 times [2024-11-07 07:33:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:33:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132459223] [2024-11-07 07:33:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:33:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:33:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:33:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:33:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:33:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:33:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:33:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:33:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:33:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:33:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:33:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:33:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:33:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:33:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:33:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:33:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:33:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:33:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:33:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:33:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:33:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:33:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:33:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:33:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 07:33:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:33:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132459223] [2024-11-07 07:33:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132459223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:33:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:33:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:33:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894702282] [2024-11-07 07:33:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:33:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:33:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:33:59,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:33:59,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:33:59,985 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 07:34:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:00,160 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-07 07:34:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:34:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-11-07 07:34:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:00,163 INFO L225 Difference]: With dead ends: 157 [2024-11-07 07:34:00,163 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 07:34:00,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:34:00,165 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:00,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:34:00,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 07:34:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-07 07:34:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:34:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-07 07:34:00,198 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 131 [2024-11-07 07:34:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-07 07:34:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 07:34:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-07 07:34:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:00,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:00,203 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:34:00,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:00,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:00,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1691837682, now seen corresponding path program 1 times [2024-11-07 07:34:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:34:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383451112] [2024-11-07 07:34:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:34:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:34:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:34:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:34:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:34:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:34:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:34:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:34:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:34:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:34:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:34:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:34:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:34:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:34:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:34:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:34:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 07:34:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:34:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 07:34:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 07:34:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 07:34:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 07:34:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 07:34:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:34:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383451112] [2024-11-07 07:34:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383451112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:34:00,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771829927] [2024-11-07 07:34:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:00,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:34:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:34:00,861 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 07:34:00,862 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 07:34:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:01,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 07:34:01,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:34:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 07:34:01,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:34:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 07:34:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771829927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:34:01,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:34:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-11-07 07:34:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538556544] [2024-11-07 07:34:01,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:34:01,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:34:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:34:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:34:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:34:01,538 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:34:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:01,827 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-07 07:34:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:34:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 131 [2024-11-07 07:34:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:01,830 INFO L225 Difference]: With dead ends: 157 [2024-11-07 07:34:01,830 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 07:34:01,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:34:01,833 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:01,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 131 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:34:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 07:34:01,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-07 07:34:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:34:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-07 07:34:01,864 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 131 [2024-11-07 07:34:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:01,866 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-07 07:34:01,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:34:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-07 07:34:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:01,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:01,871 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:01,891 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 07:34:02,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:34:02,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:02,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1689990640, now seen corresponding path program 1 times [2024-11-07 07:34:02,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:34:02,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322247652] [2024-11-07 07:34:02,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:02,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:34:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:34:02,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:34:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:34:02,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:34:02,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:34:02,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:34:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:34:02,312 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 07:34:02,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:34:02,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:34:02 BoogieIcfgContainer [2024-11-07 07:34:02,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:34:02,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:34:02,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:34:02,406 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:34:02,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:33:58" (3/4) ... [2024-11-07 07:34:02,409 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:34:02,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:34:02,413 INFO L158 Benchmark]: Toolchain (without parser) took 4599.89ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 92.0MB in the beginning and 74.2MB in the end (delta: 17.8MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-11-07 07:34:02,413 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:34:02,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.51ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:34:02,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.85ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:34:02,414 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:34:02,414 INFO L158 Benchmark]: RCFGBuilder took 445.58ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 56.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:34:02,414 INFO L158 Benchmark]: TraceAbstraction took 3744.21ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 74.2MB in the end (delta: -18.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-07 07:34:02,414 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 151.0MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:34:02,416 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.59ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.51ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.6MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.85ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 76.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 72.7MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 445.58ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 56.0MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3744.21ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.4MB in the beginning and 74.2MB in the end (delta: -18.8MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 151.0MB. Free memory was 74.2MB in the beginning and 74.2MB in the end (delta: 52.0kB). 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 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] float var_1_13 = 32.25; [L34] float var_1_14 = 15.5; [L35] float var_1_15 = 256.25; [L36] double var_1_16 = 8.6; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=129/4, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L89] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_14=31/2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L91] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_15=1025/4, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L93] var_1_15 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L94] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_16=43/5, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L98] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L99] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L113] RET updateVariables() [L114] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L47] COND FALSE !((var_1_13 / var_1_14) <= var_1_15) [L54] var_1_12 = var_1_8 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L56] COND TRUE ((var_1_5 >= var_1_12) && var_1_2) && var_1_3 [L57] var_1_9 = (! var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=8199, var_1_17=-1073545218, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=8199, var_1_6=8199, var_1_7=16382, var_1_8=8199, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 196 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 204 mSDtfsCounter, 196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 655 NumberOfCodeBlocks, 655 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 650 ConstructedInterpolants, 0 QuantifiedInterpolants, 1205 SizeOfPredicates, 1 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4110/4200 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 07:34:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_floatingpointinfluence_has-floats_file-14.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 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:34:04,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:34:04,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:34:04,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:34:04,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:34:04,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:34:04,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:34:04,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:34:04,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:34:04,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:34:04,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:34:04,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:34:04,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:34:04,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:34:04,833 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:34:04,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:34:04,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:34:04,834 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:34:04,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:34:04,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:34:04,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:34:04,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:34:04,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:34:04,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:34:04,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:34:04,837 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 -> 7b7655166bbb063cb0d79efc7c92a46a87667bfeb3cee7f7b538fb162cb5eed2 [2024-11-07 07:34:05,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:34:05,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:34:05,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:34:05,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:34:05,147 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:34:05,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:34:06,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:34:06,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:34:06,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:34:06,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4ac39c55/a1e49cf84d454d75b68f52727c34ba00/FLAGe216c0461 [2024-11-07 07:34:06,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4ac39c55/a1e49cf84d454d75b68f52727c34ba00 [2024-11-07 07:34:06,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:34:06,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:34:06,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:34:06,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:34:06,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:34:06,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:34:06" (1/1) ... [2024-11-07 07:34:06,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6d2908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:06, skipping insertion in model container [2024-11-07 07:34:06,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:34:06" (1/1) ... [2024-11-07 07:34:06,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:34:06,987 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_floatingpointinfluence_has-floats_file-14.i[917,930] [2024-11-07 07:34:07,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:34:07,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:34:07,067 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_floatingpointinfluence_has-floats_file-14.i[917,930] [2024-11-07 07:34:07,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:34:07,102 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:34:07,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07 WrapperNode [2024-11-07 07:34:07,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:34:07,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:34:07,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:34:07,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:34:07,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,146 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-07 07:34:07,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:34:07,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:34:07,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:34:07,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:34:07,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,184 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 07:34:07,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:34:07,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:34:07,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:34:07,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:34:07,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (1/1) ... [2024-11-07 07:34:07,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:34:07,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:34:07,255 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 07:34:07,261 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 07:34:07,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:34:07,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:34:07,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:34:07,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:34:07,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:34:07,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:34:07,374 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:34:07,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:34:11,466 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 07:34:11,467 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:34:11,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:34:11,476 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:34:11,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:34:11 BoogieIcfgContainer [2024-11-07 07:34:11,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:34:11,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:34:11,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:34:11,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:34:11,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:34:06" (1/3) ... [2024-11-07 07:34:11,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd3a663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:34:11, skipping insertion in model container [2024-11-07 07:34:11,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:34:07" (2/3) ... [2024-11-07 07:34:11,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd3a663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:34:11, skipping insertion in model container [2024-11-07 07:34:11,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:34:11" (3/3) ... [2024-11-07 07:34:11,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-14.i [2024-11-07 07:34:11,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:34:11,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:34:11,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:34:11,573 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;@2657d88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:34:11,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:34:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 07:34:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:11,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:11,589 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:11,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:11,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:11,593 INFO L85 PathProgramCache]: Analyzing trace with hash 173013582, now seen corresponding path program 1 times [2024-11-07 07:34:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:34:11,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913645765] [2024-11-07 07:34:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:11,601 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 07:34:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:34:11,604 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 07:34:11,606 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 07:34:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:11,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:34:11,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:34:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-11-07 07:34:12,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:34:12,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:34:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913645765] [2024-11-07 07:34:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913645765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:34:12,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:34:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:34:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635970652] [2024-11-07 07:34:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:34:12,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:34:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:34:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:34:12,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:34:12,036 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 07:34:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:12,056 INFO L93 Difference]: Finished difference Result 109 states and 187 transitions. [2024-11-07 07:34:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:34:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 131 [2024-11-07 07:34:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:12,067 INFO L225 Difference]: With dead ends: 109 [2024-11-07 07:34:12,067 INFO L226 Difference]: Without dead ends: 54 [2024-11-07 07:34:12,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 07:34:12,073 INFO L432 NwaCegarLoop]: 79 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, 79 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 07:34:12,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:34:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-07 07:34:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-07 07:34:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 07:34:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-07 07:34:12,109 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 131 [2024-11-07 07:34:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-07 07:34:12,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 07:34:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-07 07:34:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:12,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:12,112 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:12,122 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 07:34:12,313 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 07:34:12,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1923071244, now seen corresponding path program 1 times [2024-11-07 07:34:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:34:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144222499] [2024-11-07 07:34:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:12,316 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 07:34:12,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:34:12,319 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 07:34:12,321 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 07:34:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:12,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 07:34:12,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:34:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 07:34:13,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:34:13,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:34:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144222499] [2024-11-07 07:34:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144222499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:34:13,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:34:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:34:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79527427] [2024-11-07 07:34:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:34:13,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:34:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:34:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:34:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:34:13,626 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 07:34:16,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:18,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:18,093 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2024-11-07 07:34:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:34:18,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 131 [2024-11-07 07:34:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:18,124 INFO L225 Difference]: With dead ends: 160 [2024-11-07 07:34:18,124 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 07:34:18,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:34:18,125 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 46 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:18,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 221 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-07 07:34:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 07:34:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2024-11-07 07:34:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:34:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-07 07:34:18,161 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 131 [2024-11-07 07:34:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:18,161 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-07 07:34:18,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 07:34:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-07 07:34:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:18,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:18,163 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:18,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:34:18,364 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 07:34:18,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:18,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:18,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1691837682, now seen corresponding path program 1 times [2024-11-07 07:34:18,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:34:18,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807012615] [2024-11-07 07:34:18,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:18,366 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 07:34:18,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:34:18,368 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 07:34:18,369 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 07:34:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:18,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:34:18,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:34:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 07:34:19,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:34:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-07 07:34:20,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:34:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807012615] [2024-11-07 07:34:20,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807012615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:34:20,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:34:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 07:34:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782626981] [2024-11-07 07:34:20,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:34:20,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:34:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:34:20,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:34:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:34:20,053 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:34:22,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 07:34:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:34:22,162 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2024-11-07 07:34:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:34:22,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 131 [2024-11-07 07:34:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:34:22,200 INFO L225 Difference]: With dead ends: 157 [2024-11-07 07:34:22,200 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 07:34:22,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:34:22,201 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:34:22,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 07:34:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 07:34:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-07 07:34:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:34:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2024-11-07 07:34:22,221 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 131 [2024-11-07 07:34:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:34:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2024-11-07 07:34:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 07:34:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2024-11-07 07:34:22,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 07:34:22,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:34:22,224 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:22,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 07:34:22,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:34:22,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:34:22,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:34:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1689990640, now seen corresponding path program 1 times [2024-11-07 07:34:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:34:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797891009] [2024-11-07 07:34:22,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:34:22,426 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 07:34:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:34:22,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:34:22,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 07:34:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:34:22,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 07:34:22,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:35:02,999 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)